On the representation of the one machine sequencing problem in the shifting bottleneck heuristic

European Journal of Operational Research

Volumn 182, Issue 1, 2007, Pages 475-479

  Mukherjee, Saral ^a,b   Chatterjee, A K ^a,b  

^a INDIAN INSTITUTE OF MANAGEMENT   (India)

^b INDIAN INSTITUTE OF MANAGEMENT CALCUTTA   (India)

Author keywords

Due window; Generalized lateness objective; Scheduling; Shifting bottleneck heuristic; Single machine

Indexed keywords

CONSTRAINT THEORY; DATA ACQUISITION; HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; SCHEDULING;

GENERALIZED LATENESS OBJECTIVES; ONE MACHINE SEQUENCING PROBLEMS (OMSP); SHIFTING BOTTLENECKS;

SEQUENTIAL MACHINES;

EID: 34147212877     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.07.024     Document Type: Article

References (7)

1. Adams J., Balas E., and Zawack D. The shifting bottleneck procedure for Job Shop Scheduling. Management Science 34 (1988) 391-401
2. Balas E., Lenstra J.K., and Vazacopoulos A. The one machine sequencing problem with delayed precedence constraints and its use in Job Shop Scheduling. Management Science 41 (1995) 94-109
3. Balas E., and Vazacopoulos A. Guided local search with shifting bottleneck for Job Shop Scheduling. Management Science 44 (1998) 262-275
4. Carlier J. The one machine sequencing problem. European Journal of Operational Research 11 (1982) 42-47
5. Dauzere-Peres S., and Lasserre J.B. A modified shifting bottleneck procedure for job-shop scheduling. International Journal of Production Research 31 (1993) 923-932
6. Liman S.D., Panwalkar S.S., and Thongmee S. Common due window size and location determination in a single machine scheduling problem. Journal of the Operational Research Society 49 (1998) 1007-1010
7. Yeung W.K., Oguz C., and Edwin Cheng T.C. Single-machine scheduling with a common due window. Computers and Operations Research 28 (2001) 157-175