Coordinated scheduling of production and transportation in a two-stage assembly flowshop

To enhance the overall performance of supply chains, coordination among production and distribution stages has recently received an increasing interest. This paper considers the coordinated scheduling of production and transportation in a two-stage assembly flowshop environment. In this problem, product components are first produced and assembled in a two-stage assembly flowshop, and then completed final products are delivered to a customer in batches. Considering the NP-hard nature of this scheduling problem, two fast heuristics (SPT-based heuristic and LPT-based heuristic) and a new hybrid meta-heuristic (HGA-OVNS) are presented to minimise the weighted sum of average arrival time at the customer and total delivery cost. To guide the search process to more promising areas, the proposed HGA-OVNS integrates genetic algorithm with variable neighbourhood search (VNS) to generate the offspring individuals. Furthermore, to enhance the effectiveness of VNS, the opposition-based learning (OBL) is applied to establish some novel opposite neighbourhood structures. The proposed algorithms are validated on a set of randomly generated instances, and the computation results indicate the superiority of HGA-OVNS in quality of solutions.

[1]  Morteza Kiani,et al.  An efficient imperialist competitive algorithm for scheduling in the two-stage assembly flow shop problem , 2014 .

[2]  Fawaz S. Al-Anzi,et al.  Better Heuristics for a Two-Stage Multi-Machine Assembly Scheduling Problem to Minimize Total Completion Time , 2012 .

[3]  Shahryar Rahnamayan,et al.  Opposition versus randomness in soft computing techniques , 2008, Appl. Soft Comput..

[4]  T.C.E. Cheng,et al.  Heuristics for parallel-machine scheduling with job class setups and delivery to multiple customers , 2009 .

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

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

[7]  M.M.A. Salama,et al.  Opposition-Based Differential Evolution , 2008, IEEE Transactions on Evolutionary Computation.

[8]  Jing-fang Zhang,et al.  An improved global-best harmony search algorithm for faster optimization , 2014, Expert Syst. Appl..

[9]  George Q. Huang,et al.  Hybrid flow shop scheduling considering machine electricity consumption cost , 2013 .

[10]  Joseph Y.-T. Leung,et al.  A note on scheduling parallel machines subject to breakdown and repair , 2004 .

[11]  Keyi Xing,et al.  Meta-heuristics for the distributed two-stage assembly scheduling problem with bi-criteria of makespan and mean completion time , 2014 .

[12]  Quan-Ke Pan,et al.  A discrete teaching-learning-based optimisation algorithm for realistic flowshop rescheduling problems , 2015, Eng. Appl. Artif. Intell..

[13]  Li Zhao,et al.  A review of opposition-based learning from 2005 to 2012 , 2014, Eng. Appl. Artif. Intell..

[14]  Mostafa Zandieh,et al.  An efficient knowledge-based algorithm for the flexible job shop scheduling problem , 2012, Knowl. Based Syst..

[15]  M. Zandieh,et al.  Bi-criteria flexible job-shop scheduling with sequence-dependent setup times—Variable neighborhood search approach , 2011 .

[16]  Hamid R. Tizhoosh,et al.  Applying Opposition-Based Ideas to the Ant Colony System , 2007, 2007 IEEE Swarm Intelligence Symposium.

[17]  Andrew Lim,et al.  A memetic algorithm for the multiperiod vehicle routing problem with profit , 2013, Eur. J. Oper. Res..

[18]  Fawaz S. Al-Anzi,et al.  An artificial immune system heuristic for two-stage multi-machine assembly scheduling problem to minimize total completion time , 2013 .

[19]  Massimiliano Kaucic A multi-start opposition-based particle swarm optimization algorithm with adaptive velocity for bound constrained global optimization , 2013, J. Glob. Optim..

[20]  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..

[21]  Dan Simon,et al.  Oppositional biogeography-based optimization for combinatorial problems , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[22]  F. Jolai,et al.  Two-stage assembly flow-shop scheduling problem with non-identical assembly machines considering setup times , 2013 .

[23]  Genichi Taguchi,et al.  Introduction to quality engineering.... , 2014 .

[24]  Zhijian Wu,et al.  Enhancing particle swarm optimization using generalized opposition-based learning , 2011, Inf. Sci..

[25]  S. H. Choi,et al.  A holonic approach to flexible flow shop scheduling under stochastic processing times , 2014, Comput. Oper. Res..

[26]  Dayou Liu,et al.  A discrete PSO for two-stage assembly scheduling problem , 2013 .

[27]  Abdellah El Moudni,et al.  Integrated scheduling of production and distribution operations: A review , 2015 .

[28]  Deming Lei,et al.  Variable neighborhood search for two-agent flow shop scheduling problem , 2015, Comput. Ind. Eng..

[29]  Quan-Ke Pan,et al.  A hybrid variable neighborhood search for solving the hybrid flow shop scheduling problem , 2014, Appl. Soft Comput..

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

[31]  Mostafa Zandieh,et al.  Parallel-machine scheduling problems with sequence-dependent setup times using an ACO, SA and VNS hybrid algorithm , 2009, Expert Syst. Appl..

[32]  Jiadong Yang,et al.  A heuristic-based hybrid genetic-variable neighborhood search algorithm for task scheduling in heterogeneous multiprocessor system , 2011, Inf. Sci..

[33]  Hang Lei,et al.  Minimizing the total completion time in a distributed two stage assembly system with setup times , 2014, Comput. Oper. Res..

[34]  Ting Zhang,et al.  Green supply chain coordination with greenhouse gases emissions management: a game-theoretic approach , 2016 .

[35]  Andrew Lim,et al.  The freight consolidation and containerization problem , 2014, Eur. J. Oper. Res..

[36]  Hamid R. Tizhoosh,et al.  Opposition-Based Learning: A New Scheme for Machine Intelligence , 2005, International Conference on Computational Intelligence for Modelling, Control and Automation and International Conference on Intelligent Agents, Web Technologies and Internet Commerce (CIMCA-IAWTIC'06).

[37]  Xiangtao Li,et al.  An opposition-based differential evolution algorithm for permutation flow shop scheduling based on diversity measure , 2013, Adv. Eng. Softw..

[38]  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..

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

[40]  Tomasz Wiśniewski,et al.  Ant colony optimization for job shop scheduling using multi-attribute dispatching rules , 2013 .

[41]  Andrew Lim,et al.  A memetic algorithm for the capacitated m-ring-star problem , 2013, Applied Intelligence.

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

[43]  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..

[44]  Hao Luo,et al.  Synchronisation of production scheduling and shipment in an assembly flowshop , 2015 .

[45]  Pierre Hansen,et al.  Variable neighbourhood search: methods and applications , 2010, Ann. Oper. Res..

[46]  Kai Wang,et al.  An estimation of distribution algorithm for hybrid flow shop scheduling under stochastic processing times , 2014 .

[47]  Andrew Lim,et al.  The tree representation for the pickup and delivery traveling salesman problem with LIFO loading , 2011, Eur. J. Oper. Res..

[48]  Kai Wang,et al.  A fuzzy logic-based hybrid estimation of distribution algorithm for distributed permutation flowshop scheduling problems under machine breakdown , 2016, J. Oper. Res. Soc..

[49]  Pierre Hansen,et al.  Variable Neighborhood Search , 2018, Handbook of Heuristics.

[50]  Pierre Hansen,et al.  Variable Neighbourhood Search , 2003 .

[51]  S. H. Choi,et al.  A hybrid estimation of distribution algorithm for simulation-based scheduling in a stochastic permutation flowshop , 2015, Comput. Ind. Eng..

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

[53]  T. C. Edwin Cheng,et al.  Batch delivery scheduling with batch delivery cost on a single machine , 2007, Eur. J. Oper. Res..

[54]  Mohammad Mahdavi Mazdeh,et al.  A branch-and-bound algorithm for single-machine scheduling with batch delivery and job release times , 2008, Comput. Oper. Res..

[55]  Javad Behnamian,et al.  Decomposition based hybrid VNS-TS algorithm for distributed parallel factories scheduling with virtual corporation , 2014, Comput. Oper. Res..

[56]  Weifeng Gao,et al.  A modified artificial bee colony algorithm , 2012, Comput. Oper. Res..

[57]  Dvir Shabtay,et al.  Scheduling and due date assignment to minimize earliness, tardiness, holding, due date assignment and batch delivery costs , 2010 .

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

[59]  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..

[60]  Hong-Sen Yan,et al.  A hybrid electromagnetism-like algorithm for two-stage assembly flow shop scheduling problem , 2014 .