Two-machine shop scheduling: Compromise between flexibility and makespan value.
Carl EssweinJean-Charles BillautVitaly A. StrusevichPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- batch processing
- scheduling problem
- flowshop
- unrelated parallel machines
- scheduling jobs
- parallel machines
- setup times
- processing times
- strongly np hard
- single machine
- sequence dependent setup times
- maximum lateness
- minimizing makespan
- job processing times
- job shop
- permutation flowshop
- parallel machine scheduling problem
- manufacturing cell
- bicriteria
- identical machines
- completion times
- preventive maintenance
- production system
- identical parallel machines
- batch processing machines
- release dates
- precedence constraints
- job shop scheduling problem
- trade off
- job shop scheduling
- open shop
- np hard
- wafer fabrication
- deteriorating jobs
- database systems