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

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

Virginie Gabrel

Publication date: 19 January 1999

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

zbMATH Keywords

heuristics; graphs; identical parallel machines; fixed job scheduling; non-preemptive jobs

Mathematics Subject Classification ID

90B35: Deterministic scheduling theory in operations research

Related Items

Model buidling for air-traffic controllers' workload regulation, Fixed interval scheduling: models, applications, computational complexity and algorithms, On the complexity of the independent set problem in triangle graphs, DECOMPOSITION ALGORITHMS FOR THE INTERVAL SCHEDULING PROBLEM, Scheduling multiple products on parallel machines with setup costs

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