Sequencing with Ordered Criteria, Precedence and Group Technology Constraints

Informatica

Volumn 12, Issue 1, 2001, Pages 61-88

  Janiak, Adam ^a   Shafransky, Yakov ^b,c   Tuzikov, Alexander ^b  

^a WROCLAW UNIVERSITY OF TECHNOLOGY   (Poland)

^b UNITED INSTITUTE OF INFORMATICS PROBLEMS   (Belarus)

^c BELARUSIAN STATE UNIVERSITY   (Belarus)

Author keywords

Group technology; Multiple criteria; Optimization; Precedence constraints; Scheduling theory; Sequencing

Indexed keywords

EID: 0347138143     PISSN: 08684952     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (33)

1. Bansal, S.P. (1980). Single machine scheduling to minimize weighted sum of completion times with secondary criterion. Europ. J. Oper. Res., 5, 177-181.
2. Brucker, P., J.K. Lenstra, A.H.G. Rinnooy Kan (1975). Complexity of machine scheduling problems. Technical Report BW 43, Mathematische Centrum, Amsterdam.
3. Burns, R.N. (1976). Scheduling to minimize the weighted sum of completion times with secondary criteria. Naval. Res. Logist. Quart., 23, 125-129.
4. Chen, C.-L., R.L. Bulfin (1993). Complexity of single machine multi-criteria scheduling problems. Eur. J. Oper. Res., 70, 115-125.
5. Dileepan, P., P. Sen (1988). Bicriterion static scheduling research for a single machine. Omega, 16, 53-59.
6. Emmons, H. (1975). A note on a scheduling problem with dual criteria. Naval. Res. Logist. Quart., 22, 615-616.
7. Gordon, V.S., Y.M. Shafransky (1978). Optimal ordering with series-parallel precedence constraints. Doklady Akademii Nauk BSSR, 22(3), 244-247 (in Russian).
8. Ham, I., K. Hitomi, Y. Yoshida (1985). Group Technology. Kluwer-Nijhoff, Dordrecht.
9. Heck, H., S.A. Roberts (1972). A note on the extension of a result on scheduling with secondary criteria. Naval. Res. Logist. Quart., 19, 403-405.
10. Lawler, E.L. (1973). Optimal sequencing of a single machine subject to precedence constraints. Management Science, 19(5), 544-546.
11. Lawler, E.L. (1983). Recent results in the theory of machine scheduling. In A. Bachem, M. Grötschel and B. Korte (Ed.), Mathematical Programming: the State of Art. Springer, Berlin, pp. 202-234.
12. Lawler, E.L., J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (1989). Sequencing and scheduling: Algorithms and complexity. Technical Report BS-R8909, Center for Mathematics and Computer Science, Amsterdam.
13. Lenstra, J.K., A.H.G. Rinnooy Kan, P. Brucker (1977). Complexity of machine scheduling problems. Ann. Discr. Math., 1, 343-362.
14. Livshitz, E.M. (1968). The sequence of operations for complex detail production. Avtomatika i Telemekhanika, 11, 94-95 (in Russian).
15. Mitten, L.G. (1960). An analytic solution to the least cost testing sequence problem. J. Industrial Engineering, 11, 17-23.
16. Miyazaki, S. (1981). One machine scheduling problem with dual criteria. J. Oper. Res. Soc. Japan, 24, 37-50.
17. Monma, C.L. (1981). Sequencing with general precedence constraints. Discrete Appl. Math., 3, 137-150.
18. Monma, C.L., J.B. Sidney (1979). Sequencing with series-parallel precedence constraints. Math. Oper. Res., 4, 215-224.
19. Monma, C.L., J.B. Sidney (1987). Optimal sequencing via modular decomposition: Characterization of sequencing functions. Math. Oper. Res., 12, 22-31.
20. Moore, J.M. (1968). An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Science, 15(1), 102-109.
21. Podinovsky, V.V., V.M. Gavrilov (1975). Optimization on Sequentially Applied Criteria. Sovetskoe Radio, Moscow (in Russian).
22. Shafransky, Y.M. (1978). On optimal sequencing for deterministic systems with tree-like partial order. Vestsi Akademii Navuk BSSR. Ser. Fizika-Matein. Navuk 2, 119-120 (in Russian).
23. Shafransky, Y.M. (1980). On a problem of minimizing functions over a set of permutations of partially ordered elements. Vestsi Akademii Navuk BSSR. Ser. Fizika-Matem. Navuk 5, 132 (in Russian).
24. Shanthikumar, J.G. (1983). Scheduling n jobs on one machine to minimize the maximal tardiness with minimum number tardy. Comput. and Oper. Res., 10, 255-266.
25. Slowinski, R. (1989). Multiobjective project scheduling under multiple-category resource constraints. In R. Slowinski and J. Weglon (Eds.), Advances in Project Scheduling. Elsevier Science Publishers B.U., Amsterdam.
26. Smith, W.E. (1956). Various optimizers for single stage production. Naval. Res. Logist. Quart., 3, 59-66.
27. Tabucanon, M.T., V. Chankong (1989). Multiple Criteria Decision Making: Application in Industry and Service. Asian Institute of Technology.
28. Tanaev, V.S., V.S. Gordon, Y.M. Shafransky (1984). Scheduling Theory. Single-Stage Systems. Nauka, Moscow (in Russian).
29. Tanaev, V.S., V.S. Gordon, Y.M. Shafransky (1994). Scheduling Theory. Single-Stage Systems. Kluwer Academic Publishers, Dordrecht.
30. Tuzikov, A.V. (1985). Methods of Solving Some Classes of Multicriterion Scheduling Problems. PhD thesis, Institute of Engineering Cybernetics, Minsk (in Russian).
31. Valdes, J., R.E. Tarjan, E.L. Lawler (1982). The recognition of series-parallel digraphs. SIAM J. Comput., 11, 298-313.
32. Yuan, J., Y. Zhao (1994). Strongly NP-hardness results in the single machine secondary criterion scheduling problems with weigted flowtime or tardiness as one of the criteria. ZOR.
33. Zinder, Y.A., T.P. Podchasova (1976). Minimizing ordered criteria in single machine systems. In Automated Control and Data Processing Systems. Kiev, pp. 20-25 (in Russian).