论文信息 - On-line scheduling with non-crossing constraints

On-line scheduling with non-crossing constraints

We consider the problem of on-line scheduling with non-crossing constraints. The objective is to minimize the latest completion time. We provide optimal competitive ratio heuristics for the on-line list and on-line time problems with unit processing times, and a 3-competitive heuristic for the general on-line time problem.

[1] Andrew Lim,et al. Approximation Schemes for the Crane Scheduling Problem , 2004, SWAT.

[2] Y. Zhu,et al. Carrier assignment models in transportation procurement , 2006, J. Oper. Res. Soc..

[3] Stefan Voß,et al. Container terminal operation and operations research - a classification and literature review , 2004, OR Spectr..

[4] Jacques Carlier,et al. Handbook of Scheduling - Algorithms, Models, and Performance Analysis , 2004 .

[5] I. B. Turksen,et al. Two-Operation Crane Scheduling Problems , 1982 .

[6] Carlos F. Daganzo,et al. THE CRANE SCHEDULING PROBLEM , 1989 .

[7] Y. Zhu,et al. Crane scheduling with non-crossing constraint , 2006, J. Oper. Res. Soc..

[8] I. B. Turksen,et al. Crane Scheduling Problems , 1981 .

[9] Andrew Lim,et al. A m‐parallel crane scheduling problem with a non‐crossing constraint , 2007 .

[10] Yi Zhu,et al. Crane scheduling with spatial constraints , 2004 .

[11] Yi Zhu,et al. Crane scheduling using tabu search , 2002, 14th IEEE International Conference on Tools with Artificial Intelligence, 2002. (ICTAI 2002). Proceedings..

[12] Joseph Y.-T. Leung,et al. Handbook of Scheduling: Algorithms, Models, and Performance Analysis , 2004 .

[13] Bo Chen,et al. Scheduling on identical machines: How good is LPT in an on-line setting? , 1997, Oper. Res. Lett..