Scheduling parallel machines with single vehicle delivery

We investigate the integrated production and distribution scheduling problem in a supply chain. The manufacturer’s production environment is modeled as a parallel machine system. A single capacitated vehicle is employed to deliver products in batches to multiple customers. The scheduling problem can also be viewed as either parallel machines with delivery considerations or a flexible flowshop. Different inventory holding costs, job sizes (volume or storage space required in the transportation unit), and job priorities are taken into account. Efficient mathematical modeling and near-optimal heuristic approaches are presented for minimizing total weighted completion time.

[1]  Zhi-Long Chen,et al.  Machine scheduling with transportation considerations , 2001 .

[2]  Guoqing Wang,et al.  Parallel machine scheduling with batch delivery costs , 2000 .

[3]  Chris N. Potts,et al.  Scheduling with batching: A review , 2000, Eur. J. Oper. Res..

[4]  Milind Dawande,et al.  Supply Chain Scheduling: Distribution Systems , 2006 .

[5]  Mohammad Mahdavi Mazdeh,et al.  A branch-and-bound algorithm for single-machine scheduling with batch delivery minimizing flow times and delivery costs , 2007, Eur. J. Oper. Res..

[6]  Yong Tan,et al.  Price and QoS competition in data communication services , 2008, Eur. J. Oper. Res..

[7]  E.L. Lawler,et al.  Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .

[8]  Lixin Tang,et al.  Flowshop scheduling problems with transportation or deterioration between the batching and single machines , 2009, Comput. Ind. Eng..

[9]  David L. Woodruff,et al.  Solving the medium newspaper production/distribution problem , 1999, Eur. J. Oper. Res..

[10]  Derya Eren Akyol,et al.  Minimizing Makespan on Identical Parallel Machines Using Neural Networks , 2006, ICONIP.

[11]  Zhi-Long Chen,et al.  Supply Chain Scheduling: Conflict and Cooperation in Assembly Systems , 2007, Oper. Res..

[12]  G. Nemhauser,et al.  Integer Programming , 2020 .

[13]  Tao Wang,et al.  An effective neighborhood search algorithm for scheduling a flow shop of batch processing machines , 2011, Comput. Ind. Eng..

[14]  Fariborz Jolai,et al.  Minimizing makespan on a three-machine flowshop batch scheduling problem with transportation using genetic algorithm , 2012, Appl. Soft Comput..

[15]  Reha Uzsoy,et al.  Scheduling batch processing machines with incompatible job families , 1995 .

[16]  Pyung-Hoi Koo,et al.  Scheduling a single batch processing machine with arbitrary job sizes and incompatible job families , 2005 .

[17]  Lixin Tang,et al.  A two-stage flow shop scheduling problem on a batching machine and a discrete machine with blocking and shared setup times , 2010, Comput. Oper. Res..

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

[19]  Chris N. Potts,et al.  Supply chain scheduling: Batching and delivery , 2003, Oper. Res..

[20]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[21]  Chung-Yee Lee,et al.  Logistics scheduling with batching and transportation , 2008, Eur. J. Oper. Res..

[22]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988 .

[23]  Gregory Dobson,et al.  The Batch Loading and Scheduling Problem , 2001, Oper. Res..

[24]  Edward G. Coffman,et al.  Scheduling independent tasks to reduce mean finishing time , 1974, CACM.

[25]  Joseph Y.-T. Leung,et al.  An ACO algorithm for makespan minimization in parallel batch machines with non-identical job sizes and incompatible job families , 2016, Appl. Soft Comput..

[26]  Zhiyi Tan,et al.  On the machine scheduling problem with job delivery coordination , 2007, Eur. J. Oper. Res..

[27]  George L. Vairaktarakis,et al.  Integrated Scheduling of Production and Distribution Operations , 2005, Manag. Sci..

[28]  H. Neil Geismar,et al.  Batch scheduling on parallel machines with dynamic job arrivals and incompatible job families , 2013 .

[29]  Xiangtong Qi.  A logistics scheduling model: Inventory cost reduction by batching , 2005 .

[30]  Rui Zhang,et al.  Supply chain scheduling at the manufacturer to minimize inventory holding and delivery costs , 2014 .

[31]  T. C. Edwin Cheng,et al.  Batch delivery scheduling with batch delivery cost on a single machine , 2007, Eur. J. Oper. Res..

[32]  H. Hoogeveen.  Multicriteria scheduling q , 2005 .

[33]  D. Simchi-Levi.  Designing And Managing The Supply Chain , 2007 .

[34]  Christos Koulamas,et al.  A note on weighted completion time minimization in a flexible flow shop , 2001, Oper. Res. Lett..

[35]  Chung-Yee Lee,et al.  Machine scheduling with job delivery coordination , 2004, Eur. J. Oper. Res..

[36]  Bahman Naderi,et al.  A Variable Neighborhood Search for Hybrid Flexible Flowshops with Setup Times Minimizing Total Completion Time , 2008 .

[37]  H. Neil Geismar,et al.  The Integrated Production and Transportation Scheduling Problem for a Product with a Short Lifespan , 2008, INFORMS J. Comput..

[38]  Chung-Lun Li,et al.  Machine scheduling with deliveries to multiple customer locations , 2005, Eur. J. Oper. Res..

[39]  Susanne Albers,et al.  The Complexity of One-Machine Batching Problems , 1993, Discret. Appl. Math..

[40]  Chris N. Potts,et al.  The Coordination of Scheduling and Batch Deliveries , 2005, Ann. Oper. Res..

[41]  Marc E. Posner,et al.  Performance Prediction and Preselection for Optimization and Heuristic Solution Procedures , 2007, Oper. Res..

[42]  Meral Azizoglu,et al.  Scheduling a batch processing machine with incompatible job families , 2001 .