Pages that link to "Item:Q1098765"
From MaRDI portal
The following pages link to Scheduling jobs with fixed start and end times (Q1098765):
Displayed 38 items.
- Improving LTL truck load utilization on line (Q531465) (← links)
- Interval scheduling on related machines (Q547142) (← links)
- A stronger model of dynamic programming algorithms (Q547305) (← links)
- On the complexity of interval scheduling with a resource constraint (Q551193) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- On the computational complexity of (maximum) shift class scheduling (Q684343) (← links)
- Efficient job scheduling algorithms with multi-type contentions (Q813335) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Bicriteria scheduling for contiguous and non contiguous parallel tasks (Q940878) (← links)
- Characterizing sets of jobs that admit optimal greedy-like algorithms (Q964871) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Resource allocation in bounded degree trees (Q1024215) (← links)
- On the computational complexity of (maximum) class scheduling (Q1179005) (← links)
- Minimum loss scheduling problems (Q1197941) (← links)
- License class design: Complexity and algorithms (Q1207538) (← links)
- A graph colouring model for assigning a heterogeneous workforce to a given schedule (Q1266545) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- Pre-processing techniques for resource allocation in the heterogeneous case (Q1296109) (← links)
- Algorithms for preemptive scheduling of different classes of processors to do jobs with fixed times (Q1310017) (← links)
- The \(k\)-track assignment problem (Q1319043) (← links)
- Scheduling jobs with release times on a machine with finite storage (Q1330556) (← links)
- On-line scheduling of jobs with fixed start and end times (Q1331962) (← links)
- Maximizing the value of a space mission (Q1342007) (← links)
- An analysis of shift class design problems (Q1342640) (← links)
- Scheduling jobs within time windows on identical parallel machines: New model and algorithms (Q1388825) (← links)
- Exact and approximation algorithms for the operational fixed interval scheduling problem (Q1388883) (← links)
- Sharing video on demand (Q1399105) (← links)
- On universally easy classes for NP-complete problems. (Q1401418) (← links)
- An integrated dispatching model for rail yards operations. (Q1423441) (← links)
- On the \(k\)-coloring of intervals (Q1893157) (← links)
- The \(k\)-Track assignment problem on partial orders (Q2464438) (← links)
- AFSCN scheduling: how the problem and solution have evolved (Q2473179) (← links)
- Runway sequencing with holding patterns (Q2482798) (← links)
- Interval scheduling on identical machines (Q2564884) (← links)
- Pricing and scheduling decisions with leadtime flexibility (Q2576254) (← links)
- DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM (Q3052722) (← links)
- A fixed job scheduling problem with machine-dependent job weights (Q3183761) (← links)
- “Rent-or-Buy” Scheduling and Cost Coloring Problems (Q5458824) (← links)