The proportionate flow shop total tardiness problem

Christos Koulamas

European Journal of Operational Research, 2020, vol. 284, issue 2, 439-444

Abstract: We consider the proportionate flow shop total tardiness problem and show how to implement Lawler's (1977) pseudo-polynomial dynamic programming (DP) algorithm for the single-machine total tardiness problem to the multi-machine environment of proportionate flow shop. We also present solvable special cases including one with small/big jobs that has not been considered for the corresponding single-machine problem. We then convert the DP algorithm for the proportionate flow shop to a fully polynomial time approximation scheme (FPTAS). Finally, we show by a counterexample that Pinedo's (2002, p. 140) statement that “the elimination criteria for the single-machine total weighted tardiness problem also apply to the proportionate flow shop total weighted tardiness problem” does not always hold and present an appropriately revised statement.

Keywords: Scheduling; Flow shop; Proportionate; Total tardiness (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0377221720300023
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:ejores:v:284:y:2020:i:2:p:439-444

DOI: 10.1016/j.ejor.2020.01.002

Access Statistics for this article

European Journal of Operational Research is currently edited by Roman Slowinski, Jesus Artalejo, Jean-Charles. Billaut, Robert Dyson and Lorenzo Peccati

More articles in European Journal of Operational Research from Elsevier
Bibliographic data for series maintained by Catherine Liu ().