Analysis of Greedy Solutions for a Replacement Part Sequencing Problem

DOI10.1287/moor.6.1.74zbMath0496.90040OpenAlexW1987453046MaRDI QIDQ3960453

Donald K. Friesen, Bryan L. Deuermeyer

Publication date: 1981

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.6.1.74

zbMATH Keywords

NP-hardnessheuristic solutionworst case boundsbuild problemfinite inventory of sparesgreedy type algorithmminimization of total number of installationsrepeated repair of a machinesequencing the installation of replacement parts

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items

Comparing the minimum completion times of two longest-first scheduling-heuristics ⋮ \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments ⋮ A polynomial-time approximation scheme for maximizing the minimum machine completion time ⋮ Improved approaches to the exact solution of the machine covering problem ⋮ Machine covering in the random-order model ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ On-line machine covering on two machines with local migration ⋮ GRAPH ORIENTATION TO MAXIMIZE THE MINIMUM WEIGHTED OUTDEGREE ⋮ Online scheduling with rejection and reordering: exact algorithms for unit size jobs ⋮ The exact LPT-bound for maximizing the minimum completion time ⋮ Semi-on-line scheduling problems for maximizing the minimum machine completion time ⋮ Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data ⋮ On the sum minimization version of the online bin covering problem ⋮ Approximation schemes for scheduling and covering on unrelated machines ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System