Abstract | ||
---|---|---|
This paper is a note on \"minimizing makespan in three machine flow shop with deteriorating jobs\" J.-B. Wang, M.-Z. Wang, minimizing makespan in three machine flow shop with deteriorating jobs, Computers & Operation Research 40 (2013) 547-557. Wang and Wang presented a branch-and-bound algorithm with several dominance properties and a lower bound; however, we think that the dominance properties may not be true as they are neither necessary nor sufficient. We first show by means of a counter-example that the published dominance properties are incorrect, and then present a necessary and sufficient condition for them to be true. Moreover, a simplifying remark is provided for the above dominance properties. We presented a note on paper Wang and Wang entitled \"minimizing makespan in three machine flow shop with deteriorating jobs\".They presented a branch and bound algorithm with several dominance properties.We showed by means of a counter-example that the dominance properties are incorrect.We also presented a necessary and sufficient condition for the dominance properties to be true. |
Year | DOI | Venue |
---|---|---|
2016 | 10.1016/j.cor.2016.02.001 | Computers & OR |
Keywords | Field | DocType |
Scheduling,Flow shop,Makespan,Linear deteriorating job,Dominance property | Branch and bound,Mathematical optimization,Job shop scheduling,Scheduling (computing),Upper and lower bounds,Flow shop scheduling,Mathematics | Journal |
Volume | Issue | ISSN |
72 | C | 0305-0548 |
Citations | PageRank | References |
0 | 0.34 | 1 |
Authors | ||
4 |
Name | Order | Citations | PageRank |
---|---|---|---|
Abbas-Ali Jafari | 1 | 0 | 0.34 |
Hassan Khademi-Zare | 2 | 0 | 1.01 |
M. M. Lotfi | 3 | 29 | 5.07 |
Reza Tavakkoli-Moghaddam | 4 | 585 | 72.31 |