Flow shop scheduling algorithm to optimize warehouse activities

Article history: Received April 22 2015 Received in Revised Format July 23 2015 Accepted July 28 2015 Available online August 1 2015 Successful flow-shop scheduling outlines a more rapid and efficient process of order fulfilment in warehouse activities. Indeed the way and the speed of order processing and, in particular, the operations concerning materials handling between the upper stocking area and a lower forward picking one must be optimized. The two activities, drops and pickings, have considerable impact on important performance parameters for Supply Chain wholesaler companies. In this paper, a new flow shop scheduling algorithm is formulated in order to process a greater number of orders by replacing the FIFO logic for the drops activities of a wholesaler company on a daily basis. The System Dynamics modelling and simulation have been used to simulate the actual scenario and the output solutions. Finally, a t-Student test validates the modelled algorithm, granting that it can be used for all wholesalers based on drop and picking activities. © 2016 Growing Science Ltd. All rights reserved

[1]  L. Gelders,et al.  Four simple heuristics for scheduling a flow-shop , 1978 .

[2]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[3]  Mariagrazia Dotoli,et al.  An integrated approach for warehouse analysis and optimization: A case study , 2015, Comput. Ind..

[4]  Hitoshi Tsubone,et al.  Production and scheduling system in the flow shop , 1988 .

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

[6]  João Vitor Moccellin,et al.  A New Heuristic Method for the Permutation Flow Shop Scheduling Problem , 1995 .

[7]  A. Hertz,et al.  A new heuristic method for the flow shop sequencing problem , 1989 .

[8]  Graham McMahon,et al.  The two-machine flow shop problem with arbitrary precedence relations , 1993 .

[9]  R. A. Dudek,et al.  A Heuristic Algorithm for the n Job, m Machine Sequencing Problem , 1970 .

[10]  Ziaul Huq,et al.  The sensitivity of rule combinations for scheduling in a hybrid job shop , 1995 .

[11]  Marcello Braglia,et al.  A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness , 2009 .

[12]  C. Rajendran.  Heuristics for scheduling in flowshop with multiple objectives , 1995 .

[13]  Hitoshi Tsubone,et al.  The impact of lot sizing and sequencing on manufacturing performance in a two-stage hybrid flow shop , 1996 .

[14]  Peter A. Pinto,et al.  Joint lot-sizing and scheduling for multi-stage multi-product flow shops , 1992 .

[15]  Oded Berman,et al.  A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems , 1999, Oper. Res..

[16]  Wei Wang,et al.  General modeling and simulation for enterprise operational decision-making problem: A policy-combination perspective , 2012, Simul. Model. Pract. Theory.

[17]  Jatinder N. D. Gupta,et al.  A Functional Heuristic Algorithm for the Flowshop Scheduling Problem , 1971 .

[18]  Alix Munier.  The complexity of a cyclic scheduling problem with identical machines and precedence constraints , 1996 .

[19]  Beatriz Murrieta Cortés,et al.  Multi-objective flow-shop scheduling with parallel machines , 2012 .

[20]  Ali Allahverdi,et al.  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness , 2004, Comput. Oper. Res..

[21]  Chandrasekharan Rajendran,et al.  A multi-objective simulated-annealing algorithm for scheduling in flowshops to minimize the makespan and total flowtime of jobs , 2005, Eur. J. Oper. Res..

[22]  A. S. Spachis,et al.  Heuristics for flow-shop scheduling , 1980 .

[23]  Jatinder N. D. Gupta,et al.  Local search heuristics for two-stage flow shop problems with secondary criterion , 2002, Comput. Oper. Res..

[24]  Khalil S. Hindi,et al.  Detailed scheduling for a class of two-stage intermittent manufacturing systems , 1992 .

[25]  Jan Karel Lenstra,et al.  PREEMPTIVE SCHEDULING IN A TWO-STAGE MULTIPROCESSOR FLOW SHOP IS NP-HARD , 1996 .

[26]  Jose M. Framiñan,et al.  Production , Manufacturing and Logistics Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation , 2002 .

[27]  Chelliah Sriskandarajah,et al.  The complexity of scheduling jobs in repetitive manufacturing systems , 1993 .

[28]  Serol Bulkan,et al.  Comparison of Genetic Algorithm and Particle Swarm Optimization for Bicriteria Permutation Flowshop Scheduling Problem , 2008 .

[29]  Robert J. Wittrock,et al.  An Adaptable Scheduling Algorithm for Flexible Flow Lines , 1988, Oper. Res..

[30]  Seetharama L. Narasimhan,et al.  A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP , 1987 .

[31]  C.-J. Liao,et al.  Bicriterion scheduling in the two-machine flowshop , 1997 .

[32]  Candace Arai Yano,et al.  Cyclic scheduling to minimize inventory in a batch flow line , 1994 .

[33]  Seetuarma L. Narastmhan,et al.  Scheduling in a two-stage manufacturing process , 1984 .

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

[35]  Thom J. Hodgson,et al.  Optimal hybrid push/pull control strategies for a parallel multistage system: Part II , 1991 .

[36]  Hamid Davoud Pour.  A new heuristic for the n-job, m-machine flow-shop problem , 2001 .

[37]  Pankaj Chandra,et al.  Permutation flow shop scheduling with earliness and tardiness penalties , 2004 .

[38]  J. Kamburowski,et al.  On the NEH heuristic for minimizing the makespan in permutation flow shops , 2007 .

[39]  Gupta J.N.D..  TWO-STAGE HYBRID FLOW SHOP SCHEDULING PROBLEM , 1988 .

[40]  Riccardo Manzini,et al.  A decision-support system for the design and management of warehousing systems , 2014, Comput. Ind..

[41]  Venkata Ranga Neppalli,et al.  Minimizing total flow time in a two-machine flowshop problem with minimum makespan , 2001 .

[42]  Kut C. So,et al.  Some heuristics for scheduling jobs on parallel machines with setups , 1990 .

[43]  Chandrasekharan Rajendran,et al.  A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria , 1994 .

[44]  A. Guinet.  Scheduling sequence-dependent jobs on identical parallel machines to minimize completion time criteria , 1993 .

[45]  Claire Hanen,et al.  Study of a NP-hard cyclic scheduling problem: The recurrent job-shop , 1994 .

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

[47]  Neil Collier,et al.  Scenario modelling to support industry strategic planning and decision making , 2014, Environ. Model. Softw..

[48]  Said Ashour.  A MODIFIED DECOMPOSITION ALGORITHM FOR SCHEDULING PROBLEMS , 1970 .

[49]  Pandu R. Tadikamalla,et al.  An integrated approach for production planning—A case study , 1991 .

[50]  D. S. Palmer.  Sequencing Jobs Through a Multi-Stage Process in the Minimum Total Time—A Quick Method of Obtaining a Near Optimum , 1965 .

[51]  A. Noorul Haq,et al.  A bicriterian flow shop scheduling using artificial neural network , 2006 .

[52]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[53]  R. Uzsoy.  Scheduling a single batch processing machine with non-identical job sizes , 1994 .

[54]  H Tsubone,et al.  A production scheduling system for a hybrid flow shop--a case study , 1993 .

[55]  Sunderesh S. Heragu,et al.  A Branch-and-Bound Approach for a Two-machine Flowshop Scheduling Problem , 1995 .

[56]  J E C Arroyo,et al.  A partial enumeration heuristic for multi-objective flowshop scheduling problems , 2004, J. Oper. Res. Soc..

[57]  Said Ashour.  A DECOMPOSITION APPROACH FOR THE MACHINE SCHEDULING PROBLEM , 1967 .

[58]  Bahram Alidaee,et al.  Two parallel machine sequencing problems involving controllable job processing times , 1993 .

[59]  Yoichi Miyake,et al.  Production scheduling system in the hybrid flow shop , 1993 .

[60]  Wenxin Liu,et al.  A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment , 2005, J. Intell. Manuf..

[61]  Ertan Güner,et al.  The tricriteria flowshop scheduling problem , 2008 .

[62]  Dean H. Kropp,et al.  Lot Splitting in Stochastic Flow Shop and Job Shop Environments , 1996 .

[63]  F. Robert Jacobs,et al.  REPETITIVE LOTS: FLOW-TIME REDUCTIONS THROUGH SEQUENCING AND DYNAMIC BATCH SIZING , 1988 .

[64]  S. S. Panwalkar,et al.  Scheduling of a Two-machine Flowshop with Travel Time Between Machines , 1991 .

[65]  J. A. Muckstadt,et al.  An approach to production planning and scheduling in cyclically scheduled manufacturing systems , 1994 .

[66]  Robert W. Hall.  Cyclic scheduling for improvement , 1988 .

[67]  David D. Bedworth,et al.  Flow shop scheduling in serial multi-product processes with transfer and set-up times , 1992 .

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

[69]  C. Dennis Pegden,et al.  A survey and evaluation of static flowshop scheduling heuristics , 1984 .

[70]  Jatinder N. D. Gupta,et al.  Flow-shop scheduling by heuristic decomposition , 1973 .

[71]  M. Solomon,et al.  Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time , 1996 .

[72]  R. J. Paul.  A Production Scheduling Problem in the Glass-Container Industry , 1979, Oper. Res..

[73]  Jose M. Framiñan,et al.  A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria , 2008, OR Spectr..

[74]  Jatinder N. D. Gupta,et al.  Heuristic Algorithms for Multistage Flowshop Scheduling Problem , 1972 .

[75]  Armen Bagdasaryan,et al.  Discrete dynamic simulation models and technique for complex control systems , 2011, Simul. Model. Pract. Theory.

[76]  J. Gupta,et al.  Schedules for a two-stage hybrid flowshop with parallel machines at the second stage , 1991 .

[77]  Helena Ramalhinho Dias Lourenço,et al.  Sevast'yanov's algorithm for the flow-shop scheduling problem , 1996 .