Two-machine flowshop scheduling with flexible operations and controllable processing times

We consider a two-machine flowshop scheduling problem with identical jobs. Each of these jobs has three operations, where the first operation must be performed on the first machine, the second operation must be performed on the second machine, and the third operation (named as flexible operation) can be performed on either machine but cannot be preempted. Highly flexible CNC machines are capable of performing different operations. Furthermore, the processing times on these machines can be changed easily in albeit of higher manufacturing cost by adjusting the machining parameters like the speed and/or feed rate of the machine. The overall problem is to determine the assignment of the flexible operations to the machines and processing times for each operation to minimize the total manufacturing cost and makespan simultaneously. For such a bicriteria problem, there is no unique optimum but a set of nondominated solutions. Using @e-constraint approach, the problem could be transformed to be minimizing total manufacturing cost for a given upper limit on the makespan. The resulting single criterion problem can be reformulated as a mixed integer nonlinear problem with a set of linear constraints. We use this formulation to optimally solve small instances of the problem while a heuristic procedure is constructed to solve larger instances in a reasonable time.

[1]  J. D. Wiest,et al.  A management guide to PERT/CPM: With GERT/PDM/DCPM and other networks , 1977 .

[2]  Jen-Shiang Chen,et al.  Minimizing tardiness in a two-machine flow-shop , 2002, Comput. Oper. Res..

[3]  Uday S. Karmarkar,et al.  Simultaneous Resource Scheduling to Minimize Weighted Flow Times , 1989, Oper. Res..

[4]  Erhan Kozan,et al.  Sequencing and scheduling in flowshops with task redistribution , 2001, J. Oper. Res. Soc..

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

[6]  Dvir Shabtay,et al.  Complexity analysis of an assignment problem with controllable assignment costs and its applications in scheduling , 2011, Discret. Appl. Math..

[7]  E. Muth.  The Reversibility Property of Production Lines , 1979 .

[8]  José Humberto Ablanedo-Rosas,et al.  Minimizing the number of tardy jobs in the flowshop problem with operation and resource flexibility , 2010, Comput. Oper. Res..

[9]  Monaldo Mastrolilli.  Notes on Max Flow Time Minimization with Controllable Processing Times , 2003, Computing.

[10]  Jean-Charles Billaut,et al.  Multicriteria Scheduling - Theory, Models and Algorithms (2. ed.) , 2006 .

[11]  Oya Ekin Karasan,et al.  Cyclic scheduling of a 2-machine robotic cell with tooling constraints , 2006, Eur. J. Oper. Res..

[12]  M. Selim Akturk,et al.  Single CNC machine scheduling with controllable processing times to minimize total weighted tardiness , 2011, Comput. Oper. Res..

[13]  T.C.E. Cheng,et al.  Due-date assignment and single machine scheduling with compressible processing times , 1996 .

[14]  Yves Crama,et al.  Cyclic scheduling in robotic flowshops , 2000, Ann. Oper. Res..

[15]  Panagiotis Kouvelis,et al.  Flow-line scheduling problems with controllable processing times , 1997 .

[16]  R. Słowiński.  Multiobjective network scheduling with efficient use of renewable and nonrenewable resources , 1981 .

[17]  William P. Darrow,et al.  The two-machine sequence dependent flowshop scheduling problem , 1986 .

[18]  Ji-Bo Wang,et al.  Single machine scheduling problems with controllable processing times and total absolute differences penalties , 2005, Eur. J. Oper. Res..

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

[20]  Sujit K. Dutta,et al.  Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage , 1975 .

[21]  G. Steiner,et al.  The no-wait two-machine flow shop scheduling problem with convex resource-dependent processing times , 2007 .

[22]  Han Hoogeveen,et al.  Some Comments on Sequencing with Controllable Processing Times , 2002, Computing.

[23]  Wai Keung Wong,et al.  Intelligent production control decision support system for flexible assembly lines , 2009, Expert Syst. Appl..

[24]  Stanisław Zdrzałka,et al.  A two-machine flow shop scheduling problem with controllable job processing times , 1988 .

[25]  Czesław Smutnicki,et al.  A two-machine permutation flow shop scheduling problem with buffers , 1998 .

[26]  S. S. Panwalkar,et al.  Single-machine sequencing with controllable processing times , 1992 .

[27]  Dvir Shabtay,et al.  Just-in-time scheduling with controllable processing times on parallel machines , 2010, J. Comb. Optim..

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

[29]  Nicolas Monmarché,et al.  An Ant Colony Optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem , 2002, Eur. J. Oper. Res..

[30]  Subhash C. Sarin,et al.  Scheduling heuristic for the n-jobm-machine flow shop , 1993 .

[31]  Klaus Jansen,et al.  Parallel Machine Scheduling Problems with Controllable Processing Times , 2000, ICALP Satellite Workshops.

[32]  F. D. Croce,et al.  The two-machine total completion time flow shop problem , 1996 .

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

[34]  Saul I. Gass,et al.  Erratum to "Cycling in linear programming problems" [Computers and Operations Research 31 (2002) 303-311] , 2006, Comput. Oper. Res..

[35]  Wieslaw Kubiak,et al.  Heuristic algorithms for the two-machine flowshop with limited machine availability ☆ , 2001 .

[36]  Kathryn E. Stecke,et al.  Formulation and Solution of Nonlinear Integer Production Planning Problems for Flexible Manufacturing Systems , 1983 .

[37]  Sinan Gürel,et al.  An anticipative scheduling approach with controllable processing times , 2010, Comput. Oper. Res..

[38]  Richard L. Daniels,et al.  A multi-objective approach to resource allocation in single machine scheduling , 1990 .

[39]  Roman Słowiński,et al.  Solving the general project scheduling problem with multiple constrained resources by mathematical programming , 1978 .

[40]  Yves Crama,et al.  Throughput optimization in two-machine flowshops with flexible operations , 2010, J. Sched..

[41]  Samir Lamouri,et al.  Simultaneously scheduling n jobs and the preventive maintenance on the two-machine flow shop to minimize the makespan , 2008 .

[42]  Jean-Charles Billaut,et al.  Multicriteria scheduling , 2005, Eur. J. Oper. Res..

[43]  Oya Ekin Karasan,et al.  Robotic cell scheduling with operational flexibility , 2005, Discret. Appl. Math..

[44]  Manbir S. Sodhi,et al.  Using tool life models to minimize processing time on a flexible machine , 1997 .

[45]  Ji-Bo Wang,et al.  Single-machine scheduling to minimize total convex resource consumption with a constraint on total weighted flow time , 2012, Comput. Oper. Res..

[46]  Michael A. Trick,et al.  Scheduling Multiple Variable-Speed Machines , 1990, Oper. Res..

[47]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[48]  Oya Ekin Karasan,et al.  Bicriteria robotic operation allocation in a flexible manufacturing cell , 2010, Comput. Oper. Res..

[49]  Alessandro Agnetis,et al.  Tool addition strategies for flexible manufacturing systems , 1994 .

[50]  人見 勝人,et al.  Manufacturing systems engineering : a unified approach to manufacturing technology and production management , 1979 .

[51]  Chung-Yee Lee.  Two-machine flowshop scheduling with availability constraints , 1999, Eur. J. Oper. Res..

[52]  Sinan Gürel,et al.  Optimal allocation and processing time decisions on non-identical parallel CNC machines: epsilon-constraint approach , 2007, Eur. J. Oper. Res..

[53]  Thomas E. Morton,et al.  Resource-constrained multi-project scheduling with tardy costs: Comparing myopic, bottleneck, and resource pricing heuristics , 1993 .

[54]  T. C. Edwin Cheng,et al.  Single machine scheduling with a variable common due date and resource-dependent processing times , 2003, Comput. Oper. Res..

[55]  Joseph B. Mazzola,et al.  Flow Shop Scheduling with Resource Flexibility , 1994, Oper. Res..

[56]  Ling Wang,et al.  An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers , 2008, Comput. Oper. Res..

[57]  Rakesh K. Sarin,et al.  Technical Note - Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy , 1989, Oper. Res..

[58]  Joseph Y.-T. Leung,et al.  Scheduling two agents with controllable processing times , 2010, Eur. J. Oper. Res..

[59]  K. R. Baker,et al.  A bicriterion approach to time/cost trade-offs in sequencing , 1982 .

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

[61]  Oya Ekin Karasan,et al.  Bicriteria robotic cell scheduling , 2008, J. Sched..

[62]  Wojciech Cellary,et al.  Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H] , 1977, TOMS.

[63]  Manbir S. Sodhi,et al.  Heuristics for determining economic processing rates in a flexible manufacturing system , 2001, Eur. J. Oper. Res..

[64]  Chelliah Sriskandarajah,et al.  A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process , 1996, Oper. Res..

[65]  Chris N. Potts,et al.  Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan , 2004, Ann. Oper. Res..

[66]  Kenneth Steiglitz,et al.  Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n/2/F/ F , 1975, JACM.

[67]  Wing-Keung Wong,et al.  A genetic-algorithm-based optimization model for scheduling flexible assembly lines , 2008 .

[68]  T. C. Edwin Cheng,et al.  An improved heuristic for two-machine flowshop scheduling with an availability constraint , 2000, Oper. Res. Lett..

[69]  Dvir Shabtay,et al.  A bicriteria approach to maximize the weighted number of just-in-time jobs and to minimize the total resource consumption cost in a two-machine flow-shop scheduling system , 2012 .

[70]  M. Selim Akturk,et al.  A new bounding mechanism for the CNC machine scheduling problems with controllable processing times , 2005, Eur. J. Oper. Res..

[71]  Raymond G. Vickson,et al.  Two Single Machine Sequencing Problems Involving Controllable Job Processing Times , 1980 .

[72]  Jatinder N. D. Gupta,et al.  The two-machine flowshop scheduling problem with total tardiness , 1989, Comput. Oper. Res..

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

[74]  Adam Janiak.  Minimization of the makespan in a two-machine problem under given resource constraints , 1998, Eur. J. Oper. Res..

[75]  D. M. Deighton,et al.  Computers in Operations Research , 1977, Aust. Comput. J..

[76]  Stanislaw Zdrzalka.  Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis , 1991, Oper. Res. Lett..

[77]  Nils Boysen,et al.  A classification of assembly line balancing problems , 2007, Eur. J. Oper. Res..

[78]  Liang Zhang,et al.  An effective hybrid genetic algorithm for flow shop scheduling with limited buffers , 2006, Comput. Oper. Res..

[79]  Dailun Shi,et al.  Flow Shop Scheduling with Partial Resource Flexibility , 2004, Manag. Sci..

[80]  Dvir Shabtay,et al.  A survey of scheduling with controllable processing times , 2007, Discret. Appl. Math..

[81]  Chris N. Potts,et al.  Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops , 2001, INFORMS J. Comput..

[82]  Michael Patriksson,et al.  A survey on the continuous nonlinear resource allocation problem , 2008, Eur. J. Oper. Res..

[83]  Chandrasekharan Rajendran,et al.  A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan , 1994 .

[84]  Peter Brucker,et al.  Flow-shop problems with intermediate buffers , 2003, OR Spectr..

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

[86]  T. C. Edwin Cheng,et al.  A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs , 2010, Comput. Oper. Res..

[87]  J. D. Wiest,et al.  Management Guide to PERT/CPM , 1969 .