One-machine generalized precedence constrained scheduling problems.
Erick D. WikumDonna Crystal LlewellynGeorge L. NemhauserPublished in: Oper. Res. Lett. (1994)
Keyphrases
- scheduling problem
- flowshop
- parallel machines
- unrelated parallel machines
- minimizing makespan
- single machine
- parallel machine scheduling problem
- setup times
- sequence dependent setup times
- processing times
- strongly np hard
- special case
- bicriteria
- precedence constraints
- job shop
- tardiness penalties
- maximum lateness
- earliness tardiness
- identical machines
- np hard
- job shop scheduling
- tabu search
- sequencing problems
- neural network
- search space