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 language | English |
---|---|
Pages (from-to) | 429-435 |
Number of pages | 7 |
Journal | Journal of Scheduling |
Volume | 16 |
Issue number | 4 |
DOIs | |
State | Published - Aug 2013 |
Keywords
- Complexity
- FPTAS
- Flow shop
- Just-in-time scheduling
- Pseudo-polynomial algorithm