摘要
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of F identical factories or shops, each one with m machines disposed in series. A set of n available jobs have to be distributed among the F factories and then a processing sequence has to be derived for the jobs assigned to each factory. The optimization criterion is the minimization of the maximum completion time or makespan among the factories. This production setting is necessary in today's decentralized and globalized economy where several production centers might be available for a firm. We characterize the DPFSP and propose six different alternative mixed integer linear programming (MILD) models that are carefully and statistically analyzed for performance. We also propose two simple factory assignment rules together with 14 heuristics based on dispatching rules, effective constructive heuristics and variable neighborhood descent methods.
学科与关键词
- A review and classification on distributed permutation flowshop scheduling problemsPerez-Gonzalez, Paz; Framinan, Jose M.*EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2024, 312(1): 1-21.被引 33
- The distributed permutation flow shop to minimise the total flowtimeFernandez-Viagas, Victor*; Perez-Gonzalez, Paz; Framinan, Jose M.COMPUTERS & INDUSTRIAL ENGINEERING, 2018, 118: 464-477.被引 133
- A bounded-search iterated greedy algorithm for the distributed permutation flowshop scheduling problemFernandez-Viagas, Victor*; Framinan, Jose M.International Journal of Production Research, 2015, 53(4): 1111-1123.被引 172
