| As a flow-shop is a flexible production-line system typically,the scheduling problems related exist in manufacturing enterprises widely,i.e.,permutation flow-shop scheduling problems(denoted as PFSPs).It has been proven that PFSPs are a class of combination optimization and NP problems typically.Thus,the problems are one of classes of most difficult problems in theory.This paper focuses on solving sequence-dependent setup times PFSP with total weighted tardiness minimization(denoted as SDST-PFSP-WT)and PFSP confined in no-waiting condition with make-span minimization objective(denoted as NWPFSP).The two scheduling problems are on the basis of a typical manufacturing environment and a meaningful optimization objective related to PFSP respectively.In this paper,the two scheduling problems have been solved firstly.The research content related is mainly as follows:Currently,hybrid and flexible production-line systems(denoted as FMS)with manufacturing abilities of both multi-product and middle-low productivity are applied in industry widely that is in order to cope with the growing international competition.The aim of multi-product manufacturing FMSs can reach since those systems have a set of properties including the flexibilities of job routing,service-mode and service-selection generally.In general,an enterprise affords massive costs buy devices related to layout a FMS.Thus,the problem that optimally layout FMSs an enterprise should focus on tackling.As performance measurement problem is one key sub-problem of layout optimization problem,and numerical simulation is a mainly efficient method to solve the problem.Thus,another research work related in this paper is to tackle the key problems on numerical simulation to FMSs in the light of the general properties and the problems FMSs encounter together.As for SPST-PFSP-WT,to my best knowledge,the NEH_EWDD heuristic and the IG algorithm with a decent local search have been regarded as the high performing heuristic and the state-of-the-art algorithm for the problem,which are both based on insertion search.Firstly,this paper presents an efficient backtracking algorithm and a novel heuristic(HPIS)for insertion search.Accordingly,two heuristics are introduced,one is NEH_EWDD with HPIS for insertion search(denoted as NEH_EWDD_HPIS),and the other is the combination of NEH_EWDD and both the two methods(denoted as NEH_EWDD_HPIS_ACC).Furthermore,the IG algorithm is improved by integrated with the proposed methods.Finally,experimental results show that both the proposed heuristics and the improved IG(IG*)outperform the original ones.Concerning the NWPFSP,this paper introduces a hybrid meta-heuristic(HA)approach based on iterated greedy(IG)algorithm framework for the problem.Firstly,an improved NEH_EWDD_HPIS is proposed for acquiring an initial solution.Moreover,the author has proposed a block-based destructive strategy,and adopted a tabu-based reconstruction approach introduced by other authors,in the destruction and construction periods of the algorithm respectively;Furthermore,the author has presented an efficient local search that consists of an insert,double-insert and swap operators by hybridizing the ideas of variable neighborhood descent and variable neighborhood search.Finally,results from extensive experiment show the proposed HA is the latest state-of-the-art algorithm for the problem.In order to solve the key problems on numerical simulation,this paper proposed a numerical simulation model based on the presented hybrid modeling methodology of topology-based and event-oriented by analyzing the general properties,and the problems(such as transportation jam,route choice and service selection related to one device),FMSs encounter together.And,the implementation of a simulation system that has universal abilities of simulating a class of FMSs with the flexiblies of routing,service-mode and serviceselection to some extent,based on the proposed simulation model is introduced also. |
PDF Full Text Request