Optimal makespan schedule for three jobs on two machines.
Svetlana A. KravchenkoYuri N. SotskovPublished in: Math. Methods Oper. Res. (1996)
Keyphrases
- scheduling problem
- flowshop
- strongly np hard
- processing times
- open shop
- identical parallel machines
- parallel machines
- parallel machine scheduling problem
- identical machines
- permutation flowshop
- single machine
- optimal scheduling
- setup times
- asymptotic optimality
- release dates
- minimizing makespan
- precedence constraints
- np hard
- sequence dependent setup times
- scheduling jobs
- single machine scheduling problem
- maximum lateness
- total weighted tardiness
- unrelated parallel machines
- deteriorating jobs
- optimal solution
- competitive ratio
- scheduling decisions
- tabu search
- lower bound
- job shop
- batch processing
- bicriteria
- job shop scheduling problem
- approximation algorithms
- job processing times
- dispatching rule
- asymptotically optimal
- search algorithm
- objective function