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

doi:10.1007/s10951-013-0320-6

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

Department of Management

Bar-Ilan University

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

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(n⁴/ε)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(n³/ε) time.

Original language	English
Pages (from-to)	429-435
Number of pages	7
Journal	Journal of Scheduling
Volume	16
Issue number	4
DOIs	https://doi.org/10.1007/s10951-013-0320-6
State	Published - Aug 2013

Keywords

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

All Science Journal Classification (ASJC) codes

Software
General Engineering
Management Science and Operations Research
Artificial Intelligence

Access to Document

10.1007/s10951-013-0320-6

Cite this

@article{17e59a02912040c2a08d99ed990ab543,

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

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.",

keywords = "Complexity, FPTAS, Flow shop, Just-in-time scheduling, Pseudo-polynomial algorithm",

author = "Amir Elalouf and Eugene Levner and Huajun Tang",

year = "2013",

month = aug,

doi = "10.1007/s10951-013-0320-6",

language = "الإنجليزيّة",

volume = "16",

pages = "429--435",

journal = "Journal of Scheduling",

issn = "1094-6136",

publisher = "Springer New York",

number = "4",

}

TY - JOUR

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

AU - Elalouf, Amir

AU - Levner, Eugene

AU - Tang, Huajun

PY - 2013/8

Y1 - 2013/8

N2 - 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.

AB - 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.

KW - Complexity

KW - FPTAS

KW - Flow shop

KW - Just-in-time scheduling

KW - Pseudo-polynomial algorithm

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

U2 - 10.1007/s10951-013-0320-6

DO - 10.1007/s10951-013-0320-6

M3 - مقالة

SN - 1094-6136

VL - 16

SP - 429

EP - 435

JO - Journal of Scheduling

JF - Journal of Scheduling

IS - 4

ER -

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

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this