Scheduling a single server in a two-machine flow shop

Computing (Vienna/New York)

Volumn 70, Issue 2, 2003, Pages 167-180

  Cheng, T C E ^a   Kovalyov, M Y ^b  

^a HONG KONG POLYTECHNIC UNIVERSITY   (Hong Kong)

^b BELARUSIAN STATE UNIVERSITY   (Belarus)

Author keywords

Algorithms; Batching; Dynamic programming; Scheduling

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; MACHINE SHOPS; POLYNOMIALS;

SINGLE SERVER; TWO-MACHINE FLOW SHOP;

SCHEDULING;

EID: 0041841602     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00607-002-1467-8     Document Type: Article

References (29)

1. Albers, S., Brucker, P.: The complexity of one-machine batching problems. Discrete Appl. Math. 47, 87-107 (1993).
2. Allahverdi, A., Gupta, J. N. D., Aldowaisan, T.: A review of scheduling research involving setup considerations. Omega 27, 219-239 (1999).
3. Baker, K. R.: Introduction to sequencing and scheduling. New York: Wiley 1974.
4. Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Weglarz, J.: Scheduling computer and manufacturing processes. Heidelberg: Springer 1996.
5. Brucker, P.: Scheduling algorithms. Heidelberg: Springer 1995.
6. Brucker, P., Dhaenens-Flipo, C., Knust, S., Kravchenko, S. A., Werner, F.: Complexity results for parallel machine problems with a single server. In: Extended Abstracts of Seventh International Workshop on Project Management and Scheduling, Osnabruck, Germany, April 17-19, 2000, pp 82-84.
7. Brucker, P., Gladky, A., Hoogeveen, J. A., Kovalyov, M. Y., Potts, C. N., Tautenhahn, T., van de Velde, S. L.: Scheduling a batching machine. Journal of Scheduling 1, 31-54 (1998).
8. Brucker, P., Knust, S., Wang, G.: Complexity results for flow-shop problems with a single server. In: Proc. 5th Int. Conf. on Optimization: Techniques and Applications, Li, D. (ed.), 153-167 (2001).
9. Brucker, P., Kovalyov, M. Y.: Single machine batch scheduling to minimize the weighted number of late jobs. Math. Methods Oper. Res. 43, 1-8 (1996).
10. Cheng, T. C. E., Wang, G., Sriskandarajah, C.: One-operator-two-machine flowshop scheduling problems with setup and dismounting times. Computers Oper. Res. 26, 715-730 (1999).
11. Coffman, Jr. E. G., (ed.): Computer and job-shop scheduling theory. New York: Wiley 1976.
12. Coffman, Jr. E. G., Yannakakis, M., Magazine, M. J., Santos, C.: Batch sizing and job sequencing on a single machine. Ann. Oper. Res. 26, 135-147 (1990).
13. Conway, R. W., Maxwell, W. L., Miller, L. W.: Theory of scheduling. Addison Wesley, Reading 1967.
14. Garey, M. R., Johnson, D. S.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Co., San Francisco 1979.
15. Glass, C., Shafransky, Y. M., Strusevich, V. A.: Scheduling for parallel dedicated machines with a single server. Naval Res. Logistics 47, 304-328 (1999).
16. Hall, N. G., Potts, C. N., Sriskandarajah, C.: Parallel machine scheduling with a common server. Discr. Appl. Math. 102, 223-243 (2000).
17. Hochbaum, D. S., Landy, D.: Scheduling with batching: minimizing the weighted number of tardy jobs. Oper. Res. Lett. 16, 79-86 (1994).
18. Kravchenko, S. A., Werner, F.: Parallel machine scheduling problems with a single server. Math. Comp. Modelling 26, 1-11 (1997).
19. Koulamas, C. P.: Scheduling on two parallel machines for minimizing machine interference. Working paper. Department of Decision Sciences and Information Systems. Florida International University 1993.
20. Kovalyov, M. Y.: A rounding technique to construct approximation algorithms for knapsack and partition type problems. Appl. Math. Comp. Sci. 6, 101-113 (1996).
21. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and scheduling: algorithms and complexity. In: Logistics of Production and Inventory, Handbooks in Operations Research and Management Science, Graves, S. C., Zikpkin, P. H., Rinnooy Kan, A. H. G. (eds.), vol. 4, North-Holland, Amsterdam, 445-522 (1993).
22. Moore, J. M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15, 102-109 (1968).
23. Pinedo, M., Chao, X.: Operation scheduling with applications in manufacturing and services. New York: Irwin/McGraw-Hill, 1999.
24. Potts, C. N., Kovalyov, M. Y.: Scheduling with batching: a review. Eur. J. Oper. Res. 120, 228-249 (2000).
25. Potts, C. N., Van Wassenhove, L. N.: Integrating scheduling with batching and lot-sizing: a review of algorithms and complexity. J. Oper. Res. Soc. 43, 395-406 (1992).
26. Sahni, S.: General techniques for combinatorial approximation. Oper. Res. 25, 920-936 (1977).
27. Tanaev, V. S., Gordon, V. S., Shafransky, Y. M.: Scheduling theory. Single-stage systems. Kluwer Academic Publisher, Dordrecht/Boston/London 1994.
28. Webster, S. T., Baker, K. R.: Scheduling groups of jobs on a single machine. Oper. Res. 43, 692-703 (1995).
29. Wagelmans, A. P. M., Gerodimos, A. E.: Improved dynamic programs for some batching problems involving the maximum lateness criterion. Oper. Res. Lett. 27, 109-118 (2000).