Complexity Results for Single-Machine Problems with Positive Finish-Start Time-Lags

Computing (Vienna/New York)

Volumn 63, Issue 4, 1999, Pages 299-316

  Brucker, P ^a   Knust, S ^a  

^a UNIVERSITY OF OSNABRÜCK   (Germany)

Author keywords

Complexity results; Flow shop problem; Single machine; Time lags

Indexed keywords

EID: 0037513525     PISSN: 0010485X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s006070050036     Document Type: Article

References (27)

1. Brucker, P.: Scheduling algorithms, 2nd ed. Berlin Heidelberg New York Tokyo: Springer, 1998.
2. Brucker, P., Garey, M. R., Johnson, D. S.: Scheduling equal-length tasks under tree-like precedence constraints to minimize maximum lateness. Math. Oper. Res. 2, 275-284 (1977).
3. Brucker P., Hilbig, T., Hurink, J.: A branch & bound algorithm for a single machine scheduling problem with positive and negative time-lags. Disc. Appl. Math. 94, 77-99 (1999).
4. Bruno, J., Jones, J. W., So, K.: Deterministic scheduling with pipelined processors. IEEE Trans. Comput. C-29, 308-316 (1980).
5. Coffman, E. G. Jr., Graham, R. L.: Optimal scheduling for two-processor systems. Acta Informat. 1, 200-213 (1972).
6. Du, J., Leung, J. Y.-T.: Minimizing total tardiness on one machine is NP-hard. Math. Oper. Res. 15, 483-495 (1990).
7. Du, J., Leung, J. Y.-T., Young, G. H.: Scheduling chain-structured tasks to minimize makespan and mean flow time. Inform. Comput. 92, 219-236 (1991).
8. Finta, L., Liu, Z.: Single machine scheduling subject to precedence delays. Disc. Appl. Math. 70, 247-266 (1996).
9. Habib, M., Möhring, R.H., Steiner, G.: Computing the bump number is easy. Order 5, 107-129 (1988).
10. Karp, R. M.: Reducibility among combinatorial problems. In: Complexity of computer computations (Miller, R. E., Thatcher, J. W., eds.), pp. 85-103. New York: Plenum Press, 1972.
11. Lawler, E. L.: Optimal sequencing of a single machine subject to precedence constraints. Management Sci. 19, 544-546 (1973).
12. Lawler, E. L.: Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Ann. Discrete Math. 2, 75-90 (1978).
13. Lawler, E. L.: Preemptive scheduling of precedence-constrained jobs on parallel machines. In: Deterministic and stochastic scheduling (Dempster, M. A. H., Lenstra, J. K., Rinnooy Kan, A. H. G., eds.), pp. 101-123. Dordrecht: Reidel, 1982.
14. Lawler, E. L., Lenstra, J. K., Rinnooy Kan, A. H. G., Shmoys, D. B.: Sequencing and scheduling: algorithms and complexity. In: Handbooks in operations research and management science, Vol. 4: Logistic of production and inventory (Graves, S. C., Rinnooy Kan, A. H. G., Zipkin, P., eds.), pp. 445-552. Amsterdam: North-Holland, 1993.
15. Lenstra, J. K. (n.d.) Unpublished.
16. Lenstra, J. K., Rinnooy Kan, A. H. G., Brucker, P.: Complexity of machine scheduling problems. Ann. Discr. Math. 1, 343-362 (1977).
17. Lenstra, J. K., Rinnooy Kan, A. H. G.: Complexity results for scheduling chains on a single machine. Eur. J. Oper. Res. 4, 270-275 (1980).
18. Leung, J. Y.-T., Young, G. H.: Minimizing total tardiness on a single machine with precedence constraints. ORSA J. Comput. 2, 346-352 (1990).
19. Moore, J. M.: An n job, one machine sequencing algorithm for minimizing the number of late jobs. Management Sci. 15, 102-109 (1968).
20. Muntz, R. R., Coffman, E. G. Jr.: Preemptive scheduling of real time tasks on multiprocessor systems, J. Assoc. Comput. Mach. 17, 324-338 (1970).
21. Schäffer, A. A., Simons, B.: Computing the bump number with techniques from two-processor scheduling. Order 5, 131-141 (1988).
22. Tanaev, V. S., Sotskov, Y. N., Strusewich, V. A.: Scheduling theory: multi-stage systems. Boston: Kluwer, 1994.
23. Timkovsky, V. G.: Is a unit-time job shop not easier than identical parallel machines? Disc. Appl. Math. 85, 149-162 (1998).
24. Timkovsky, V. G.: Scheduling unit-time operation jobs on identical parallel machines and in a flow shop: complexity and correlation. Technical Report. Dept. of Comp. Sc. and Systems, McMaster Univ. Hamilton, 1998.
25. Ullman, J. D.: Complexity of sequencing problems. In: Computer and job/shop scheduling theory (Coffman, E. G. Jr., ed.), pp. 139-164. New York: Wiley, 1976.
26. Wikum, E. D., Llewellyn, D. C., Nemhauser, G. L.: One-machine generalized precedence constrained scheduling problems. OR Letters 16, 87-99 (1994).
27. Yu, W.: The two-machine flow shop problem with delays and the one-machine total tardiness problem. Ph.D. thesis, Technische Universiteit Eindhoven, 1996.