Scheduling with multiple-job-on-one-processor pattern

IIE Transactions (Institute of Industrial Engineers)

Volumn 30, Issue 5, 1998, Pages 433-445

  Li, Chung Lun ^a   Cai, Xiaoqiang ^b   Lee, Chung Yee ^c  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^c Texas AandM University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; DECISION MAKING; ERROR ANALYSIS; HEURISTIC METHODS; INVENTORY CONTROL; MATHEMATICAL MODELS; OPTIMAL CONTROL SYSTEMS; PROBLEM SOLVING; PROCESS CONTROL; PRODUCTION CONTROL; RESOURCE ALLOCATION; SCHEDULING;

MULTIPLE JOB ON ONE PROCESSOR PATTERNS; WORST CASE ERROR BOUNDS;

FLEXIBLE MANUFACTURING SYSTEMS;

EID: 0032072364     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179808966484     Document Type: Article

References (27)

1. Krawczyk, H., and Kubale, M., (1985) An approximation algorithm for diagnostic test scheduling in multiprocessor systems. IEEE Transactions on Computers, C-34, 869–872.
2. Kubale, M., (1987) The complexity of scheduling independent two-processor tasks on dedicated processors. Information Processing Letters, 24, 141–147.
3. Kubale, M., (1996) Preemptive and nonpreemptive scheduling of biprocessor tasks on dedicated processors. European Journal of Operational Research, 94 242–251.
4. Blazewicz, J., DelPOlmo, P., Drozdowski, M., and Speranza, M. G., (1992) Scheduling multiprocessor tasks on three dedicated processors. Information Processing Letters, 41, 275–280.
5. Hoogeveen, J.A., van de Velde, S.L., and Veltman, B., (1994) Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Applied Mathematics, 55, 259–272.
6. Blazewicz, J., Drabowski, M., and Weglarz, J., (1986) Scheduling multiprocessor tasks to minimize schedule length. IEEE Transactions on Computers, C-35, 389–393.
7. Du, J., and Leung, J.Y.-T., (1989) Complexity of scheduling parallel task systems. SI AM Journal of Discrete Mathematics, 2, 473–487.
8. Bianco, L., Blazewicz, J., DeH'Olmo, P., and Drozdowski, M., (1993) Preemptive scheduling of multiprocessor tasks on the dedicated processor system subject to minimal lateness. Information Processing Letters, 46, 109–113.
9. Bianco, L., Blazewicz, J., DelPOlmo, P,. and Drozdowski, M., (1997) Preemptive multiprocessor task scheduling with release times and time windows. Annals of Operations Research, 70, 43–55.
10. Brucker, P., (1995) Scheduling Algorithms, Springer-Verlag, New York, NY.
11. Brucker, P., and Kramer, A., (1995) Shop scheduling problems with multiprocessor tasks on dedicated processors. Annals of Operations Research, 57, 13–27.
12. Brucker, P., and Kramer, A., (1996) Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems. European Journal of Operational Research, 90, 214–226.
13. Cai, X., Lee, C. Y., and Li, C.L., (1998) Minimizing total flow time in multiprocessor task systems with prespecified processor allocations, Naval Research Logistics, forthcoming.
14. Lee, C.-Y., and Cai, X., (1996) Scheduling multiprocessor tasks without prespecified processor allocations. Working paper, Department of Industrial Engineering, Texas A and M University College Station, TX.
15. Plehn, J., (1990) Preemptive scheduling of independent jobs with release times and deadlines on a hypercube. Information Processing Letters, 34, 161–166.
16. Drozdowski, M., (1996) Scheduling multiprocessor tasks - an overview. European Journal of Operational Research, 94, 215–230.
17. Lee, C.-Y., Lei, L., and Pinedo, M., (1997) The current trend of deterministic scheduling. Annals of Operations Research, 70, 1–41.
18. Garey, M.R., and Johnson, D.S., (1979) Computers and Intractability A Guide to the Theory of NP-Completeness, Freeman. San Francisco, CA.
19. Lee, C.-Y., (1991) Parallel machines scheduling with nonsimulta-neous machine available time. Discrete Applied Mathematics, 30, 53–61.
20. Lee, C.-Y., (1996) Machine scheduling with an availability constraint. Journal of Global Optimization, 9, 395–416.
21. Lee, C.-Y., (1997) Minimizing the makespan in the two-machine flowshop scheduling problem with an availability constraint. Operations Research Letters, 20, 129–139.
22. Adiri, L., Bruno, J., Frostig, E., Rinnooy Kan, A. H. G., (1989) Single machine flow-time scheduling with a single breakdown. Acta Informatica, 26, 679–696.
23. Mosheiov, G., (1994) Minimizing the sum of job completion times on capacitated parallel machines. Mathematical and Computer Modelling, 20, 91–99.
24. Schmidt, G., (1988) Scheduling independent tasks with deadlines on semi-identical processors. Journal of the Operational Research Society, 39, 271–277.
25. Johnson, D. S., Demers, A., Ullman, J. D., Garey, M. R., and Graham, R. L., (1974) Worst-case performance bounds for simple one-dimensional packing algorithms. SIAM Journal on Computing, 3, 299–325.
26. Baker, B. S., (1985) A new proof for the first-fit decreasing bin packing algorithm. Journal of Algorithms, 6, 49–70.
27. Simchi-Levi, D., (1994) New worst-case results for the bin-packing problem. Naval Research Logistics, 41, 579–585.