Insertion of new idle time for unrelated parallel machine scheduling with job splitting and machine breakdowns.
Yong-Ho KimRyong-Su KimPublished in: Comput. Ind. Eng. (2020)
Keyphrases
- flowshop
- scheduling problem
- setup times
- processing times
- single machine
- single machine scheduling problem
- batch processing
- scheduling jobs
- parallel machine scheduling problem
- sequence dependent setup times
- identical machines
- shortest processing time
- completion times
- maximum lateness
- release dates
- scheduling decisions
- strongly np hard
- asymptotic optimality
- np hard
- job scheduling
- tabu search
- special case
- artificial intelligence
- genetic algorithm
- real world
- branch and bound algorithm
- information systems
- minimizing makespan
- data mining