Unit-time scheduling problems with time dependent resources
From MaRDI portal
Publication:678109
DOI10.1007/BF02684434zbMath0870.68088MaRDI QIDQ678109
Gerhard J. Woeginger, Thomas Tautenhahn
Publication date: 7 September 1997
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02684434
68Q25: Analysis of algorithms and problem complexity
90B35: Deterministic scheduling theory in operations research
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
Optimizing resource-constrained project scheduling problem considering the reliability function, Four decades of research on the open-shop scheduling problem to minimize the makespan, Open shop scheduling problems with conflict graphs, Scheduling the two-machine open shop problem under resource constraints for setting the jobs
Cites Work
- Unnamed Item
- Unnamed Item
- Minimizing the total completion time in a unit-time open shop with release times
- A linear time algorithm for restricted bin packing and scheduling problems
- A preemptive open shop scheduling problem with one resource
- Integer Programming with a Fixed Number of Variables
- Algorithm 520: An Automatic Revised Simplex Method for Constrained Resource Network Scheduling [H]
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Two-Machine Open Shops with Renewable Resources
- The complexity of satisfiability problems