Approximation schemes for the restricted shortest path problem
Mathematics of Operations Research
An improved FPTAS for restricted shortest path
Information Processing Letters
Maximizing the weighted number of just-in-time jobs in flow shop scheduling
Journal of Scheduling
A simple efficient approximation scheme for the restricted shortest path problem
Operations Research Letters
| Hi-index | 0.00 |
Recently, Shabtay and Bensoussan (2012) developed an original exact pseudo-polynomial algorithm and an efficient $$\upvarepsilon $$ -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^{4}/\upvarepsilon $$ )log( $$n$$ / $$\upvarepsilon $$ )), 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^{3}/\upvarepsilon )$$ time.