A new bounding mechanism for the CNC machine scheduling problems with controllable processing times.
Rabia K. KayanM. Selim AkturkPublished in: Eur. J. Oper. Res. (2005)
Keyphrases
- scheduling problem
- single machine
- flowshop
- sequence dependent setup times
- processing times
- parallel machines
- setup times
- strongly np hard
- earliness tardiness
- parallel machine scheduling problem
- np hard
- maximum lateness
- completion times
- minimizing makespan
- identical machines
- upper bound
- precedence constraints
- job shop scheduling
- job shop
- greedy heuristics
- bicriteria
- single machine scheduling problem
- tabu search
- sequencing problems
- list scheduling
- case study
- preventive maintenance
- release dates
- learning mechanism
- special case