Flowshop scheduling with learning effect and job rejection

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

Journal of Scheduling, 2020, vol. 23, issue 6, No 2, 641 pages

Abstract: Abstract We study scheduling problems on a proportionate flowshop. Three objective functions are considered: minimum makespan, minimum total completion time, and minimum total load. We consider a learning process; thus, the processing time of a job processed later in sequence is reduced. The scheduler has the option of job rejection; i.e., only a subset of the jobs are processed and the rejected jobs are penalized. An upper bound on the total permitted rejection cost is assumed. Since the single-machine versions of these problems were shown to be NP-hard, we focus on the introduction of pseudopolynomial dynamic programming algorithms, indicating that the problems are NP-hard in the ordinary sense. We provide an extensive numerical study verifying that the proposed solution algorithms are very efficient and instances containing up to 80 jobs are solved in no more than 5 ms.

Keywords: Scheduling; Proportionate flowshop; Learning effect; Job rejection; Dynamic programming (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (6)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-019-00612-y 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:jsched:v:23:y:2020:i:6:d:10.1007_s10951-019-00612-y

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-019-00612-y

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

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