The two stage assembly flow-shop scheduling problem with batching and delivery

Abstract This paper investigates the two-stage assembly flow shop scheduling problem with a batched delivery system where there are m independent machines at the first stage doing the components of a job and multiple identical assembly machines at the second stage, each of which can assemble the components and complete the job. The objective is to schedule the jobs, to form them into batches so as to minimize the sum of tardiness plus delivery costs. To the best of our knowledge, the assembly flow shop scheduling problem with this objective function has not been addressed so far. A mathematical model for this problem is presented. However, due to the fact that this model happens to be a mixed integer nonlinear programming model and cannot guarantee to reach the solution at reasonable time we developed the imperialist competitive algorithm (ICA) and a hybrid algorithm (HICA) by incorporating the dominance relations. Computational results show that HICA performs better than ICA with respect to the value of the objective function, However the runtime of the ICA is less than HICA.

[1]  T. C. Edwin Cheng,et al.  Common due date assignment and scheduling with a rate-modifying activity to minimize the due date, earliness, tardiness, holding, and batch delivery cost , 2012, Comput. Ind. Eng..

[2]  Reza Tavakkoli-Moghaddam,et al.  An approach for modeling a new single machine scheduling problem with deteriorating and learning effects , 2014, Comput. Ind. Eng..

[3]  Ali Tozkapan,et al.  A branch and bound algorithm to minimize the total weighted flowtime for the two-stage assembly scheduling problem , 2003, Comput. Oper. Res..

[4]  Fardin Ahmadizar,et al.  Single-machine batch delivery scheduling with job release dates, due windows and earliness, tardiness, holding and delivery costs , 2015, Comput. Oper. Res..

[5]  Chung Yee Lee,et al.  On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date , 1993 .

[6]  C. Sung,et al.  A two-stage multiple-machine assembly scheduling problem for minimizing sum of completion times , 2008 .

[7]  Mohammad Mahdavi Mazdeh,et al.  A genetic algorithm for minimizing total tardiness/earliness of weighted jobs in a batched delivery system , 2012, Comput. Ind. Eng..

[8]  Fariborz Jolai,et al.  A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop , 2013 .

[9]  Caro Lucas,et al.  Imperialist competitive algorithm: An algorithm for optimization inspired by imperialistic competition , 2007, 2007 IEEE Congress on Evolutionary Computation.

[10]  Ameur Soukhal,et al.  Complexity of flow shop scheduling problems with transportation constraints , 2005, Eur. J. Oper. Res..

[11]  Mostafa Zandieh,et al.  Cloud theory-based simulated annealing approach for scheduling in the two-stage assembly flowshop , 2010, Adv. Eng. Softw..

[12]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[13]  C. Sung,et al.  Makespan minimization for a 2-stage assembly scheduling problem subject to component available time constraint , 2009 .

[14]  Fawaz S. Al-Anzi,et al.  The two-stage assembly flowshop scheduling problem with bicriteria of makespan and mean completion time , 2008 .

[15]  Mohammad Rostami,et al.  Minimizing maximum tardiness and delivery costs with batch delivery and job release times , 2015 .

[16]  Mostafa Zandieh,et al.  A simulated annealing algorithm approach to hybrid flow shop scheduling with sequence-dependent setup times , 2011, J. Intell. Manuf..

[17]  Zhi-Long Chen,et al.  Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs , 1996 .

[18]  Guoqing Wang,et al.  Parallel machine scheduling with batch delivery costs , 2000 .

[19]  Chris N. Potts,et al.  Supply chain scheduling: Batching and delivery , 2003, Oper. Res..

[20]  Ali Allahverdi,et al.  The two stage assembly flowshop scheduling problem to minimize total tardiness , 2012, J. Intell. Manuf..

[21]  Chris N. Potts,et al.  The Two-Stage Assembly Scheduling Problem: Complexity and Approximation , 1995, Oper. Res..

[22]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[23]  Mohammad Rostami,et al.  Minimizing maximum tardiness and delivery costs in a batched delivery system , 2013, Comput. Ind. Eng..

[24]  Guruprasad Pundoor,et al.  Scheduling a production–distribution system to optimize the tradeoff between delivery tardiness and distribution cost , 2005 .

[25]  Fawaz S. Al-Anzi,et al.  A PSO and a Tabu search heuristics for the assembly scheduling problem of the two-stage distributed database application , 2006, Comput. Oper. Res..

[26]  Mohammad Rostami,et al.  A branch-and-bound algorithm for two-machine flow-shop scheduling problems with batch delivery costs , 2014 .

[27]  Bahman Naderi,et al.  A bi-objective imperialist competitive algorithm for no-wait flexible flow lines with sequence dependent setup times , 2015 .

[28]  Marc E. Posner,et al.  Generating Experimental Data for Computational Testing with Machine Scheduling Applications , 2001, Oper. Res..

[29]  E. Shokrollahpour,et al.  A novel imperialist competitive algorithm for bi-criteria scheduling of the assembly flowshop problem , 2011 .

[30]  Fariborz Jolai,et al.  Two-machine flow shop total tardiness scheduling problem with deteriorating jobs , 2012 .

[31]  F. Jolai,et al.  Two-stage flow-shop scheduling problem with non-identical second stage assembly machines , 2013 .

[32]  C. Potts,et al.  A branch and bound algorithm for the two-stage assembly scheduling problem , 1997 .

[33]  Ching-Jong Liao,et al.  A case study in a two-stage hybrid flow shop with setup time and dedicated machines , 2003 .

[34]  T. C. Edwin Cheng,et al.  Single machine scheduling with batch deliveries , 1996 .

[35]  Jairo R. Montoya-Torres,et al.  Ant colony optimization algorithm for a Bi-criteria 2-stage hybrid flowshop scheduling problem , 2011, J. Intell. Manuf..

[36]  Chung-Yee Lee,et al.  Minimizing the makespan in the 3-machine assembly-type flowshop scheduling problem , 1993 .

[37]  Reza Tavakkoli-Moghaddam,et al.  A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations , 2014 .

[38]  T. C. Edwin Cheng,et al.  Single-machine batch delivery scheduling with an assignable common due date and controllable processing times , 2013, Comput. Ind. Eng..

[39]  Mohammad Mahdavi Mazdeh,et al.  A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs , 2007, Eur. J. Oper. Res..

[40]  Fariborz Jolai,et al.  Heuristics for an assembly flow-shop with non-identical assembly machines and sequence dependent setup times to minimize sum of holding and delay costs , 2014, Comput. Oper. Res..