Pages that link to "Item:Q2564884"
From MaRDI portal
The following pages link to Interval scheduling on identical machines (Q2564884):
Displayed 31 items.
- 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)
- Interval scheduling maximizing minimum coverage (Q528573) (← links)
- Interval scheduling on related machines (Q547142) (← links)
- On the complexity of interval scheduling with a resource constraint (Q551193) (← links)
- Resource allocation with time intervals (Q606987) (← links)
- Fixed interval scheduling: models, applications, computational complexity and algorithms (Q859906) (← links)
- Just-in-time scheduling with controllable processing times on parallel machines (Q975765) (← links)
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times (Q1651660) (← links)
- iGreen: green scheduling for peak demand minimization (Q1675631) (← links)
- Online interval scheduling with a bounded number of failures (Q1707823) (← links)
- Competitive algorithms for multistage online scheduling (Q1753459) (← links)
- A simple and effective hybrid genetic search for the job sequencing and tool switching problem (Q2027021) (← links)
- Inverse interval scheduling via reduction on a single machine (Q2158006) (← links)
- Multistage interval scheduling games (Q2283299) (← links)
- Online interval scheduling to maximize total satisfaction (Q2285162) (← links)
- Models and algorithms for energy-efficient scheduling with immediate start of jobs (Q2317131) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
- Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems (Q2434268) (← links)
- On the complexity of container stowage planning problems (Q2449077) (← links)
- A metaheuristic for the fixed job scheduling problem under spread time constraints (Q2654393) (← links)
- Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores (Q2835690) (← links)
- Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey (Q2958665) (← links)
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm (Q3055658) (← links)
- Working time constraints in operational fixed job scheduling (Q3163130) (← links)
- A fixed job scheduling problem with machine-dependent job weights (Q3183761) (← links)
- Spread time considerations in operational fixed job scheduling (Q3432669) (← links)
- Fixed interval scheduling with third‐party machines (Q6065340) (← links)
- Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection (Q6103749) (← links)