Name
Title | ||
|---|---|---|
A note: Maximizing the weighted number of just-in-time jobs on a proportionate flowshop. |
Abstract | ||
|---|---|---|
In most cases, an extension of a polynomial time solution of a scheduling problem on a single machine to a proportionate flowshop leads to a similar (polynomial time) solution. One of the rare cases where the problem becomes hard, is that of maximizing the weighted number of Just-in-Time jobs on a proportionate flowshop. We introduce a (pseudo-polynomial) solution algorithm for this problem, which is faster by a factor of n than the algorithm published in the literature. We also introduce a (polynomial time) solution algorithm for the “no-wait” proportionate flowshop. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ipl.2014.09.004 | Information Processing Letters |
Keywords | Field | DocType |
Scheduling,Proportionate flowshop,Just-in-Time | Discrete mathematics,Combinatorics,Mathematical optimization,Job shop scheduling,Scheduling (computing),Flow shop scheduling,Time complexity,Mathematics | Journal |
Volume | Issue | ISSN |
115 | 2 | 0020-0190 |
Citations | PageRank | References |
3 | 0.49 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Enrique Gerstl | 1 | 63 | 7.72 |
| Baruch Mor | 2 | 154 | 16.10 |
| Gur Mosheiov | 3 | 1073 | 105.02 |