A branch and bound algorithm for scheduling unit size jobs on parallel batching machines to minimize makespan

In this paper, we present a branch and bound algorithm for the parallel batch scheduling of jobs having different processing times, release dates and unit sizes. There are identical machines with a fixed capacity and the number of jobs in a batch cannot exceed the machine capacity. All batched jobs...

Full description

Saved in:
Bibliographic Details
Published inInternational journal of production research Vol. 55; no. 6; pp. 1815 - 1831
Main Authors Ozturk, Onur, Begen, Mehmet A., Zaric, Gregory S.
Format Journal Article
LanguageEnglish
Published London Taylor & Francis 19.03.2017
Taylor & Francis LLC
Subjects
Algorithms
Batch processing
batch scheduling
branch and bound
Computation
heuristics
makespan
Mathematical models
Mathematical programming
Mixed integer
Optimization
parallel machines
Production scheduling
Scheduling
Online AccessGet full text

Cover

More Information
Summary:In this paper, we present a branch and bound algorithm for the parallel batch scheduling of jobs having different processing times, release dates and unit sizes. There are identical machines with a fixed capacity and the number of jobs in a batch cannot exceed the machine capacity. All batched jobs are processed together and the processing time of a batch is given by the greatest processing time of jobs in that batch. We compare our method to a mixed integer program as well as a method from the literature that is capable of optimally solving instances with a single machine. Computational experiments show that our method is much more efficient than the other two methods in terms of solution time for finding the optimal solution.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0020-7543
1366-588X
DOI:10.1080/00207543.2016.1253889