A new lower bound for flow shop makespan with release dates
暂无分享,去创建一个
Lixin Tang | Danyu Bai | Manchen Huo | Lixin Tang | D. Bai | Manchen Huo
[1] Leslie A. Hall. Approximability of flow shop scheduling , 1998, Math. Program..
[2] Lixin Tang,et al. Worst Case Analysis of a New Lower Bound for Flow Shop Weighted Completion Time Problem , 2007, COCOA.
[3] P. Glynn,et al. Departures from Many Queues in Series , 1991 .
[4] Leslie A. Hall,et al. A Polynomial Approximation Scheme for a Constrained Flow-Shop Scheduling Problem , 1994, Math. Oper. Res..
[5] J. George Shanthikumar,et al. On the Asymptotic Optimality of the SPT Rule for the Flow Shop Average Completion Time Problem , 2000, Oper. Res..
[6] Ravi Sethi,et al. The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..
[7] Teofilo F. Gonzalez,et al. Flowshop and Jobshop Schedules: Complexity and Approximation , 1978, Oper. Res..
[8] S. M. Johnson,et al. Optimal two- and three-stage production schedules with setup times included , 1954 .
[9] Jan Karel Lenstra,et al. Complexity of machine scheduling problems , 1975 .
[10] Gideon Weiss,et al. A Probabilistic Analysis of Two-Machine Flowshops , 1996, Oper. Res..
[11] David Simchi-Levi,et al. On the asymptotic optimality of algorithms for the flow shop problem with release dates , 2005 .
[12] C. N. Potts. Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates , 1985, Math. Oper. Res..
[13] E.L. Lawler,et al. Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey , 1977 .
[14] Chris N. Potts,et al. A New Heuristic for Three-Machine Flow Shop Scheduling , 1996, Oper. Res..
[15] Michael Pinedo,et al. Scheduling: Theory, Algorithms, and Systems , 1994 .