A note on batch scheduling on a two-machine flowshop with machine-dependent processing times

Gur Mosheiov () and Daniel Oron
Additional contact information
Gur Mosheiov: The Hebrew University
Daniel Oron: The University of Sydney

4OR, 2023, vol. 21, issue 3, No 5, 457-469

Abstract: Abstract We study a batch scheduling problem on a two-machine flowshop. Unlike most relevant research papers focusing on batching with identical job processing times, we assume machine-dependent processing times. The objective function is minimum makespan. For the relaxed version of the problem, where integer batch sizes are not required, we introduce a constant time solution. It consists of: (i) a closed-form expression for the optimal number of batches; and (ii) a geometric sequence of the batch sizes. This optimal non-integer solution is converted into an integer solution by the application of a simple rounding procedure, which runs in O(nlogn) time (where n is the number of jobs).

Keywords: Scheduling; Batching; Flow-shop; Makespan; Batch availability; Machine-dependent processing times; 90B35 (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10288-022-00519-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:aqjoor:v:21:y:2023:i:3:d:10.1007_s10288-022-00519-z

Ordering information: This journal article can be ordered from
https://www.springer ... ch/journal/10288/PSE

DOI: 10.1007/s10288-022-00519-z

Access Statistics for this article

4OR is currently edited by Yves Crama, Michel Grabisch and Silvano Martello

More articles in 4OR from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().