Scheduling jobs within time windows on identical parallel machines: New model and algorithms

DOI10.1016/0377-2217(95)00010-NzbMath0904.90086OpenAlexW2105341176MaRDI QIDQ1388825

Virginie Gabrel

Publication date: 19 January 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00010-n

zbMATH Keywords

heuristicsgraphsidentical parallel machinesfixed job schedulingnon-preemptive jobs

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (7)

Fixed interval scheduling: models, applications, computational complexity and algorithms ⋮ Capacity allocation in a service system with preferred service completion times ⋮ DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM ⋮ On the complexity of the independent set problem in triangle graphs ⋮ Model buidling for air-traffic controllers' workload regulation ⋮ Scheduling multiple products on parallel machines with setup costs ⋮ Interval scheduling with economies of scale

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the computational complexity of (maximum) shift class scheduling
• A state-of-the-art review of parallel-machine scheduling research
• Scheduling jobs with fixed start and end times
• An approximation algorithm for the license and shift class design problem
• 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
• Les problèmes d'ordonnancement
• Planification à moyen terme de la production d'un satellite défilant et ensembles stables
• Permutation Graphs and Transitive Graphs

This page was built for publication: Scheduling jobs within time windows on identical parallel machines: New model and algorithms