An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem

Amir Elalouf, Eugene Levner, Huajun Tang

Research output: Contribution to journalArticlepeer-review

16 Scopus citations

Abstract

Recently, Shabtay and Bensoussan (2012) developed an original exact pseudo-polynomial algorithm and an efficient ε -approximation algorithm (FPTAS) for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem. The complexity of the FPTAS is O(n4/ε)log(n/ ε)), where n is the number of jobs. In this note we suggest another pseudo-polynomial algorithm that can be converted to a new FPTAS which improves Shabtay-Bensoussan's complexity result and runs in O(n3/ε) time.

Original languageEnglish
Pages (from-to)429-435
Number of pages7
JournalJournal of Scheduling
Volume16
Issue number4
DOIs
StatePublished - Aug 2013

Keywords

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

Fingerprint

Dive into the research topics of 'An improved FPTAS for maximizing the weighted number of just-in-time jobs in a two-machine flow shop problem'. Together they form a unique fingerprint.

Cite this