Name
Abstract | ||
|---|---|---|
We study the problem of minimizing makespan in a two-machine job shop with unit processing time operations. An efficient algorithm with respect to a succinct encoding of the problem instances is proposed. The algorithm is an improvement of earlier algorithms proposed for the problem by Brucker [1,2], Hefetz and Adiri [7], and Timkovskiy [15]. The idea behind the algorithm has the potential of extension to job shops with parallel machines. |
Year | DOI | Venue |
|---|---|---|
1995 | 10.1007/BF02099698 | Annals of Operations Research |
Keywords | Field | DocType |
Processing Time,Time Operation,Unit Processing,Problem Instance,Efficient Algorithm | Mathematical optimization,Job shop scheduling,Scheduling (computing),Computer science,Job shop,Flow shop scheduling,Algorithm,Theoretical computer science,Polynomial algorithm,Encoding (memory) | Journal |
Volume | Issue | ISSN |
57 | 1 | 1572-9338 |
Citations | PageRank | References |
6 | 1.45 | 4 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wieslaw Kubiak | 1 | 540 | 62.61 |
| Suresh Sethi | 2 | 1215 | 255.98 |
| Chelliah Sriskandarajah | 3 | 664 | 58.93 |