A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations

DOI10.1016/0377-2217(94)90368-9zbMath0809.90074OpenAlexW2034319651MaRDI QIDQ1333456

Yen Shean Jiang, Pei-Chann Chang

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

zbMATH Keywords

artificial intelligencesequencingprecedence relationsparallel processor schedulingstate-space search approach

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

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

This page was built for publication: A state-space search approach for parallel processor scheduling problems with arbitrary precedence relations