Scheduling chains on a single machine with non-negative time lags

Mathematical Methods of Operations Research

Volumn 57, Issue 1, 2003, Pages 111-123

  Munier, Alix ^a   Sourd, Francis ^a  

^a UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

Author keywords

Complexity; Deterministic scheduling; Single machine problems; Time lags

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; DYNAMIC PROGRAMMING; GRAPH THEORY; MACHINE COMPONENTS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING;

COMPLEXITY; DETERMINISTIC SCHEDULING; SINGLE MACHINE PROBLEMS; TIME-LAGS;

OPERATIONS RESEARCH;

EID: 21244487153     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860200242     Document Type: Article

References (8)

1. Brucker P (1998) Scheduling algorithms. Springer-Verlag, Berlin, Germany
2. Brucker P, Drexl A, Möhring R, Neumann K, Pesch E (1999) Resource-constrained project scheduling: Notation, classification, models and methods. European Journal of Operational Research 112:3-41
3. Brucker P, Knust S. Complexity results for scheduling problems. Web page http://www.mathematik.uni-osnabrueck.de/research/OR/class/
4. Brucker P, Knust S (1999) Complexity results for single-machine problems with positive finish-start time-lags. Computing 63:299-316
5. Bruno JL, Jones JW, So K (1980) Deterministic scheduling with pipelined processors. IEEE Transaction on Computers C-29:308-316
6. Finta L, Liu Z (1996) Single machine scheduling subject to precedence delays. Discrete Applied Mathematics 70:247-266
7. Graham RE, Lawler EL, Lenstra JK, Rinnooy Kan AHG (1979) Optimization and approximation in deterministic sequencing and scheduling. Annals of Discrete Mathematics 4:287-326
8. McNaughton R (1959) Scheduling with deadlines and loss functions. Management Science 6:1-12