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

Gur Mosheiov, Assaf Sarig*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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.

Original languageAmerican English
Article number5
Pages (from-to)128
Number of pages1
JournalJournal of Combinatorial Optimization
Volume45
Issue number5
DOIs
StatePublished - Jul 2023

Bibliographical note

Publisher Copyright:
© 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.

Keywords

  • Lot scheduling
  • Maximum weighted tardiness
  • Polynomial-time solution
  • Single machine

Fingerprint

Dive into the research topics of 'A note on lot scheduling on a single machine to minimize maximum weighted tardiness'. Together they form a unique fingerprint.

Cite this