Permutation Flow Shop Scheduling with dynamic job order arrival

The Permutation Flow Shop Scheduling Problem (PFSP) is known as complex combinatorial optimization problem. In PFSPs, the jobs are sequenced by optimizing certain performance measure such as makespan. As of the literature, the existing algorithms deal with static PFSPs. However, in practice, the jobs arrive continuously with random inter-arrival time. It may not be feasible to process all the jobs by satisfying all the constraints. In this paper, we propose a new algorithm, based on Genetic Algorithm (GA), to deal with multiple jobs arriving at different point in time in Permutation Flow Shop environment. To explain the insight of problem complexity, we provide some simulations results.

[1]  Jatinder N. D. Gupta,et al.  Flowshop scheduling research after five decades , 2006, Eur. J. Oper. Res..

[2]  Thomas E. Morton,et al.  Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..

[3]  Can Akkan,et al.  Finite-capacity scheduling-based planning for revenue-based capacity management , 1997, Eur. J. Oper. Res..

[4]  Dvir Shabtay,et al.  Two-machine flow-shop scheduling with rejection , 2012, Comput. Oper. Res..

[5]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[6]  Hideo Tanaka,et al.  Genetic algorithms for flowshop scheduling problems , 1996 .

[7]  Jatinder N. D. Gupta,et al.  Heuristics for hybrid flow shops with controllable processing times and assignable due dates , 2002, Comput. Oper. Res..

[8]  Ruhul A. Sarker,et al.  A memetic algorithm for Permutation Flow Shop Problems , 2013, 2013 IEEE Congress on Evolutionary Computation.

[9]  Rubén Ruiz,et al.  TWO NEW ROBUST GENETIC ALGORITHMS FOR THE FLOWSHOP SCHEDULING PROBLEM , 2006 .

[10]  Whm Henk Zijm,et al.  Order acceptance strategies in a production-to-order environment with setup times and due-dates , 1992 .

[11]  Ieee Staff,et al.  2013 IEEE Conference on Cybernetics and Intelligent Systems (CIS) , 2013 .

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

[13]  Ceyda Oguz,et al.  Metaheuristic approaches to the hybrid flow shop scheduling problem with a cost-related criterion , 2007 .

[14]  Eugene Levner,et al.  On-line scheduling in a surface treatment system , 2000, Eur. J. Oper. Res..

[15]  Walter O. Rom,et al.  Order acceptance using genetic algorithms , 2009, Comput. Oper. Res..

[16]  S. M. Johnson,et al.  Optimal two- and three-stage production schedules with setup times included , 1954 .

[17]  Christos D. Tarantilis,et al.  Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm , 2009, Comput. Oper. Res..

[18]  Gui-Juan Chang,et al.  On-line job shop scheduling with transfer time in supply chain , 2008, 2008 IEEE International Conference on Automation and Logistics.

[19]  Mieczysław Wodecki,et al.  A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[20]  Chandrasekharan Rajendran,et al.  Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs , 2004, Eur. J. Oper. Res..

[21]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[22]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

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

[24]  Rubén Ruiz,et al.  Flow shop rescheduling under different types of disruption , 2013 .

[25]  I. Osman,et al.  Simulated annealing for permutation flow-shop scheduling , 1989 .

[26]  Éric D. Taillard,et al.  Benchmarks for basic scheduling problems , 1993 .

[27]  Paul M. Griffin,et al.  Order selection and scheduling with leadtime flexibility , 2004 .

[28]  Mehmet Fatih Tasgetiren,et al.  A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem , 2007, Eur. J. Oper. Res..

[29]  Antonio Grieco,et al.  An online approach to dynamic rescheduling for production planning applications , 2008 .

[30]  É. Taillard.  Some efficient heuristic methods for the flow shop sequencing problem , 1990 .