A fixed job scheduling problem with machine-dependent job weights

DOI10.1080/00207540701499499zbMath1171.90397OpenAlexW1986120153MaRDI QIDQ3183761

Azizoglu, Meral, Deniz Türsel Eliiyi

Publication date: 21 October 2009

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540701499499

zbMATH Keywords

fixed job schedulingeligibility constraintsmachine-dependent job weights

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Related Items (3)

Analysis of a parallel machine scheduling problem with sequence dependent setup times and job availability intervals ⋮ Tactical fixed job scheduling with spread-time constraints ⋮ MIP models and a matheuristic algorithm for an identical parallel machine scheduling problem under multiple copies of shared resources constraints

Cites Work

• Fixed interval scheduling: models, applications, computational complexity and algorithms
• 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
• Exact and approximation algorithms for the operational fixed interval scheduling problem
• On the approximability of an interval scheduling problem
• Interval scheduling on identical machines
• Three Scheduling Algorithms Applied to the Earth Observing Systems Domain
• Spread time considerations in operational fixed job scheduling
• The Fixed Job Schedule Problem with Spread-Time Constraints
• Approximation Algorithms for Fixed Job Schedule Problems
• A Greedy On-Line Algorithm for thek-Track Assignment Problem

This page was built for publication: A fixed job scheduling problem with machine-dependent job weights