Job-shop production scheduling with reverse flows

In this paper, we present a modeling approach for the NP-hard scheduling problem Job-shop with reverse flows. This problem is characterized by two flows that cover the same machines but in opposite senses. The objective is to minimize the maximum completion time of the jobs. We start by providing a mathematical formulation and we analyze the complexity and some particular cases of the problem. Then, we propose a heuristic method for solving the NP-hard 3-machine case, which we evaluate by conducting tests on Taillard's benchmark. These tests give satisfying results and show that the heuristic ensures good performance when the two flows have close numbers of jobs.

[1]  Surendra M. Gupta,et al.  Material flow control and scheduling in a disassembly environment , 1998 .

[2]  Matthew J. Realff,et al.  Robust reverse production system design for carpet recycling , 2004 .

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

[4]  Ana Paula F. D. Barbosa-Póvoa,et al.  Planning and scheduling of industrial supply chains with reverse flows: A real pharmaceutical case study , 2008, Comput. Chem. Eng..

[5]  Surendra M. Gupta,et al.  Operations Planning Issues in an Assembly/Disassembly Environment , 1994 .

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

[7]  Jacek Blazewicz,et al.  The job shop scheduling problem: Conventional and new solution techniques , 1996 .

[8]  C. Rajendran,et al.  Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem , 2003 .

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

[10]  Florin Gheorghe Filip,et al.  Evolutionary Programming in Disassembly Decision Making , 2008 .

[11]  James R. Jackson,et al.  An extension of Johnson's results on job IDT scheduling , 1956 .

[12]  Augusto Q. Novais,et al.  Simultaneous design and planning of supply chains with reverse flows: A generic modelling framework , 2010, Eur. J. Oper. Res..

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

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

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

[16]  Jerzy Kamburowski,et al.  A heuristic for minimizing the makespan in no-idle permutation flow shops , 2005, Comput. Ind. Eng..

[17]  B. J. Lageweg,et al.  Surrogate duality relaxation for job shop scheduling , 1983, Discret. Appl. Math..

[18]  Augusto Q. Novais,et al.  A strategic and tactical model for closed-loop supply chains , 2009, OR Spectr..

[19]  Surendra M. Gupta,et al.  Recovery of sensor embedded washing machines using a multi-kanban controlled disassembly line , 2011 .

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

[21]  Hung Da Wan,et al.  Disassembly planning and sequencing for end-of-life products with RFID enriched information , 2013 .

[22]  Seyed Jafar Sadjadi,et al.  Mixed binary integer programming formulations for the flow shop scheduling problems. A case study: ISD projects scheduling , 2007, Appl. Math. Comput..

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

[24]  Surendra M. Gupta,et al.  A path-relinking approach for a bi-criteria disassembly sequencing problem , 2008, Comput. Oper. Res..

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

[26]  Scott Turner,et al.  Comparison of heuristics for flow shop sequencing , 1987 .

[27]  David G. Dannenbring,et al.  An Evaluation of Flow Shop Sequencing Heuristics , 1977 .

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

[29]  Y. Sotskov,et al.  The complexity of shop-scheduling problems with two or three jobs , 1991 .

[30]  L. N. Van Wassenhove,et al.  Concurrent product and closed-loop supply chain design with an application to refrigerators , 2003 .

[31]  Susana Relvas,et al.  Design and planning of supply chains with integration of reverse logistics activities under demand uncertainty , 2013, Eur. J. Oper. Res..

[32]  Dong-Ho Lee,et al.  A branch and bound algorithm for disassembly scheduling with assembly product structure , 2009, J. Oper. Res. Soc..

[33]  Dong-Ho Lee,et al.  Disassembly scheduling: literature review and future research directions , 2007 .

[34]  Moshe Dror,et al.  Mathematical programming formulations for machine scheduling: A survey , 1991 .

[35]  Elif Akçali,et al.  Benders decomposition with alternative multiple cuts for a multi‐product closed‐loop supply chain network design model , 2007 .

[36]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[37]  Surendra M. Gupta,et al.  A balancing method and genetic algorithm for disassembly line balancing , 2007, Eur. J. Oper. Res..