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

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 (( )log( / )), where is the n...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of scheduling Ročník 16; číslo 4; s. 429 - 435
Hlavní autoři: Elalouf, Amir, Levner, Eugene, Tang, Huajun
Médium: Journal Article
Jazyk:angličtina
Vydáno: Boston Springer US 01.08.2013
Springer Nature B.V
Témata:
Algorithms
Approximation
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control; Optimization
Codes
Job shops
Just in time
Operations Research/Decision Theory
Optimization
Production scheduling
Schedules
Scheduling
Studies
Supply Chain Management
Just-in-time scheduling
Pseudo-polynomial algorithm
Flow shop
FPTAS
Complexity
ISSN:1094-6136, 1099-1425
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 (( )log( / )), where 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 time.
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-013-0320-6