Approximation Algorithms for Fixed Job Schedule Problems
From MaRDI portal
Publication:3990569
DOI10.1287/opre.40.1.S96zbMath0764.90044MaRDI QIDQ3990569
Silvano Martello, Paolo Toth, Matteo Fischetti
Publication date: 28 June 1992
Published in: Operations Research (Search for Journal in Brave)
polynomial-time approximation algorithmsgreedy solutionpreemptive relaxationfixed job schedule problem
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Working time constraints in operational fixed job scheduling, An analysis of shift class design problems, A fixed job scheduling problem with machine-dependent job weights, Tactical fixed job scheduling with spread-time constraints, Fixed interval scheduling: models, applications, computational complexity and algorithms, Inverse interval scheduling via reduction on a single machine, A metaheuristic for the fixed job scheduling problem under spread time constraints, Scheduling jobs within time windows on identical parallel machines: New model and algorithms, Exact and approximation algorithms for the operational fixed interval scheduling problem, Algorithms for large scale shift minimisation personnel task scheduling problems, Runway sequencing with holding patterns, Operational fixed job scheduling problem under spread time constraints: a branch-and-price algorithm, On the approximability of an interval scheduling problem, On holonomic mathematical F ‐ pendulum, Routing trains through railway stations: Complexity issues, Spread time considerations in operational fixed job scheduling
