A two-stage flow shop batch-scheduling problem with the option of using Not-All-Machines

Enrique Gerstl and Gur Mosheiov

International Journal of Production Economics, 2013, vol. 146, issue 1, 161-166

Abstract: The decision whether to use all the available machines in the shop becomes very relevant when the capacity exceeds the demand. In such cases, it might be optimal to use only a subset of the machines. We study this option in a two-stage flowshop environment. Jobs are assumed to be identical, and are processed in batches, where a machine-dependent setup time is required when starting a new batch. The objective function is minimum makespan. We introduce an exact efficient dynamic programming algorithm, which is shown numerically to be able to solve medium size instances in very reasonable time. For the solution of large instances, we propose an asymptotically optimal heuristic procedure and a lower bound on the makespan value, which produce extremely small optimality gaps.

Keywords: Scheduling; Flowshop; Makespan; Dynamic programming; Heuristic; Not-All-Machines (search for similar items in EconPapers)
Date: 2013
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0925527313002880
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:146:y:2013:i:1:p:161-166

DOI: 10.1016/j.ijpe.2013.06.018

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 ().