Name
Abstract | ||
|---|---|---|
In this paper we address the problem of scheduling unit time jobs in a flowshop to minimize makespan under a discrete renewable resource constraint. We propose algorithms having complexityO(n) for special cases of two machine and three machine problems. For the three machineN P-hard problem we develop a branch and bound procedure and several upper and lower bounds. We test the efficiency of the procedure and report our computational experience. |
Year | DOI | Venue |
|---|---|---|
1992 | 10.1007/BF01416242 | Math. Meth. of OR |
Keywords | Field | DocType |
scheduling,flowshop.,resource constraint,branch and bound,computer experiment,upper and lower bounds,renewable resources | Branch and bound,Mathematical optimization,Job shop scheduling,Scheduling (computing),Upper and lower bounds,Flow shop scheduling,Renewable resource,Minimisation (psychology),Minification,Mathematics | Journal |
Volume | Issue | Citations |
36 | 6 | 3 |
PageRank | References | Authors |
0.41 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| H. Süral | 1 | 3 | 0.75 |
| S. Kondakci | 2 | 3 | 0.41 |
| N. Erkip | 3 | 3 | 0.41 |