Terminal penalty rolling scheduling based on an initial schedule for single-machine scheduling problem

Computers and Operations Research

Volumn 32, Issue 11, 2005, Pages 3059-3072

  Wang, Bing ^a,b   Xi, Yugeng ^a   Gu, Hanyu ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

^b SHANDONG UNIVERSITY   (China)

Author keywords

Initial schedule; Local scheduling; Rolling horizon procedures; Terminal penalty

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COSTS; POLYNOMIALS; PROBLEM SOLVING;

INITIAL SCHEDULE; LOCAL SCHEDULING; ROLLING HORIZON PROCEDURES; TERMINAL PENALTY;

SCHEDULING;

EID: 13844266916     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2004.11.004     Document Type: Article

References (12)

1. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB. Sequencing and scheduling: algorithm and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin P, editors. Handbooks in operations research and management science, vol. 4. Logistics of production and inventory, Amsterdam: North-Holland; 1993. p. 445-522.
2. M.I. Dessouky, and J.S. Deogun Sequencing jobs with unequal ready times to minimize mean flow time SIAM Journal on Computing 10 1 1981 192 202
3. A.M.A. Hariri, and C.N. Potts An algorithm for single machine sequencing with release dates to minimize total weighted completion time Discrete Applied Mathematics 5 1983 99 109
4. Chengbin Chu A branch-and-bound algorithm to minimize total flow time with unequal release dates Naval Research Logistics 39 1992 859 875
5. R. Chandra On n / 1 / F̄ dynamic deterministic problems Naval Research Logistics Quarterly 26 1979 537 544
6. Chengbin Chu Efficient heuristics to minimize total flow time with release dates Operations Research Letters 12 1992 321 330
7. C. Suresh, T. Rodney, and U. Reha An iterative heuristic for the single machine dynamic total completion time scheduling problem Computers & Operations Research 23 7 1996 641 651
8. C. Suresh, T. Rodney, and U. Reha Single-machine scheduling with dynamic arrivals decomposition results and an improved algorithm Naval Research Logistics 43 1996 709 719
9. C. Suresh, T. Rodney, and U. Reha Rolling horizon procedures for the single machine deterministic total completion time scheduling problem with release dates Annals of Operations Research 70 1997 115 125
10. I.M. Ovacik, and R. Uzsoy Rolling horizon algorithms for a single-machine dynamic scheduling problem with sequence-dependent setup times International Journal of Production Research 32 6 1994 1243 1263
11. Fang Jian, and Xi Yugeng Rolling horizon job shop rescheduling strategy in the dynamic environment International Journal of Advanced Manufacturing Technology 13 1997 227 232
12. M. Posner The deadline constrained weighted completion time problem analysis of a heuristic. Operations Research 36 1988 742 746