Minmax scheduling problems with common due-date and completion time penalty

Baruch Mor ()
Additional contact information
Baruch Mor: Ariel University

Journal of Combinatorial Optimization, 2019, vol. 38, issue 1, No 3, 50-71

Abstract: Abstract We study the well-known common due-date assignment and scheduling problem and focus on minmax objective functions with position-dependent processing times. In due-date assignment problems, the objective is to find simultaneously the optimal job sequence and due-date that minimize the total earliness, tardiness and due-date related costs. Based on the solution of the problem with position-independent processing times, positional-weights are provided that lead to a simple solution procedure. Two extensions of the basic problem are discussed and solved to optimality. First, we generalize the results of the due-date to the setting of due-window assignment. Second, we study the common due-date problem with completion time penalty. The latter problem is studied with position-independent and position-dependent processing times as well as optional job rejection. For all studied problems, except the last, we introduce efficient polynomial time solutions. In respect to the last problem, considering job-rejection, we prove that it is NP-hard in the ordinary sense and provide an efficient pseudo-polynomial dynamic programming algorithm and extensive numerical study.

Keywords: Scheduling; Single machine; Common due-date; Minmax; Position-dependent processing times; Job-rejection (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-018-0365-8 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:jcomop:v:38:y:2019:i:1:d:10.1007_s10878-018-0365-8

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-018-0365-8

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

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