Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

Baruch Mor; Gur Mosheiov; Dana Shapira

doi:10.1016/j.ipl.2020.106009

Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

Baruch Mor, Gur Mosheiov, Dana Shapira

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

6 Scopus citations

Abstract

We consider a single machine lot scheduling problem. A number of customer orders of different sizes may be processed in the same lot. We consider first the setting that splitting orders between consecutive lots is allowed. We focus on minimizing the number of tardy orders. A polynomial time solution algorithm is introduced for this problem. We then study the extension to minimizing the weighted number of tardy orders. This problem is NP-hard, and a pseudo-polynomial dynamic programming is provided and tested. We also study the setting of no-split. The problem of minimizing the number of tardy orders in this context is proved to be strongly NP-hard, and an efficient heuristic is introduced.

Original language	English
Article number	106009
Journal	Information Processing Letters
Volume	164
DOIs	https://doi.org/10.1016/j.ipl.2020.106009
State	Published - Dec 2020
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 2020 Elsevier B.V.

Funding

This research was supported by the Israel Science Foundation (grant No. 2505/19 ). The second author was also supported by the Charles I. Rosen Chair of Management , and by The Recanati Fund of The School of Business Administration of The Hebrew University .

Funders	Funder number
School of Business Administration of the Hebrew University
Israel Science Foundation	2505/19

Keywords

Dynamic programming
Lot scheduling
Number of tardy orders
Scheduling
Single machine

Access to Document

10.1016/j.ipl.2020.106009

Cite this

@article{c85e0f7907114de99eca45470b4305ed,

title = "Lot scheduling on a single machine to minimize the (weighted) number of tardy orders",

abstract = "We consider a single machine lot scheduling problem. A number of customer orders of different sizes may be processed in the same lot. We consider first the setting that splitting orders between consecutive lots is allowed. We focus on minimizing the number of tardy orders. A polynomial time solution algorithm is introduced for this problem. We then study the extension to minimizing the weighted number of tardy orders. This problem is NP-hard, and a pseudo-polynomial dynamic programming is provided and tested. We also study the setting of no-split. The problem of minimizing the number of tardy orders in this context is proved to be strongly NP-hard, and an efficient heuristic is introduced.",

keywords = "Dynamic programming, Lot scheduling, Number of tardy orders, Scheduling, Single machine",

author = "Baruch Mor and Gur Mosheiov and Dana Shapira",

note = "Publisher Copyright: {\textcopyright} 2020 Elsevier B.V.",

year = "2020",

month = dec,

doi = "10.1016/j.ipl.2020.106009",

language = "אנגלית",

volume = "164",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier",

}

TY - JOUR

T1 - Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

AU - Mor, Baruch

AU - Mosheiov, Gur

AU - Shapira, Dana

PY - 2020/12

Y1 - 2020/12

N2 - We consider a single machine lot scheduling problem. A number of customer orders of different sizes may be processed in the same lot. We consider first the setting that splitting orders between consecutive lots is allowed. We focus on minimizing the number of tardy orders. A polynomial time solution algorithm is introduced for this problem. We then study the extension to minimizing the weighted number of tardy orders. This problem is NP-hard, and a pseudo-polynomial dynamic programming is provided and tested. We also study the setting of no-split. The problem of minimizing the number of tardy orders in this context is proved to be strongly NP-hard, and an efficient heuristic is introduced.

AB - We consider a single machine lot scheduling problem. A number of customer orders of different sizes may be processed in the same lot. We consider first the setting that splitting orders between consecutive lots is allowed. We focus on minimizing the number of tardy orders. A polynomial time solution algorithm is introduced for this problem. We then study the extension to minimizing the weighted number of tardy orders. This problem is NP-hard, and a pseudo-polynomial dynamic programming is provided and tested. We also study the setting of no-split. The problem of minimizing the number of tardy orders in this context is proved to be strongly NP-hard, and an efficient heuristic is introduced.

KW - Dynamic programming

KW - Lot scheduling

KW - Number of tardy orders

KW - Scheduling

KW - Single machine

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

U2 - 10.1016/j.ipl.2020.106009

DO - 10.1016/j.ipl.2020.106009

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

AN - SCOPUS:85088793798

SN - 0020-0190

VL - 164

JO - Information Processing Letters

JF - Information Processing Letters

M1 - 106009

ER -

Lot scheduling on a single machine to minimize the (weighted) number of tardy orders

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this