Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.
Jatinder N. D. GuptaChristos KoulamasGeorge J. KyparisisChris N. PottsVitaly A. StrusevichPublished in: Ann. Oper. Res. (2004)
Keyphrases
- scheduling problem
- processing times
- scheduling decisions
- identical parallel machines
- flowshop
- identical machines
- release dates
- scheduling jobs
- parallel machines
- unrelated parallel machines
- single machine
- precedence constraints
- setup times
- release times
- precedence relations
- maximum lateness
- minimize total
- job scheduling
- optimal scheduling
- weighted tardiness
- job shop
- limited capacity
- wafer fabrication
- strongly np hard
- single machine scheduling problem
- np hard
- sequence dependent setup times
- job processing times
- resource consumption
- scheduling strategy
- open shop
- list scheduling
- scheduling algorithm
- computational grids
- tabu search
- completion times
- job shop scheduling problem
- job shop scheduling
- information systems
- scheduling policies
- deteriorating jobs
- competitive ratio
- preventive maintenance
- batch processing
- production scheduling
- round robin
- special case
- information technology