A heuristic algorithm for two-machine re-entrant shop scheduling.
Inna G. DrobouchevitchVitaly A. StrusevichPublished in: Ann. Oper. Res. (1999)
Keyphrases
- flowshop
- scheduling problem
- minimizing total tardiness
- manufacturing systems
- sequence dependent setup times
- shop floor
- unrelated parallel machines
- parallel machines
- batch processing
- preventive maintenance
- manufacturing cell
- setup times
- maximum lateness
- flexible manufacturing systems
- job shop
- processing times
- single machine
- precedence constraints
- minimizing makespan
- tabu search
- release dates
- np hard
- special case
- strongly np hard
- identical machines
- identical parallel machines
- scheduling jobs
- petri net
- round robin
- job shop scheduling problem
- artificial intelligence
- completion times
- real time
- dynamic scheduling
- resource constraints
- cell formation
- resource allocation
- project scheduling
- steady state
- database systems
- search engine
- shortest processing time