A two-stage flexible flow shop problem with unit-execution-time jobs and batching

Enrique Gerstl and Gur Mosheiov

International Journal of Production Economics, 2014, vol. 158, issue C, 171-178

Abstract: We study a batch-scheduling problem of unit-time jobs on a two-stage flexible flowshop. The objective functions are minimum makespan and minimum flowtime. Unlike previously studied models: (i) a general number of machines in both stages of the flowshop is allowed, and (ii) there is no restriction on the number of batches to be processed on each machine. Efficient exact dynamic programming algorithms are introduced. Extensions to the case of machine-dependent setup times are studied as well. All the proposed algorithms run in polynomial time in the number of jobs.

Keywords: Deterministic scheduling; Flexible flowshop; Makespan; Batch scheduling (search for similar items in EconPapers)
Date: 2014
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S092552731400262X
Full text for ScienceDirect subscribers only

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:eee:proeco:v:158:y:2014:i:c:p:171-178

DOI: 10.1016/j.ijpe.2014.08.004

Access Statistics for this article

International Journal of Production Economics is currently edited by Stefan Minner

More articles in International Journal of Production Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().