A strong conic quadratic reformulation for machine-job assignment with controllable processing times.
M. Selim AkturkAlper AtamtürkSinan GurelPublished in: Oper. Res. Lett. (2009)
Keyphrases
- single machine
- flowshop
- batch processing
- scheduling problem
- scheduling jobs
- identical machines
- shortest processing time
- processing times
- completion times
- parallel machine scheduling problem
- maximum lateness
- sequence dependent setup times
- asymptotic optimality
- pairwise
- computer vision
- assembly line
- release dates
- real time
- dynamic programming
- single machine scheduling problem
- tabu search
- job search
- special case
- job scheduling
- minimizing makespan
- data sets