A metaheuristic algorithm for project selection and scheduling with due windows and limited inventory capacity

Purpose – The purpose of this paper is to provide an effective solution for a complex planning problem encountered in heavy industry. The problem entails selecting a set of projects to produce from a larger set of solicited projects and simultaneously scheduling their production to maximize profit. Each project has a due window inside of which, if accepted, it must be shipped. Additionally, there is a limited inventory buffer where lots produced early are stored. Because scheduling affects which projects may be selected and vice-versa, this is a particularly difficult combinatorial optimization problem. Design/methodology/approach – The authors develop an algorithm based on the Metaheuristic for Randomized Priority Search (Meta-RaPS) as well as a greedy heuristic and an integer programming (IP) model. The authors then perform computational experiments on a large set of benchmark problems over a wide range of characteristics to compare the performance of each method in terms of solution quality and time re...

[1]  Reinaldo J. Moraga,et al.  Meta-RaPS approach for the 0-1 Multidimensional Knapsack Problem , 2005, Comput. Ind. Eng..

[2]  Chengbin Chu,et al.  A survey of the state-of-the-art of common due date assignment and scheduling research , 2002, Eur. J. Oper. Res..

[3]  Samuel J. Raff,et al.  Routing and scheduling of vehicles and crews : The state of the art , 1983, Comput. Oper. Res..

[4]  Hideki Hashimoto,et al.  Recent progress of local search in handling the time window constraints of the vehicle routing problem , 2010, 4OR.

[5]  T. C. Edwin Cheng,et al.  Two-stage flowshop earliness and tardiness machine scheduling involving a common due window , 2004 .

[6]  T. C. Edwin Cheng,et al.  Optimal common due-date with limited completion time deviation , 1988, Comput. Oper. Res..

[7]  Martin Feldmann,et al.  On scheduling around large restrictive common due windows , 2005, Eur. J. Oper. Res..

[8]  Christos Koulamas.  Maximizing the weighted number of on-time jobs in single machine scheduling with time windows , 1997 .

[9]  Shu-Cherng Fang,et al.  Soft computing for multicustomer due-date bargaining , 1999, IEEE Trans. Syst. Man Cybern. Part C.

[10]  Linus Schrage,et al.  Formulation and structure of more complex/realistic routing and scheduling problems , 1981, Networks.

[11]  George Ioannou,et al.  The balanced cargo vehicle routing problem with time windows , 2010 .

[12]  Reinaldo J. Moraga,et al.  Meta-RaPS: a simple and effective approach for solving the traveling salesman problem , 2005 .

[13]  Gail W. DePuy,et al.  A simple and effective heuristic for the resource constrained project scheduling problem , 2001 .

[14]  Guohua Wan,et al.  Single machine bicriteria scheduling: A survey , 2003 .

[15]  Ghaith Rabadi,et al.  A MetaRaPS algorithm for spatial scheduling with release times , 2011 .

[16]  Shu-Cherng Fang,et al.  A fuzzy due-date bargainer for the make-to-order manufacturing systems , 1998, IEEE Trans. Syst. Man Cybern. Part C.

[17]  Gur Mosheiov,et al.  Scheduling with a common due-window: Polynomially solvable cases , 2010, Inf. Sci..

[18]  Gur Mosheiov.  A Due-Window Determination In Minmax Scheduling Problems , 2001 .

[19]  Stephen C. H. Leung,et al.  Vehicle routing problems with time windows and stochastic travel and service times: Models and algorithm , 2010 .

[20]  Ghaith Rabadi,et al.  Exact and approximate methods for parallel multiple-area spatial scheduling with release times , 2013, OR Spectr..

[21]  L. Bodin.  ROUTING AND SCHEDULING OF VEHICLES AND CREWS–THE STATE OF THE ART , 1983 .

[22]  T. C. Edwin Cheng,et al.  Optimal Scheduling of a Single-Supplier Single-Manufacturer Supply Chain With Common due Windows , 2010, IEEE Transactions on Automatic Control.

[23]  Shu Zhang,et al.  Crane scheduling in a shipbuilding environment , 2010 .

[24]  Adam Janiak,et al.  Soft due window assignment and scheduling of unit-time jobs on parallel machines , 2012, 4OR.

[25]  Daniel Oron,et al.  Due‐window assignment with unit processing‐time jobs , 2004 .

[26]  Ghaith Rabadi,et al.  Heuristics for the Unrelated Parallel Machine Scheduling Problem with Setup Times , 2006, J. Intell. Manuf..

[27]  Sigrid Knust,et al.  Tabu search and lower bounds for a combined production-transportation problem , 2013, Comput. Oper. Res..

[28]  Jean-Charles Billaut,et al.  A new dynamic programming formulation for scheduling independent tasks with common due date on parallel machines , 2010, Eur. J. Oper. Res..

[29]  Allan Borodin,et al.  Randomized priority algorithms , 2010, Theor. Comput. Sci..

[30]  Adam Janiak,et al.  Soft Due Window Assignment and Scheduling on Parallel Machines , 2007, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[31]  Chengbin Chu,et al.  Due date assignment and scheduling: Slk, TWK and other due date assignment models , 2002 .