A note: flowshop scheduling with linear deterioration and job-rejection

Baruch Mor and Gur Mosheiov ()
Additional contact information
Baruch Mor: Ariel University
Gur Mosheiov: The Hebrew University

4OR, 2021, vol. 19, issue 1, No 6, 103-111

Abstract: Abstract We study a scheduling problem on an $$m$$ m -machine flowshop with linear deterioration of job processing times and job rejection. The objectives are minimum makespan and minimum total load, subject to an upper bound on the total permitted rejection cost. The problems are NP-hard (since the single machine makespan minimization version was shown to be hard), and we introduce pseudo-polynomial dynamic programming algorithms, thus proving that both problems are NP-hard in the ordinary sense.

Keywords: Scheduling; Flowshop; Linear deterioration; Job-rejection; Dynamic programming; 90B35; Deterministic; scheduling; theory; in; operations; research (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10288-020-00436-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:19:y:2021:i:1:d:10.1007_s10288-020-00436-z

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

DOI: 10.1007/s10288-020-00436-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 ().