A note on lot scheduling on a single machine to minimize maximum weighted tardiness

Gur Mosheiov and Assaf Sarig ()
Additional contact information
Gur Mosheiov: The Hebrew University
Assaf Sarig: The Hebrew University

Journal of Combinatorial Optimization, 2023, vol. 45, issue 5, No 18, 11 pages

Abstract: Abstract We study a single machine lot scheduling problem. Customers’ orders may be processed simultaneously in the same lot. The order sizes are assumed to be order-dependent, and the lots have identical size and identical processing time. Orders may be split, i.e., their processing may be performed on two consecutive lots. We assume order-dependent due-dates and weights, and the goal is to minimize the maximum weighted tardiness among all orders. A polynomial time solution algorithm is introduced.

Keywords: Lot scheduling; Single machine; Maximum weighted tardiness; Polynomial-time solution (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-023-01040-7 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:45:y:2023:i:5:d:10.1007_s10878-023-01040-7

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

DOI: 10.1007/s10878-023-01040-7

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