Analysis of Greedy Solutions for a Replacement Part Sequencing Problem

DOI10.1287/MOOR.6.1.74MaRDI QIDQ3960453zbMATH OpenOpenAlexFDO

Authors 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

build problemfinite inventory of sparesgreedy type algorithmheuristic solutionminimization of total number of installationsNP-hardnessrepeated repair of a machinesequencing the installation of replacement partsworst case bounds

Mathematics Subject Classification ID

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

Cited in

(19)

• The exact LPT-bound for maximizing the minimum completion time
• A polynomial-time approximation scheme for maximizing the minimum machine completion time
• Optimal on-line algorithms for the uniform machine scheduling problem with ordinal data
• A unified view of parallel machine scheduling with interdependent processing rates
• Improved approaches to the exact solution of the machine covering problem
• Approximation schemes for scheduling and covering on unrelated machines
• A unified approach to truthful scheduling on related machines
• Graph orientation to maximize the minimum weighted outdegree
• Comparing the minimum completion times of two longest-first scheduling-heuristics
• \(\mathrm{H}\)-index manipulation by merging articles: models, theory, and experiments
• Scheduling to Maximize the Minimum Processor Finish Time in a Multiprocessor System
• An efficient polynomial time approximation scheme for load balancing on uniformly related machines
• Online scheduling with rejection and reordering: exact algorithms for unit size jobs
• Semi-on-line scheduling problems for maximizing the minimum machine completion time
• Machine covering in the random-order model
• On-line machine covering on two machines with local migration
• Efficient approximation schemes for scheduling on a stochastic number of machines
• Variants and objectives for ordinal scheduling
• On the sum minimization version of the online bin covering problem

This page was built for publication: Analysis of Greedy Solutions for a Replacement Part Sequencing Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3960453)