zbMATH — the first resource for mathematics

Scheduling with precedence constraints: Worst-case analysis of priority algorithms. (Abstract of thesis). (English) Zbl 1026.90507
90B35 Deterministic scheduling theory in operations research
Full Text: DOI
[1] DOI: 10.1023/A:1018917426360 · Zbl 0908.90178 · doi:10.1023/A:1018917426360
[2] Singh, Asia-Pacific J. Oper. Res. 17 pp 101– (2000)
[3] DOI: 10.1111/j.1475-3995.2000.tb00206.x · doi:10.1111/j.1475-3995.2000.tb00206.x
[4] Zinder, Preemptive scheduling on parallel processors with due-dates (2002) · Zbl 1080.90047
[5] Lawler, Deterministic and Stochastic Scheduling pp 101– (1998)
[6] DOI: 10.1287/opre.9.6.841 · doi:10.1287/opre.9.6.841
[7] DOI: 10.1287/moor.2.3.275 · Zbl 0397.90044 · doi:10.1287/moor.2.3.275
[8] DOI: 10.1016/S0167-6377(01)00077-3 · Zbl 0980.68015 · doi:10.1016/S0167-6377(01)00077-3
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.