Exact and approximation algorithms for the operational fixed interval scheduling problem
From MaRDI portal
Recommendations
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
- On the optimality of exact and approximation algorithms for scheduling problems
- On the approximability of an interval scheduling problem
- Approximating an interval scheduling problem
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Approximation Algorithms for Scheduling Problems with Exact Delays
- Approximation algorithms for some discrete-continuous scheduling problems
- Approximation Algorithms for Fixed Job Schedule Problems
- Approximation Algorithms for the Job Interval Selection Problem and Related Scheduling Problems
- Approximation algorithms for problems in scheduling with set-ups
Cites work
- A decomposition theorem for partially ordered sets
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- An Optimal Solution for the Channel-Assignment Problem
- Approximation Algorithms for Fixed Job Schedule Problems
- Games of Boldness, Where the Player Performing the Hardest Task Wins
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- License class design: Complexity and algorithms
- Minimal Resources for Fixed and Variable Job Schedules
- On the computational complexity of (maximum) class scheduling
- On the facial structure of set packing polyhedra
- Scheduling jobs with fixed start and end times
- The Fixed Job Schedule Problem with Spread-Time Constraints
- The Fixed Job Schedule Problem with Working-Time Constraints
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
Cited in
(28)- On the computational complexity of (maximum) class scheduling
- Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times
- Flow-based formulations for operational fixed interval scheduling problems with random delays
- A successful three-phase metaheuristic for the shift minimization personal task scheduling problem
- Inverse interval scheduling via reduction on a single machine
- Stability and fairness in the job scheduling problem
- Runway sequencing with holding patterns
- A survey on scheduling problems with due windows
- A metaheuristic for the fixed job scheduling problem under spread time constraints
- Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
- Decomposition algorithms for the interval scheduling problem
- Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm
- Working time constraints in operational fixed job scheduling
- A fixed job scheduling problem with machine-dependent job weights
- Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals
- Increasing the revenue of self-storage warehouses by optimizing order scheduling
- A constraint-based approach for the shift design personnel task scheduling problem with equity
- Tactical fixed job scheduling with spread-time constraints
- Optimal interval scheduling with a resource constraint
- Spread time considerations in operational fixed job scheduling
- A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem
- Coordinated scheduling of production and delivery with production window and delivery capacity constraints
- Exact and Approximation Algorithms for the Tactical Fixed Interval Scheduling Problem
- On the complexity of interval scheduling with a resource constraint
- A Lagrangian relaxation algorithm for stochastic fixed interval scheduling problem with non-identical machines and job classes
- Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- Two-machine interval shop scheduling with time lags
This page was built for publication: Exact and approximation algorithms for the operational fixed interval scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1388883)
