A MILP model for single machine family scheduling with sequence-dependent batch setup and controllable processing times.
Davide GiglioPublished in: CoRR (2015)
Keyphrases
- single machine
- processing times
- scheduling problem
- release dates
- minimize total
- earliness tardiness
- scheduling jobs
- sequence dependent setup times
- maximum lateness
- total weighted tardiness
- release times
- setup times
- identical machines
- single machine scheduling problem
- learning effect
- makespan minimization
- production scheduling
- tabu search
- competitive ratio
- special case
- np hard
- completion times
- objective function