Different due-window assignment scheduling with deterioration effects

Yurong Zhang (), Xi Wang, Li-Han Zhang, Xue Jia and Ji-Bo Wang ()
Additional contact information
Yurong Zhang: Xi’an Polytechnic University
Xi Wang: University of Nottingham
Li-Han Zhang: Shenyang Aerospace University
Xue Jia: Shenyang Aerospace University
Ji-Bo Wang: Shenyang Aerospace University

Journal of Combinatorial Optimization, 2024, vol. 48, issue 5, No 7, 21 pages

Abstract: Abstract This paper studies a due-window assignment scheduling problem with deterioration effects on a single-machine. Under different due-window assignment, i.e., the due-window of a job without any restriction, our goal is to make a decision on the optimal due-window and sequence of all jobs to minimize the weighted sum of earliness and tardiness, number of early and delayed, due-window starting time and size. We present properties of the optimal solutions, for some special cases, we prove that the problem can be solved in polynomial time. For the general case, we present a lower bound and an upper bound (i.e., a heuristic algorithm), then a branch-and-bound algorithm is proposed.

Keywords: Scheduling; Due-window assignment; Deterioration effect; Branch-and-bound algorithm (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-024-01223-w 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:48:y:2024:i:5:d:10.1007_s10878-024-01223-w

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

DOI: 10.1007/s10878-024-01223-w

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