Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems

Dvir Shabtay, Yaron Bensoussan

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

The problem of maximizing the weighted number of just-in-time jobs in a two-machine flow shop scheduling system is known to be N P-hard (Choi and Yoon in J. Shed. 10:237-243, 2007). However, the question of whether this problem is strongly or ordinarily N P-hard remains an open question. We provide a pseudo-polynomial time algorithm to solve this problem, proving that it is N P-hard in the ordinary sense. Moreover, we show how the pseudo-polynomial algorithm can be converted to a fully polynomial time approximation scheme (FPTAS). In addition, we prove that the same problem is strongly N P-hard for both a two-machine job shop scheduling system and a two-machine open shop scheduling system.

Original languageEnglish
Pages (from-to)39-47
Number of pages9
JournalJournal of Scheduling
Volume15
Issue number1
DOIs
StatePublished - 1 Feb 2012

Keywords

  • Complexity
  • FPTAS
  • Flow shop
  • Job shop
  • Just-in-time scheduling
  • Open shop
  • Pseudo-polynomial time algorithm

ASJC Scopus subject areas

  • Software
  • Engineering (all)
  • Management Science and Operations Research
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Maximizing the weighted number of just-in-time jobs in several two-machine scheduling systems'. Together they form a unique fingerprint.

Cite this