Production and transport logistics scheduling with two transport mode choices

This paper considers a new class of scheduling problems arising in logistics systems in which two different transportation modes are available at the stage of product delivery. The mode with the shorter transportation time charges a higher cost. Each job ordered by the customer is first processed in the manufacturing facility and then transported to the customer. There is a due date for each job to arrive to the customer. Our approach integrates the machine scheduling problem in the manufacturing stage with the transportation mode selection problem in the delivery stage to achieve the global maximum benefit. In addition to studying the NP-hard special case in which no tardy job is allowed, we consider in detail the problem when minimizing the sum of the total transportation cost and the total weighted tardiness cost is the objective. We provide a branch and bound algorithm with two different lower bounds. The effectiveness of the two lower bounds is discussed and compared. We also provide a mathematical model that is solvable by CPLEX. Computational results show that our branch and bound algorithm is more efficient than CPLEX. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005

[1]  Hamilton Emmons,et al.  One-Machine Sequencing to Minimize Certain Functions of Job Tardiness , 1969, Oper. Res..

[2]  Hirofumi Matsuo.  The Weighted Total Tardiness Problem with Fixed Shipping Times and Overtime Utilization , 1988, Oper. Res..

[3]  Chris N. Potts,et al.  Single Machine Tardiness Sequencing Heuristics , 1991 .

[4]  Jon Rigelsford,et al.  Scheduling Computer and Manufacturing Processes 2nd Edition , 2002 .

[5]  Toshihide Ibaraki,et al.  Automated Two-machine Flowshop Scheduling: A Solvable Case , 1991 .

[6]  Hirofumi Matsuo,et al.  A controlled search simulated annealing method for the single machine weighted tardiness problem , 1990 .

[7]  Chris N. Potts,et al.  Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem , 1998, INFORMS J. Comput..

[8]  Vitaly A. Strusevich,et al.  A Heuristic for the Two-machine Open-shop Scheduling Problem with Transportation Times , 1999, Discret. Appl. Math..

[9]  Chris N. Potts,et al.  An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem , 2002, INFORMS J. Comput..

[10]  Chris N. Potts,et al.  A survey of algorithms for the single machine total weighted tardiness scheduling problem , 1990, Discret. Appl. Math..

[11]  Michael A. Langston,et al.  Interstage Transportation Planning in the Deterministic Flow-Shop Environment , 1987, Oper. Res..

[12]  A. M. A. Hariri,et al.  Single machine scheduling with deadlines to minimize the weighted number of tardy jobs , 1994 .

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

[14]  Chris N. Potts,et al.  Scheduling with Fixed Delivery Dates , 2001, Oper. Res..

[15]  Chelliah Sriskandarajah,et al.  Design and operational issues in AGV-served manufacturing systems , 1998, Ann. Oper. Res..

[16]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[17]  D Rebaine,et al.  Two-machine open shop scheduling with special transportation times , 1999, J. Oper. Res. Soc..

[18]  Chris N. Potts,et al.  A Branch and Bound Algorithm for the Total Weighted Tardiness Problem , 1985, Oper. Res..

[19]  S. S. Panwalkar,et al.  Scheduling of a Two-machine Flowshop with Travel Time Between Machines , 1991 .

[20]  Timothy J. Lowe,et al.  Dominance and Decomposition Heuristics for Single Machine Scheduling , 1991, Oper. Res..

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