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

Gur Mosheiov; Assaf Sarig

doi:10.1007/s10878-023-01040-7

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

Gur Mosheiov, Assaf Sarig^*

^*Corresponding author for this work

BA Business Department

Research output: Contribution to journal › Article › peer-review

2 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 language	English
Article number	5
Pages (from-to)	128
Number of pages	1
Journal	Journal of Combinatorial Optimization
Volume	45
Issue number	5
DOIs	https://doi.org/10.1007/s10878-023-01040-7
State	Published - 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

Access to Document

10.1007/s10878-023-01040-7

Cite this

@article{6ead5a39c28b4265b9753db4072af578,

title = "A note on lot scheduling on a single machine to minimize maximum weighted tardiness",

abstract = "We study a single machine lot scheduling problem. Customers{\textquoteright} 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, Maximum weighted tardiness, Polynomial-time solution, Single machine",

author = "Gur Mosheiov and Assaf Sarig",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2023",

month = jul,

doi = "10.1007/s10878-023-01040-7",

language = "אנגלית",

volume = "45",

pages = "128",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "5",

}

TY - JOUR

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

AU - Mosheiov, Gur

AU - Sarig, Assaf

PY - 2023/7

Y1 - 2023/7

N2 - 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.

AB - 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.

KW - Lot scheduling

KW - Maximum weighted tardiness

KW - Polynomial-time solution

KW - Single machine

UR - http://www.scopus.com/inward/record.url?scp=85162915250&partnerID=8YFLogxK

U2 - 10.1007/s10878-023-01040-7

DO - 10.1007/s10878-023-01040-7

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:85162915250

SN - 1382-6905

VL - 45

SP - 128

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 5

M1 - 5

ER -

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

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this