Scheduling identical jobs with chain precedence constraints on two uniform machines

Mathematical Methods of Operations Research

Volumn 49, Issue 2, 1999, Pages 211-219

  Brucker, Peter ^a   Hurink, Johann ^b   Kubiak, Wieslaw ^c  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

^b UNIVERSITY OF TWENTE   (Netherlands)

^c MEMORIAL UNIVERSITY OF NEWFOUNDLAND   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; PROBLEM SOLVING; PROCESS CONTROL; SCHEDULING;

CHAIN PRECEDENCE CONSTRAINTS; IDENTICAL JOBS;

PRODUCTION CONTROL;

EID: 0032637355     PISSN: 14322994     EISSN: None     Source Type: Journal    
DOI: 10.1007/s001860050045     Document Type: Article

References (4)

1. Gabow HN (1982) An almost-linear algorithm for two-processor scheduling. Journal Assoc. Comput. Mach. 29:766-780
2. Kubiak W (1989) Optimal schedules of unit-time tasks on two uniform processors under tree-like precedence constraints. ZOR 33:423-437
3. Lawler EL (1982) Preemptive scheduling of precedence-constrained jobs on parallel machines. In: Dempster MAH, Lenstra JK, Rinnooy Kan AHG (Eds.) Deterministic and stochastic scheduling, Reidel, Dordrecht
4. Lawler EL, Lenstra JK, Rinnooy Kan AHG, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. In: Graves SC, Rinnooy Kan AHG, Zipkin P (Eds.) Handbook in operations research and management science, Volume 4: Logistics of production and inventory, North-Holland, pp. 445-522