Scheduling Tasks with AND/OR Precedence Constraints
- 1 August 1995
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 24 (4) , 797-810
- https://doi.org/10.1137/s0097539791218664
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Guaranteeing deadlines in MAFTPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Greed in resource schedulingActa Informatica, 1991
- Scheduling periodic jobs that allow imprecise resultsIEEE Transactions on Computers, 1990
- AND/OR graph representation of assembly plansIEEE Transactions on Robotics and Automation, 1990
- Scheduling Unit–Time Tasks with Arbitrary Release Times and DeadlinesSIAM Journal on Computing, 1981
- Bin packing: Maximizing the number of pieces packedActa Informatica, 1978
- Two-Processor Scheduling with Start-Times and DeadlinesSIAM Journal on Computing, 1977
- Bounds on Multiprocessing Timing AnomaliesSIAM Journal on Applied Mathematics, 1969
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late JobsManagement Science, 1968
- Parallel Sequencing and Assembly Line ProblemsOperations Research, 1961