References
- Agnetis, A., Pacciarelli, D. and Rossi, F. (1994) Batch scheduling in a two machine flow shop with limited buffer. Discrete Applied Mathematics in press.
- Crama, Y. and van de Klundert, J. (1994) Cyclic scheduling of identical parts in a robotic cell. Maastricht Research School of Economics of Technology and Organizations, working paper RM/0/94-014.
- Gilmore, P.C. and Gomory, R.E. (1964) Sequencing of a one-state variable machine: a solvable case of the traveling salesman problem. Operations Research, 12, 655–679.
- Hall, N.G., Kamoun, H. and Sriskandarajah, C. (1993a) Scheduling in robotic cells: two machine cells and identical parts. Working paper 93–56, College of Business, The Ohio State University.
- Hall, N.G., Kamoun, H. and Sriskandarajah, C. (1993b) Scheduling in robotic cells: large cells. Working paper 93–55, College of Business, The Ohio State University.
- Johnson, S.M. (1954) Optimal two- and three-stage production schedules with set-up times included. Naval Research Logistics Quarterly, 1, 61–68.
- Kise, H., Karuno, Y. and Matsumoto, H. (1993) Simultaneous optimization of tool allocation and scheduling for FMSs: an application of simulated annealing, in Takamori, T. and Tsuchiya, K. (eds). Robotics, Mechatronics and Manufacturing Systems, Elsevier, Amsterdam (North Holland), pp. 557–564.
- Kise, H., Shioyama, T. and Ibaraki, T. (1991) Automated two-machine flowshop scheduling: a solvable case. IIE Transactions, 23(1), 10–16.
- Papadimitriou, C.H. and Kanellakis, P.C. (1980) Flowshop scheduling with limited temporary storage. Journal of the Association for Computing Machinery, 27(3), 533–549.
- Sethi, S.P., Sriskandarajah, C., Sorger, G., Blazewicz, J. and Kubiak, W. (1992) Sequencing of parts and robot moves in a robotic cell. International Journal of Flexible Manufacturing Systems, 4, 331–358.
- Talavage, J. and Hannam, R.G. (1988) Flexible Manufacturing Systems in Practice, Marcel Dekker, New York.
- Wismer, D.A. (1972) Solution of the flowshop scheduling problem with no intermediate queues. Operations Research, 20, 689–697.