Minimizing total completion time on a batching machine with job processing time compatibilities.
Adrien BellangerAmmar OulamaraMikhail Y. KovalyovPublished in: Electron. Notes Discret. Math. (2010)
Keyphrases
- batch processing
- processing times
- scheduling jobs
- single machine
- flowshop
- scheduling problem
- shortest processing time
- identical machines
- release dates
- maximum lateness
- completion times
- setup times
- parallel machine scheduling problem
- single machine scheduling problem
- special case
- sequence dependent setup times
- job scheduling
- parallel machines
- identical parallel machines
- asymptotic optimality
- minimizing makespan
- data sets
- tabu search
- databases
- genetic algorithm
- information systems
- support vector
- strongly np hard
- job shop