Manufacturing synchronization in a hybrid flowshop with dynamic order arrivals

Generally, order punctuality has received plenty of attention by manufacturers in order fulfillment. In order fabrication, jobs from a customer are often separately processed in dispersed manufacturing resources, such as different machines, facilities, or factories. This leads to the difficulties of processing customer orders in a simultaneous manner. This paper proposes a concept of manufacturing synchronization (MfgSync) and measures it from the perspective of simultaneity and punctuality. We study MfgSync of scheduling dynamic arrival orders in a hybrid flowshop. To deal with the dynamic order arrival environment, we schedule the coming orders in a periodic manner so that the dynamic scheduling problem is decomposed into a series of continuous static sub-problems. A base model for each sub-problem is mathematically formulated to minimize the simultaneity of order fabrication measured by mean longest waiting duration considering the order punctuality constraint. We then present a solution algorithm consisting of a periodic scheduling policy and a modified genetic algorithm. Numerical studies demonstrate the effectiveness of the proposed approach. The results also show that bottleneck position has a considerable impact on MfgSync, and we can obtain better MfgSync for the systems with entrance bottlenecks compared to middle and exist bottlenecks. And it is suggested to choose a larger decision interval in off season compared to peak season.

[1]  K. Deb An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[2]  Claudine Chaouiya,et al.  The extended kanban control system for production coordination of assembly manufacturing systems , 2000 .

[3]  Jaehwan Yang,et al.  The complexity of customer order scheduling problems on parallel machines , 2005, Comput. Oper. Res..

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

[5]  Pisal Yenradee,et al.  Modified drum–buffer–rope scheduling mechanism for a non-identical parallel machine flow shop with processing-time variation , 2006 .

[6]  Min Huang,et al.  A decomposition based multiobjective genetic algorithm with adaptive multipopulation strategy for flowshop scheduling problem , 2017, Natural Computing.

[7]  Jan Riezebos,et al.  Order sequencing and capacity balancing in synchronous manufacturing , 2011 .

[8]  John H. Blackstone,et al.  The evolution of a management philosophy: The theory of constraints , 2007 .

[9]  Ping-Shun Chen,et al.  Scheduling on parallel machines to minimise maximum lateness for the customer order problem , 2013, Int. J. Syst. Sci..

[10]  Ihsan Sabuncuoglu,et al.  Rescheduling frequency in an FMS with uncertain processing times and unreliable machines , 1999 .

[11]  Reza H. Ahmadi,et al.  Design for synchronized flow manufacturing , 1994 .

[12]  Joseph Y.-T. Leung,et al.  Order Scheduling in an Environment with Dedicated Resources in Parallel , 2005, J. Sched..

[13]  Marc E. Posner,et al.  Scheduling Parallel Machines for the Customer Order Problem , 2003, J. Sched..

[14]  T. C. Edwin Cheng,et al.  Customer order scheduling to minimize total weighted completion time , 2007 .

[15]  Ceyda Oguz,et al.  A Genetic Algorithm for Hybrid Flow-shop Scheduling with Multiprocessor Tasks , 2005, J. Sched..

[16]  George Q. Huang,et al.  A hybrid evolutionary algorithm with adaptive multi-population strategy for multi-objective optimization problems , 2017, Soft Comput..

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

[18]  Marcelo Seido Nagano,et al.  A Constructive Genetic Algorithm for Permutation Flowshop Scheduling Version 2 , 2007 .

[19]  Armin Scholl,et al.  A survey on problems and methods in generalized assembly line balancing , 2006, Eur. J. Oper. Res..

[20]  I. M. Ovacikt,et al.  Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times , 1994 .

[21]  H. Ishibuchi,et al.  Multi-objective genetic algorithm and its applications to flowshop scheduling , 1996 .

[22]  Bertrand M. T. Lin,et al.  Customer order scheduling to minimize the number of late jobs , 2007, Eur. J. Oper. Res..

[23]  Chung-Lun Li,et al.  Coordinated scheduling of customer orders with decentralized machine locations , 2007 .

[24]  John H. Blackstone,et al.  Theory of constraints - A status report , 2001 .

[25]  Dingwei Wang,et al.  Particle swarm optimization with a leader and followers , 2008 .

[26]  Sanja Petrovic,et al.  SURVEY OF DYNAMIC SCHEDULING IN MANUFACTURING SYSTEMS , 2006 .

[27]  C. Sendil Kumar,et al.  Literature review of JIT-KANBAN system , 2007 .

[28]  Daisuke Hirotani,et al.  Comparing CONWIP, synchronized CONWIP, and Kanban in complex supply chains , 2005 .

[29]  Uttarayan Bagchi,et al.  Coordinated scheduling of customer orders for quick response , 2005 .

[30]  C.-H. Liu,et al.  Improving the delivery efficiency of the customer order scheduling problem in a job shop , 2009, Comput. Ind. Eng..

[31]  Kazuo Furuta,et al.  Predatory Search Strategy Based on Swarm Intelligence for Continuous Optimization Problems , 2013 .

[32]  Jeffrey W. Herrmann,et al.  Rescheduling Manufacturing Systems: A Framework of Strategies, Policies, and Methods , 2003, J. Sched..

[33]  Jatinder N. D. Gupta,et al.  Single machine hierarchical scheduling with customer orders and multiple job classes , 1997, Ann. Oper. Res..

[34]  Xinjie Yu,et al.  Introduction to evolutionary algorithms , 2010, The 40th International Conference on Computers & Indutrial Engineering.

[35]  Kathryn A. Dowsland,et al.  Simulated Annealing , 1989, Encyclopedia of GIS.