The distributed permutation flowshop scheduling problem with different transport timetables and loading capacities

In this paper, a new type of distributed permutation flow-shop scheduling problem (DPFSP) is proposed, in which different transport timetable and different loading capacity for each factory are considered. Under this model generalization, we assume that there are a total of F different factories and then a sequence has to be calculated for the jobs assigned to each factory. We also assume that the distances to different factories are not equal, transport timetables and loading capacities are also considered. Even though the assumption in this study is necessary for today's economy, there are seldom studies in literature dealing with such constraints. To the best of our knowledge, it is the first report on incorporating vehicle timetables and vehicle capacities to DPFSP. Standard DPFSP is a typical NP-hard problem and this problem is even harder. A simulated annealing based local search with multiple different neighborhoods is used to solve the problem with the objective to minimize the maximum completion time. Three different neighborhood searching methods are also proposed. A comprehensive computational and statistical analysis is conducted in order to analyze the performance of the proposed method.

[1]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[2]  Rubén Ruiz,et al.  A scatter search algorithm for the distributed permutation flowshop scheduling problem , 2014, Eur. J. Oper. Res..

[3]  Ling Wang,et al.  An effective estimation of distribution algorithm for solving the distributed permutation flow-shop scheduling problem , 2013 .

[4]  Rubén Ruiz,et al.  The distributed permutation flowshop scheduling problem , 2010, Comput. Oper. Res..

[5]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[6]  Shouyang Wang,et al.  Scheduling of no-wait stochastic distributed assembly flowshop by hybrid PSO , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[7]  Bo Liu,et al.  An Effective PSO-Based Memetic Algorithm for Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[8]  Sara Hatami,et al.  The Distributed Assembly Permutation Flowshop Scheduling Problem , 2013 .

[9]  Jian Gao,et al.  An efficient tabu search algorithm for the distributed permutation flowshop scheduling problem , 2013 .

[10]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[11]  Rong Chen,et al.  An NEH-based heuristic algorithm for distributed permutation flowshop scheduling problems , 2011 .

[12]  Mostafa Zandieh,et al.  An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness , 2009, Expert Syst. Appl..

[13]  Andy J. Keane,et al.  Meta-Lamarckian learning in memetic algorithms , 2004, IEEE Transactions on Evolutionary Computation.

[14]  Maurice Clerc,et al.  Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem , 2004 .

[15]  Sigrid Knust,et al.  Makespan minimization for flow-shop problems with transportation times and a single robot , 2001, Discret. Appl. Math..

[16]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[17]  Rong Chen,et al.  A Knowledge-based Genetic Algorithm for Permutation Flowshop Scheduling Problems with Multiple Factories , 2012 .

[18]  Bo Liu,et al.  Improved particle swarm optimization combined with chaos , 2005 .

[19]  Inyong Ham,et al.  A heuristic algorithm for the m-machine, n-job flow-shop sequencing problem , 1983 .

[20]  Shouyang Wang,et al.  A hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling with flowline eligibility , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).

[21]  Ran Zhang,et al.  Variable neighborhood based memetic algorithm for distributed assembly permutation flowshop , 2016, 2016 IEEE Congress on Evolutionary Computation (CEC).