The open shop scheduling problem with a given sequence of jobs on one machine

Naval Research Logistics

Volumn 45, Issue 7, 1998, Pages 705-731

  Shafransky, Y M ^a   Strusevich, V A ^b  

^a UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^b UNIVERSITY OF GREENWICH   (United Kingdom)

Author keywords

Approximation; Complexity; Open shop

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; POLYNOMIALS; PROBLEM SOLVING; PROCESS CONTROL;

OPEN SHOP SCHEDULING PROBLEM;

LOGISTICS;

EID: 0032187167     PISSN: 0894069X     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1520-6750(199810)45:7<705::AID-NAV4>3.0.CO;2-F     Document Type: Article

References (15)

1. Gabow, H.N., and Kariv, O., "Algorithms for Edge Coloring Bipartite Graphs and Multigraphs," SIAM Journal on Computing, 11, 117-129 (1982).
2. Garey, M.R., and Johnson, D.S., Computers and Intractability. A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
3. Gonzalez, T., "A Note on Open Shop Preemptive Schedules," IEEE Transactions on Computers, 28, 782-786 (1979).
4. Gonzalez, T., and Sahni, S., "Open Shop Scheduling To Minimize Finish Time," Journal of the Association for Computer Machinery, 23, 665-679 (1976).
5. Gordon, V.S., and Shafransky, Y.M., "Optimal Sequencing under Series-Parallel Precedence Constraints," Doklady Akademii Nauk BSSR, 22, 244-247 (1978) (in Russian).
6. Lawler, E.L., and Labetoulle, J., "On Preemptive Scheduling on Unrelated Parallel Processors by Linear Programming," Journal of the Association for Computer Machinery, 25, 612-619 (1978).
7. Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., and Shmoys, D.B., "Sequencing and Scheduling: Algorithms and Complexity," in S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin, (Eds.), Handbooks in Operations Research and Management Science, Vol. 4, Logistics of Production and Inventory, North-Holland, Amsterdam, 1993, pp. 445-522.
8. Lenstra, J.K., Rinnooy Kan, A.H.G., and Brucker, P., "Complexity of Machine Scheduling Problems," Annals of Discrete Mathematics, 1, 343-362 (1977).
9. Monma, C.L., "The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Constraints: An Algorithm and Extensions," Operations Research, 27, 792-797 (1979).
10. Monma, C.L., "Sequencing To Minimize the Maximum Job Cost," Operations Research, 28, 942-951 (1980).
11. Sidney, J.B., "The Two-Machine Maximum Flow Time Problem with Series Parallel Precedence Relation," Operations Research, 27, 782-791 (1979).
12. Strusevich, V.A., "Shop Scheduling Problems under Precedence Constraints, " Annals of Operations Research, 69, 351-377 (1997).
13. Tanaev, V.S., Gordon, V.S., and Shafransky, Y.M., Scheduling Theory. Single-Stage Systems, Kluwer Academic, Dordrecht, 1994.
14. Tanaev, V.S., Sotskov, Y.N., and Strusevich, V.A., Scheduling Theory. Multi-Stage Systems, Kluwer Academic, Dordrecht, 1994.
15. Vairaktarakis, G., and Sahni, S., "Dual Criteria Preemptive Open-Shop Problems with Minimum Makespan," Naval Research Logistics, 42, 103-121 (1995).