An improved MIP-based approach to minimise total earliness and tardiness in unrelated parallel machines scheduling with machine idle time.
Chi-Yang TsaiYi-Chen WangPublished in: Int. J. Manuf. Technol. Manag. (2015)
Keyphrases
- unrelated parallel machines
- scheduling problem
- single machine
- completion times
- parallel machines
- flowshop
- scheduling jobs
- setup times
- single machine scheduling problem
- tabu search
- processing times
- mixed integer programming
- np hard
- precedence constraints
- open shop
- release dates
- feasible solution
- job shop scheduling
- sequence dependent setup times
- strongly np hard
- job shop
- job shop scheduling problem
- optimal solution
- identical machines
- competitive ratio
- batch processing
- branch and bound algorithm
- weighted sum
- column generation
- resource consumption