Pages that link to "Item:Q1098765"
From MaRDI portal
The following pages link to Scheduling jobs with fixed start and end times (Q1098765):
Displaying 50 items.
- A linear time algorithm to compute a maximum weighted independent set on cocomparability graphs (Q264186) (← links)
- A simple optimal algorithm for scheduling variable-sized requests (Q293470) (← links)
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals (Q322736) (← links)
- Increasing the revenue of self-storage warehouses by optimizing order scheduling (Q322833) (← links)
- A constraint-based approach for the shift design personnel task scheduling problem with equity (Q336540) (← links)
- Optimal interval scheduling with a resource constraint (Q337149) (← links)
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← links)
- The just-in-time scheduling problem in a flow-shop scheduling system (Q421784) (← links)
- Toward a model for backtracking and dynamic programming (Q430838) (← links)
- Algorithms for large scale shift minimisation personnel task scheduling problems (Q439608) (← links)
- Interval scheduling maximizing minimum coverage (Q528573) (← links)
- 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)
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals (Q727980) (← links)
- Efficient job scheduling algorithms with multi-type contentions (Q813335) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Two-machine interval shop scheduling with time lags (Q892834) (← 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)
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times (Q1651660) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Online C-benevolent job scheduling on multiple machines (Q1744621) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- On the \(k\)-coloring of intervals (Q1893157) (← links)
- Hybrid differential evolution optimisation for Earth observation satellite scheduling with time-dependent earliness-tardiness penalties (Q1992511) (← links)
- Matching supply and demand in a sharing economy: classification, computational complexity, and application (Q1999391) (← links)
