A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence

Enrique Gerstl, Gur Mosheiov*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

We study a single machine scheduling problem to maximize the weighted number of Just-in-Time jobs, i.e., jobs which are completed exactly at their due-dates. We focus on the case that the job sequence is given. A pseudo-polynomial solution algorithm has been published for this problem, and we introduce here an efficient polynomial time dynamic programming algorithm. The new algorithm is tested numerically, and the results are compared to those obtained by the old algorithm. While the running times required by both algorithms for solving large instances are extremely small, it appears that the new algorithm performs better in two aspects: (1) The resulting running time is independent of the actual density of the due-dates, (2) The required memory is significantly reduced. An extension to a two-machine flowshop is provided, and this case is shown to remain polynomially solvable.

Original languageAmerican English
Pages (from-to)403-409
Number of pages7
JournalJournal of Scheduling
Volume26
Issue number4
DOIs
StatePublished - Aug 2023

Bibliographical note

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

Keywords

  • Dynamic programming
  • Flowshop
  • Just-in-Time
  • Scheduling
  • Single machine

Fingerprint

Dive into the research topics of 'A note: maximizing the weighted number of Just-in-Time jobs for a given job sequence'. Together they form a unique fingerprint.

Cite this