Two-machine open shop scheduling with an availability constraint

Operations Research Letters

Volumn 29, Issue 2, 2001, Pages 65-77

  Breit, Joachim ^a   Schmidt, Günter ^b   Strusevich, Vitaly A ^c  

^a SAARLAND UNIVERSITY   (Germany)

^b CLAUSTHAL UNIVERSITY OF TECHNOLOGY   (Germany)

^c UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Availability constraints; Open shop scheduling; Worst case analysis

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONSTRAINT THEORY; MACHINE SHOP PRACTICE; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SCHEDULING;

OPEN SHOP SCHEDULING;

OPERATIONS RESEARCH;

EID: 0035451881     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(01)00079-7     Document Type: Article

References (17)

1. Two-machine flowshop scheduling with consecutive availability constraints
2. Preemptive scheduling of independent jobs with release and due dates times on open, flow and job shop
3. Open shop scheduling to minimize finish time
4. Optimal two- and three-stage production schedules with setup times included
5. Two-machine flow shops with limited machine availability
6. Sequencing and scheduling: Algorithms and complexity
7. On preemptive scheduling of unrelated parallel processors by linear programming
8. Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint
9. Two-machine flowshop scheduling with availability constraints
10. An NP-hard open shop scheduling problem with polynomial average time complexity
11. Machine scheduling with availability constraints
12. Scheduling with limited machine availability
13. Dual criteria preemptive open-shop problems with minimum makespan
14. Short shop schedules