Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates

Baruch Mor (), Gur Mosheiov () and Dvir Shabtay ()
Additional contact information
Baruch Mor: Ariel University
Gur Mosheiov: The Hebrew University
Dvir Shabtay: Ben-Gurion University of the Negev

Journal of Scheduling, 2021, vol. 24, issue 6, No 1, 553-567

Abstract: Abstract We study a scheduling problem involving both partitioning and scheduling decisions. A solution for our problem is defined by (i) partitioning the set of jobs into a set of accepted and a set of rejected jobs and (ii) scheduling the set of accepted jobs in a proportionate flow shop scheduling system. For a given solution, the jth largest due date is assigned to the job with the jth largest completion time. The quality of a solution is measured by two criteria, one for each set of jobs. The first is the total tardiness of the set of accepted jobs, and the second is the total rejection cost. We study two problems. The goal in the first is to find a solution minimizing the sum of the total tardiness and the rejection cost, while the goal in the second is to find a solution minimizing the total rejection cost, given a bound on the total tardiness. As both problems are $${\mathcal {N}}{\mathcal {P}}$$ N P -hard, we focus on the design of both exact algorithms and approximation schemes.

Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)

Downloads: (external link)
http://link.springer.com/10.1007/s10951-021-00697-4 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:24:y:2021:i:6:d:10.1007_s10951-021-00697-4

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

DOI: 10.1007/s10951-021-00697-4

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