Scheduling with discrete resource constraints

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Volumn , Issue , 2004, Pages 23-1-23-18

  Błażewicz, Jacek ^a   Brauner, N ^b   Finke, G ^b  

^a POZNAN UNIVERSITY OF TECHNOLOGY   (Poland)

^b Équipe VAlidation Spécification et COnstruction de logiciels   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84879501858     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (39)

1. Blażewicz, J., Lenstra, J. K., and Rinnooy Kan, A. H. G., Scheduling subject to resource constraints: classification and complexity, Discrete Appl. Math., 5, 11, 1983.
2. Garey, M. R. and Johnson, D. S., Complexity results for multiprocessor scheduling under resource constraints, SIAM J. Comput., 4, 397, 1975.
3. Blażewicz, J., Barcelo, J., Kubiak, W., andRöck, H., Scheduling tasks on two processorswith deadlines and additional resources, Euro. J. Oper. Res., 26, 364, 1986.
4. Blażewicz, J., Cellary, W., Słowiński, R., and Węglarz, J., Scheduling under Resource Constraints: Deterministic Models, J. Baltzer, Basel, 1986.
5. Kariv, O. and Even, S., An O(n2) algorithm for maximum matching in general graphs, in Proc. 16th Ann. IEEE Symp. on Found. Comp. Sci., 1975, 100.
6. Blażewicz, J., Complexity of computer scheduling algorithms under resource constraints, in Proc. I Meeting AFCET—SMF on Appl. Mathe., Palaiseau, 1978, 169.
7. Blażewicz, J. and Ecker, K., A linear time algorithm for restricted bin packing and scheduling problems, Oper. Res. Lett., 2, 80, 1983.
8. Lenstra, H. W., Jr., Integer programming with a fixed number of variables, Math. Oper. Res., 8, 538, 1983.
9. Blażewicz, J., Kubiak, W., and Szwarcfiter, J., Scheduling independent fixed-type tasks, in Słowiński, R. and Węglarz, J., (eds.), Advances in Project Scheduling, Elsevier, Amsterdam, 1989, 225.
10. Coffman, E. G., Jr., Garey, M. R., and Johnson, D. S., Approximation algorithms for bin-packing—an updated survey, in Ausiello, G., Lucertini, M., and Serafini, P. (eds.), Algorithms Design for Computer System Design, Springer, Vienna, 1984, 49.
11. Krause, K. L., Shen, V. Y., and Schwetman, H. D., Analysis of several task-scheduling algorithms for a model of multiprogramming computer systems, J. Assoc. Comput. Mach., 22, 522, 1975. Erratum: J. Assoc. Comput. Mach., 24, 527, 1977.
12. Röck, H. and Schmidt, G., Machine aggregation heuristics in shop scheduling, Methods Oper. Res., 45, 303, 1983.
13. Garey, M. R. and Graham, R. L., Bounds for multiprocessor scheduling with resource constraints, SIAM J. Comput., 4, 187, 1975.
14. McNaughton, R., Scheduling with deadlines and loss functions, Manage. Sci., 12, 1, 1959.
15. Węglarz, J., Blażewicz, J., Cellary, W. and Slowiński, R., An automatic revised simplex method for constrained resource network scheduling, ACM Trans. Math. Software, 3, 295, 1977.
16. Blażewicz, J. and Finke, G., Scheduling with resource management in manufacturing systems, Euro. J. Oper. Res., 76, 1, 1994.
17. Crama, Y., Kolen, A. W. J., Oerlemans, A. G., and Spieksma, F. C. R., Minimizing the number of tool switches on a flexible machine, Int. J. Flexible Manufac. Syst., 6 (1), 33, 1994.
18. Privault, C. and Finke, G., Modelling a tool switching problem on a single NC-machine, J. Intell. Manufac., 6, 87, 1995.
19. Privault, C., and Finke, G., k-server problems with bulk requests: an application to tool switching in manufacturing, Annals Oper. Res., 96, 255, 2000.
20. Manasse, M. S., McGeogh, L. A., and Sleater, D. D., Competitive algorithms for server problems, J. Algor., 11, 208, 1990.
21. McGeogh, L. A. and Sleater, D. D., A strongly competitive randomized paging algorithm, Algorithmica, 6, 816, 1991.
22. Belady, L. A., A study of replacement algorithms for virtual storage computers, IBM Syst. J., 5, 78, 1966.
23. Tang, C. S. and Denardo, E. V., Models arising from a flexible manufacturing machine, part 1:Minimization of the number of tool switches, Oper. Res., 36, 767, 1988.
24. Mattson, R., Gecsei, J., Slutz, D. R., and Traiger, I. L., Evaluation techniques for storage hierarchies, IBM Sys. J., 2, 78, 1970.
25. Chrobak, M., Karloff, H., Payne, T., and Vishwanathan, S., New results on server problems, SIAM J. Discrete Math., 4 (2), 172, 1991.
26. Fiat, A., Karp, R. M., Luby, M., McGeogh, L. A., Sleater, D. D., and Young, N. E., Competitive paging algorithms, J. Algor., 12, 685, 1991.
27. Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S. A., andWerner, F., Complexity results for parallel machine problems with a single server, J. Scheduling, 5, 429, 2002.
28. Asfahl, C. R., Robots and Manufacturing Automation, JohnWiley & Sons, New York, NY, 1985.
29. Sethi, S. P., Sriskandarajah, C., Sorger, G., Blazewicz, J., and Kubiak, W., Sequencing of parts and robot moves in a robotic cell, Int. J. FMS, 4, 331, 1992.
30. Su, Q. andChen, F. F., Optimally sequencing ofdouble-gripper gantry robotmoves in tightly-coupled serial production systems, Technical Report, Florida International University, 1995.
31. Hall, N. G., Kamoun, H., and Sriskandarajah, C., Scheduling in robotic cells: Classification, two and three machine cells, Oper. Res., 45, 421, 1997.
32. Crama, Y., Kats, V., van de Klundert, J., and Levner, E., Cyclic scheduling in robotic flowshops, Annals Oper. Res. Math. Indus. Sys. 96, 97, 2000.
33. Crama, Y. and van de Klundert, J., Cyclic scheduling in 3-machine robotic flow shops, J. Scheduling, 2, 35, 1999.
34. Crama, Y. and van de Klundert, J., Cyclic scheduling of identical parts in a robotic cell, Oper. Res., 45, 952, 1997.
35. Brauner, N. and Finke, G., On a conjecture about robotic cells: new simplified proof for the threemachine case, J. Info. Sys. Oper. Res. —INFOR, 37, 20, 1999.
36. Brauner, N. and Finke, G., Cycles and permutations in robotic cells, Math. Comput Model., 34, 565, 2001.
37. Brauner, N., Finke, G., and Kubiak, W., Complexity of one-cycle robotic flow-shops, J. Scheduling, 6, 355, 2003.
38. Brauner, N., Crama, Y., and Finke G., One-unit production cycles in balanced robotic cells, in Proc. IEPM’01, Int. Conf. Ind. Eng. Product. Manag., Quebec City, 2001, 508.
39. Dawande, M., Sriskandarajah, C., and Sethi, S., Onthroughput maximization in constant travel-time robotic cells, Manufac. Serv. Oper. Manag., 4(4), 296, 2003.