Exact and approximation algorithms for the operational fixed interval scheduling problem
From MaRDI portal
Publication:1388883
DOI10.1016/0377-2217(93)E0335-UzbMath0905.90105OpenAlexW2143702272MaRDI QIDQ1388883
Luk N. Van Wassenhove, Leo G. Kroon, Marc Salomon
Publication date: 11 June 1998
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0335-u
heuristicsinteger programmingLagrangean relaxationassignment problemjob schedulingjob scheduling problemoperational fixed interval scheduling
Related Items (23)
Working time constraints in operational fixed job scheduling ⋮ A survey on scheduling problems with due windows ⋮ 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 fixed job scheduling problem with machine-dependent job weights ⋮ 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 ⋮ Distributionally robust fixed interval scheduling on parallel identical machines under uncertain finishing times ⋮ Inverse interval scheduling via reduction on a single machine ⋮ A metaheuristic for the fixed job scheduling problem under spread time constraints ⋮ Two-machine interval shop scheduling with time lags ⋮ Coordinated scheduling of production and delivery with production window and delivery capacity constraints ⋮ Runway sequencing with holding patterns ⋮ On the complexity of interval scheduling with a resource constraint ⋮ Stability and fairness in the job scheduling problem ⋮ DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM ⋮ A Branch-and-Bound method for solving Multi-Skill Project Scheduling Problem ⋮ Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm ⋮ Flow-based formulations for operational fixed interval scheduling problems with random delays ⋮ Dynamic algorithms for multimachine interval scheduling through analysis of idle intervals ⋮ A successful three-phase metaheuristic for the shift minimization personal task scheduling problem ⋮ Spread time considerations in operational fixed job scheduling
Uses Software
Cites Work
- Scheduling jobs with fixed start and end times
- On the computational complexity of (maximum) class scheduling
- License class design: Complexity and algorithms
- A decomposition theorem for partially ordered sets
- The Fixed Job Schedule Problem with Spread-Time Constraints
- A Lagrangian Relaxation Approach To The Classroom Assignment Problem*
- The Fixed Job Schedule Problem with Working-Time Constraints
- An Optimal Solution for the Channel-Assignment Problem
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- Games of Boldness, Where the Player Performing the Hardest Task Wins
- Approximation Algorithms for Fixed Job Schedule Problems
- Minimal Resources for Fixed and Variable Job Schedules
- On the facial structure of set packing polyhedra
- A Faster Strongly Polynomial Minimum Cost Flow Algorithm
- Unnamed Item
This page was built for publication: Exact and approximation algorithms for the operational fixed interval scheduling problem
