Pages that link to "Item:Q1179005"
From MaRDI portal
The following pages link to On the computational complexity of (maximum) class scheduling (Q1179005):
Displaying 22 items.
- Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- On the complexity of interval scheduling with a resource constraint (Q551193) (← links)
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- On the complexity of adjacent resource scheduling (Q880528) (← links)
- Methods to solve multi-skill project scheduling problem (Q926572) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- Hybrid heuristics for the capacitated lot sizing and loading problem with setup times and overtime decisions (Q1303540) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- An approximation algorithm for the license and shift class design problem (Q1328603) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- Matching supply and demand in a sharing economy: classification, computational complexity, and application (Q1999391) (← links)
- Interval scheduling on identical machines (Q2564884) (← links)
- Working time constraints in operational fixed job scheduling (Q3163130) (← links)
- A fixed job scheduling problem with machine-dependent job weights (Q3183761) (← links)
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem (Q3598682) (← links)
- The optimal cost chromatic partition problem for trees and interval graphs (Q6550551) (← links)
- A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes (Q6551145) (← links)
