A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile
From MaRDI portal
Publication:1121783
DOI10.1016/0305-0548(89)90026-9zbMath0674.90053OpenAlexW2061488772MaRDI QIDQ1121783
Cheng-I. Yang, Jia-Shung Wang, Richard Chia-Tung Lee
Publication date: 1989
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(89)90026-9
Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Minimizing completion time for a class of scheduling problems
- NP-complete scheduling problems
- Random Trees and the Analysis of Branch and Bound Procedures
- Scheduling precedence graphs of bounded height
- Multiprocessor Scheduling of Unit-Time Jobs with Arbitrary Release Times and Deadlines
- Combinatorially implosive algorithms
- Critical Path Scheduling with Resource and Processor Constraints
- Subgraph error-correcting isomorphisms for syntactic pattern recognition
- Scheduling Equal-Length Tasks Under Treelike Precedence Constraints to Minimize Maximum Lateness
- Branch-and-Bound Methods: A Survey
This page was built for publication: A branch-and-bound algorithm to solve the equal-execution-time job scheduling problem with precedence constraint and profile