A general model for cyclic machine scheduling problems.
Peter BruckerThomas KampmeyerPublished in: Discret. Appl. Math. (2008)
Keyphrases
- scheduling problem
- flowshop
- parallel machines
- parallel machine scheduling problem
- single machine
- processing times
- unrelated parallel machines
- minimizing makespan
- strongly np hard
- setup times
- sequence dependent setup times
- np hard
- tabu search
- maximum lateness
- job shop scheduling
- cyclic scheduling
- sequencing problems
- special case
- job shop
- bicriteria
- identical machines
- tardiness penalties
- scheduling decisions
- earliness tardiness
- list scheduling
- precedence constraints
- search algorithm for solving
- batch processing
- limited capacity
- database
- release dates
- completion times
- np complete
- evolutionary algorithm