The problem of minimum makespan on an m machine jobshop with unit execution time (UET) jobs (m a≥ 3) is known to be strongly NP-hard even with no setup times. We focus in this article on the two-machine case. We assume UET jobs and consider batching with batch availability and machine-dependent setup times. We introduce an efficient (O(√n)) algorithm, where n is the number of jobs. We then introduce a heuristic for the multimachine case and demonstrate its efficiency for two interesting instances.
- batch scheduling
- unit execution time jobs