Single machine lot scheduling with optional job-rejection

Baruch Mor, Gur Mosheiov*, Dana Shapira

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

12 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 languageAmerican English
Pages (from-to)1-11
Number of pages11
JournalJournal of Combinatorial Optimization
Volume41
Issue number1
DOIs
StatePublished - Jan 2021

Bibliographical note

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

Keywords

  • Dynamic programming
  • Lot scheduling
  • Order rejection
  • Single machine

Fingerprint

Dive into the research topics of 'Single machine lot scheduling with optional job-rejection'. Together they form a unique fingerprint.

Cite this