Order acceptance and scheduling problems in two-machine flow shops: New mixed integer programming formulations

We present two new mixed integer programming formulations for the order acceptance and scheduling problem in two machine flow shops. Solving this optimization problem is challenging because two types of decisions must be made simultaneously: which orders to be accepted for processing and how to schedule them. To speed up the solution procedure, we present several techniques such as preprocessing and valid inequalities. An extensive computational study, using different instances, demonstrates the efficacy of the new formulations in comparison to some previous ones found in the relevant literature.

[1]  Susan A. Slotnick,et al.  Order acceptance with weighted tardiness , 2007, Comput. Oper. Res..

[2]  F. Sibel Salman,et al.  Order acceptance and scheduling decisions in make-to-order systems , 2010 .

[3]  Adam N. Letchford,et al.  Separation algorithms for 0-1 knapsack polytopes , 2010, Math. Program..

[4]  Pasquale Avella,et al.  Computational Testing of a Separation Procedure for the Knapsack Set with a Single Continuous Variable , 2012, INFORMS J. Comput..

[5]  Thomas E. Morton,et al.  Selecting jobs for a heavily loaded shop with lateness penalties , 1996, Comput. Oper. Res..

[6]  George L. Nemhauser,et al.  A Cutting Plane Algorithm for the Single Machine Scheduling Problem with Release Times , 1992 .

[7]  Jay B. Ghosh,et al.  Job selection in a heavily loaded shop , 1997, Comput. Oper. Res..

[8]  Walter O. Rom,et al.  Order acceptance using genetic algorithms , 2009, Comput. Oper. Res..

[9]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[10]  Shih-Wei Lin,et al.  Order acceptance and scheduling to maximize total net revenue in permutation flowshops with weighted tardiness , 2015, Appl. Soft Comput..

[11]  Abdullah Konak,et al.  Non-permutation flow shop scheduling with order acceptance and weighted tardiness , 2015, Appl. Math. Comput..

[12]  Shih-Wei Lin,et al.  Increasing the total net revenue for single machine order acceptance and scheduling problems using an artificial bee colony algorithm , 2013, J. Oper. Res. Soc..

[13]  T.C.E. Cheng,et al.  Order acceptance and scheduling in a two-machine flowshop , 2013 .

[14]  Susan A. Slotnick,et al.  Order acceptance and scheduling: A taxonomy and review , 2011, Eur. J. Oper. Res..

[15]  Martin W. P. Savelsbergh,et al.  Integer-Programming Software Systems , 2005, Ann. Oper. Res..

[16]  François Margot,et al.  Symmetry in Integer Linear Programming , 2010, 50 Years of Integer Programming.

[17]  T.C.E. Cheng,et al.  A modified artificial bee colony algorithm for order acceptance in two-machine flow shops , 2013 .

[18]  Fabrice Talla Nobibon,et al.  Exact algorithms for a generalization of the order acceptance and scheduling problem in a single-machine environment , 2011, Comput. Oper. Res..

[19]  Ghasem Moslehi,et al.  A hybrid genetic and linear programming algorithm for two-agent order acceptance and scheduling problem , 2015, Appl. Soft Comput..

[20]  Martin E. Dyer,et al.  Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..

[21]  Deming Lei,et al.  A parallel neighborhood search for order acceptance and scheduling in flow shop environment , 2015 .

[22]  Fabián A. Chudak,et al.  A half-integral linear programming relaxation for scheduling precedence-constrained jobs on a single machine , 1999, Oper. Res. Lett..

[23]  Yeong-Dae Kim,et al.  A new branch and bound algorithm for minimizing mean tardiness in two-machine flowshops , 1993, Comput. Oper. Res..

[24]  Hanif D. Sherali,et al.  Improving Discrete Model Representations via Symmetry Considerations , 2001, Manag. Sci..

[25]  Ceyda Oguz,et al.  A tabu search algorithm for order acceptance and scheduling , 2012, Comput. Oper. Res..

[26]  Martin W. P. Savelsbergh,et al.  Time-Indexed Formulations for Machine Scheduling Problems: Column Generation , 2000, INFORMS J. Comput..

[27]  Scott J. Mason,et al.  Evaluation of mixed integer programming formulations for non-preemptive parallel machine scheduling problems , 2010, Comput. Ind. Eng..