Logistics scheduling: Analysis of two-stage problems

This paper studies the coordination effects between stages for scheduling problems where decision-making is a two-stage process. Two stages are considered as one system. The system can be a supply chain that links two stages, one stage representing a manufacturer; and the other, a distributor. It also can represent a single manufacturer, while each stage represents a different department responsible for a part of operations. A problem that jointly considers both stages in order to achieve ideal overall system performance is defined as a system problem. In practice, at times, it might not be feasible for the two stages to make coordinated decisions due to (i) the lack of channels that allow decision makers at the two stages to cooperate, and/or (ii) the optimal solution to the system problem is too difficult (or costly) to achieve.Two practical approaches are applied to solve a variant of two-stage logistic scheduling problems. The Forward Approach is defined as a solution procedure by which the first stage of the system problem is solved first, followed by the second stage. Similarly, the Backward Approach is defined as a solution procedure by which the second stage of the system problem is solved prior to solving the first stage. In each approach, two stages are solved sequentially and the solution generated is treated as a heuristic solution with respect to the corresponding system problem. When decision makers at two stages make decisions locally without considering consequences to the entire system, ineffectiveness may result — even when each stage optimally solves its own problem. The trade-off between the time complexity and the solution quality is the main concern. This paper provides the worst-case performance analysis for each approach.

[1]  S. L. Velde Minimizing the sum of the job completion times in the two-machine flow shop by Lagrangian relaxation , 1991 .

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

[3]  Chris N. Potts,et al.  Integrating Scheduling with Batching and Lot-Sizing: A Review of Algorithms and Complexity , 1992 .

[4]  Chung Yee Lee,et al.  On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date , 1993 .

[5]  Sigrid Knust,et al.  Makespan minimization for flow-shop problems with transportation times and a single robot , 2001, Discret. Appl. Math..

[6]  Wayne E. Smith Various optimizers for single‐stage production , 1956 .

[7]  Jinjiang Yuan A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs , 1996 .

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

[9]  Teofilo F. Gonzalez,et al.  Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..

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

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

[12]  E. Ignall,et al.  Application of the Branch and Bound Technique to Some Flow-Shop Scheduling Problems , 1965 .

[13]  Douglas J. Thomas,et al.  Coordinated supply chain management , 1996 .

[14]  T. C. Edwin Cheng,et al.  Single machine scheduling with batch deliveries , 1996 .

[15]  Rakesh Nagi,et al.  A review of integrated analysis of production-distribution systems , 1999 .

[16]  Kenneth R. Baker,et al.  Scheduling Groups of Jobs on a Single Machine , 1995, Oper. Res..

[17]  Han Hoogeveen,et al.  Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases , 1999, Math. Oper. Res..

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

[19]  Xiaoguang Yang Scheduling with generalized batch delivery dates and earliness penalties , 2000 .

[20]  Linus Schrage,et al.  Letter to the Editor - A Proof of the Optimality of the Shortest Remaining Processing Time Discipline , 1968, Oper. Res..

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

[22]  Han Hoogeveen,et al.  Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases , 1996, Math. Oper. Res..

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

[24]  Zhi-Long Chen,et al.  Scheduling and common due date assignment with earliness-tardiness penalties and batch delivery costs , 1996 .

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

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

[27]  Reza H. Ahmadi,et al.  Batching and Scheduling Jobs on Batch and Discrete Processors , 1992, Oper. Res..

[28]  William L. Maxwell,et al.  Theory of scheduling , 1967 .