A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations
From MaRDI portal
Publication:1333456
DOI10.1016/0377-2217(94)90368-9zbMath0809.90074MaRDI QIDQ1333456
Pei-Chann Chang, Yen Shean Jiang
Publication date: 3 April 1995
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90368-9
artificial intelligence; sequencing; precedence relations; parallel processor scheduling; state-space search approach
90B35: Deterministic scheduling theory in operations research
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A state-of-the-art review of parallel-machine scheduling research
- Optimal assignment of task modules with precedence for distributed processing by graph matching and state-space search
- NP-complete scheduling problems
- Optimal scheduling for two-processor systems
- A New Algorithm for Preemptive Scheduling of Trees
- Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems
- An Almost-Linear Algorithm for Two-Processor Scheduling
- Scheduling Opposing Forests
- An Almost-Optimal Algorithm for the Assembly Line Scheduling Problem
- Optimal Preemptive Scheduling on Two-Processor Systems
- Optimal Sequencing of Two Equivalent Processors