Minimizing the makespan in a two-machine cross-docking flow shop problem

This paper studies a two-machine cross-docking flow shop scheduling problem in which a job at the second machine can be processed only after the processing of some jobs at the first machine has been completed. The objective is to minimize the makespan. We first show that the problem is strongly NP-hard. Some polynomially solvable special cases are provided. We then develop a polynomial approximation algorithm with an error-bound analysis. A branch-and-bound algorithm is also constructed. Computational results show that the branch-and-bound algorithm can optimally solve problems with up to 60 jobs within a reasonable amount of time.

[1]  Graham K. Rand,et al.  Logistics of Production and Inventory , 1995 .

[2]  Clyde L. Monma,et al.  Sequencing with Series-Parallel Precedence Constraints , 1979, Math. Oper. Res..

[3]  John L. Bruno,et al.  Deterministic Scheduling with Pipelined Processors , 1980, IEEE Transactions on Computers.

[4]  Chung-Yee Lee,et al.  Machine scheduling with an availability constraint , 1996, J. Glob. Optim..

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Ken E Peck.  Operational analysis of freight terminals handling less than container load shipments , 1983 .

[7]  Jeffrey B. Sidney,et al.  The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relations , 1979, Oper. Res..

[8]  Louis Y. Tsui,et al.  A microcomputer based decision support tool for assigning dock doors in freight yards , 1990 .

[9]  Clyde L. Monma.  The Two-Machine Maximum Flow Time Problem with Series-Parallel Precedence Constraints: An Algorithm and Extensions , 1979, Oper. Res..

[10]  Eugene L. Lawler,et al.  Sequencing and scheduling: algorithms and complexity , 1989 .

[11]  T. Ibaraki.  Enumerative approaches to combinatorial optimization - part I , 1988 .

[12]  John J. Bartholdi,et al.  The Best Shape for a Crossdock , 2004, Transp. Sci..

[13]  Philip M. Kaminsky,et al.  Designing and managing the supply chain : concepts, strategies, and case studies , 2007 .

[14]  Vitaly A. Strusevich,et al.  Flow Shop Scheduling Problems Under Machine–Dependent Precedence Constraints , 2004, J. Comb. Optim..

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

[16]  Kevin R. Gue,et al.  The Effects of Trailer Scheduling on the Layout of Freight Terminals , 1999, Transp. Sci..

[17]  Clyde L. Monma,et al.  Sequencing to Minimize the Maximum Job Cost , 1980, Oper. Res..

[18]  John J. Bartholdi,et al.  Reducing Labor Costs in an LTL Crossdocking Terminal , 2000, Oper. Res..

[19]  Louis Y. Tsui,et al.  An optimal solution to a dock door assignment problem , 1992 .