×

zbMATH — the first resource for mathematics

Preemptive scheduling on parallel processors with due dates. (English) Zbl 1080.90047

MSC:
90B35 Deterministic scheduling theory in operations research
68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
PDF BibTeX XML Cite
Full Text: DOI
References:
[1] DOI: 10.1137/S0097539790181889 · Zbl 0827.90069 · doi:10.1137/S0097539790181889
[2] DOI: 10.1007/978-3-540-24804-0 · doi:10.1007/978-3-540-24804-0
[3] DOI: 10.1287/moor.2.3.275 · Zbl 0397.90044 · doi:10.1287/moor.2.3.275
[4] DOI: 10.1007/BF00288685 · Zbl 0248.68023 · doi:10.1007/BF00288685
[5] DOI: 10.1007/s00236-003-0119-6 · Zbl 1060.68014 · doi:10.1007/s00236-003-0119-6
[6] DOI: 10.1145/321958.321967 · Zbl 0338.68048 · doi:10.1145/321958.321967
[7] DOI: 10.1007/s10107-002-0361-7 · Zbl 1023.90026 · doi:10.1007/s10107-002-0361-7
[8] DOI: 10.1137/0206037 · Zbl 0374.90031 · doi:10.1137/0206037
[9] DOI: 10.1007/978-94-009-7801-0_6 · doi:10.1007/978-94-009-7801-0_6
[10] Lawler E. L., Logistics of Production and Inventory (1993)
[11] DOI: 10.1287/mnsc.6.1.1 · Zbl 1047.90504 · doi:10.1287/mnsc.6.1.1
[12] Mokotoff E., Asia-Pacific Journal of Operational Research 18 pp 193–
[13] DOI: 10.1016/j.orl.2004.06.002 · Zbl 1099.90022 · doi:10.1016/j.orl.2004.06.002
[14] DOI: 10.1109/T-C.1969.222573 · Zbl 0184.20504 · doi:10.1109/T-C.1969.222573
[15] DOI: 10.1145/321574.321586 · Zbl 0216.49702 · doi:10.1145/321574.321586
[16] Parker R. G., Deterministic Scheduling Theory (1995)
[17] DOI: 10.1111/j.1475-3995.2000.tb00206.x · doi:10.1111/j.1475-3995.2000.tb00206.x
[18] Singh G., Asia Pacific Journal of Operational Research 17 pp 101–
[19] DOI: 10.1016/S0022-0000(75)80008-0 · Zbl 0313.68054 · doi:10.1016/S0022-0000(75)80008-0
[20] DOI: 10.1023/A:1018917426360 · Zbl 0908.90178 · doi:10.1023/A:1018917426360
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.