Single machine lot scheduling with optional job-rejection

Baruch Mor; Gur Mosheiov; Dana Shapira

doi:10.1007/s10878-020-00651-8

Single machine lot scheduling with optional job-rejection

Baruch Mor, Gur Mosheiov^*, Dana Shapira

^*Corresponding author for this work

Business Administration

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

9 Scopus citations

Abstract

We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In all cases, the goal is minimizing the relevant scheduling measure, subject to an upper bound on the total permitted rejection cost. All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases. Our numerical tests indicate that the proposed algorithms can solve efficiently large-size problems.

Original language	American English
Pages (from-to)	1-11
Number of pages	11
Journal	Journal of Combinatorial Optimization
Volume	41
Issue number	1
DOIs	https://doi.org/10.1007/s10878-020-00651-8
State	Published - Jan 2021

Bibliographical note

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

Publisher Copyright:
© 2020, Springer Science+Business Media, LLC, part of Springer Nature.

Keywords

Dynamic programming
Lot scheduling
Order rejection
Single machine

Access to Document

10.1007/s10878-020-00651-8

Cite this

@article{f9e14f28fb3b4f52aed577e11797bc24,

title = "Single machine lot scheduling with optional job-rejection",

abstract = "We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In all cases, the goal is minimizing the relevant scheduling measure, subject to an upper bound on the total permitted rejection cost. All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases. Our numerical tests indicate that the proposed algorithms can solve efficiently large-size problems.",

keywords = "Dynamic programming, Lot scheduling, Order rejection, Single machine",

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

note = "Funding Information: The second author was supported by the Israel Science Foundation (grant No. 2505/19), by the Recanati Fund of The School of Business Administration, and by Charles I. Rosen Chair of Management, The Hebrew University of Jerusalem, Israel. Publisher Copyright: {\textcopyright} 2020, Springer Science+Business Media, LLC, part of Springer Nature.",

year = "2021",

month = jan,

doi = "10.1007/s10878-020-00651-8",

language = "American English",

volume = "41",

pages = "1--11",

journal = "Journal of Combinatorial Optimization",

issn = "1382-6905",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Single machine lot scheduling with optional job-rejection

AU - Mor, Baruch

AU - Mosheiov, Gur

AU - Shapira, Dana

N1 - Funding Information: The second author was supported by the Israel Science Foundation (grant No. 2505/19), by the Recanati Fund of The School of Business Administration, and by Charles I. Rosen Chair of Management, The Hebrew University of Jerusalem, Israel. Publisher Copyright: © 2020, Springer Science+Business Media, LLC, part of Springer Nature.

PY - 2021/1

Y1 - 2021/1

N2 - We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In all cases, the goal is minimizing the relevant scheduling measure, subject to an upper bound on the total permitted rejection cost. All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases. Our numerical tests indicate that the proposed algorithms can solve efficiently large-size problems.

AB - We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In all cases, the goal is minimizing the relevant scheduling measure, subject to an upper bound on the total permitted rejection cost. All three problems studied here are NP-hard. We introduce efficient pseudo-polynomial dynamic programming algorithms for all cases. Our numerical tests indicate that the proposed algorithms can solve efficiently large-size problems.

KW - Dynamic programming

KW - Lot scheduling

KW - Order rejection

KW - Single machine

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

U2 - 10.1007/s10878-020-00651-8

DO - 10.1007/s10878-020-00651-8

M3 - Article

AN - SCOPUS:85092126655

SN - 1382-6905

VL - 41

SP - 1

EP - 11

JO - Journal of Combinatorial Optimization

JF - Journal of Combinatorial Optimization

IS - 1

ER -

Single machine lot scheduling with optional job-rejection

Abstract

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this