A note on the single machine CON and CONW problems with lot scheduling

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

Journal of Combinatorial Optimization, 2021, vol. 42, issue 2, No 7, 327-338

Abstract: Abstract We study extensions of the classical single machine common due-date (CON) and common due-window (CONW) assignment problems to the setting of lot scheduling. In the CON problem, all the jobs share a common due-date, and jobs completed prior to or after the due-date are penalized according to their earliness/tardiness. In CONW, there exists a time interval, such that jobs completed within this interval are not penalized. In both cases the due-date/due-window are decision variables. In lot scheduling, a number of customer orders of different sizes may be processed in the same lot. We allow order splitting between consecutive lots. The objective is to find the order allocation to lots, such that the total cost of earliness, tardiness and due-date/due-window is minimized. Given $$n$$ n orders, and under the very realistic assumption that the lot capacity is of the order of $$n$$ n , we introduce polynomial time dynamic programming algorithms for both extensions. Our numerical tests indicate that both algorithms can easily solve medium-size problems.

Keywords: Lot scheduling; Single machine; Common due-date; Common due-window; Dynamic programming (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (4)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00709-1 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:42:y:2021:i:2:d:10.1007_s10878-021-00709-1

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

DOI: 10.1007/s10878-021-00709-1

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