Interval scheduling on identical machines
From MaRDI portal
Publication:2564884
DOI10.1007/BF00121680zbMath0866.90069MaRDI QIDQ2564884
Hamilton Emmons, Khalid I. Bouzina
Publication date: 7 January 1997
Published in: Journal of Global Optimization (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (31)
Working time constraints in operational fixed job scheduling ⋮ A fixed job scheduling problem with machine-dependent job weights ⋮ A constraint-based approach for the shift design personnel task scheduling problem with equity ⋮ Optimal interval scheduling with a resource constraint ⋮ Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times ⋮ Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Inverse interval scheduling via reduction on a single machine ⋮ A metaheuristic for the fixed job scheduling problem under spread time constraints ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ iGreen: green scheduling for peak demand minimization ⋮ Resource allocation with time intervals ⋮ Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times ⋮ Fixed interval scheduling with third‐party machines ⋮ Scheduling to maximize the weighted number of on-time jobs on parallel machines with bounded job-rejection ⋮ Scheduling to Maximize the Number of Just-in-Time Jobs: A Survey ⋮ The just-in-time scheduling problem in a flow-shop scheduling system ⋮ Maximizing the weighted number of just-in-time jobs in~several two-machine scheduling systems ⋮ Online interval scheduling with a bounded number of failures ⋮ On the complexity of container stowage planning problems ⋮ Competitive algorithms for multistage online scheduling ⋮ Interval scheduling maximizing minimum coverage ⋮ Interval scheduling on related machines ⋮ On the complexity of interval scheduling with a resource constraint ⋮ Just-in-time scheduling with controllable processing times on parallel machines ⋮ Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ Multistage interval scheduling games ⋮ Online interval scheduling to maximize total satisfaction ⋮ Models and algorithms for energy-efficient scheduling with immediate start of jobs ⋮ Approximating Interval Selection on Unrelated Machines with Unit-Length Intervals and Cores ⋮ Spread time considerations in operational fixed job scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic approach to the bus driver scheduling problem
- Scheduling jobs with fixed start and end times
- On the computational complexity of (maximum) class scheduling
- The Fixed Job Schedule Problem with Working-Time Constraints
- When Is the Classroom Assignment Problem Hard?
- Games of Boldness, Where the Player Performing the Hardest Task Wins
This page was built for publication: Interval scheduling on identical machines
