On the on-line maintenance scheduling problem

DOI10.1007/S11590-017-1198-6MaRDI QIDQ1744635zbMATH OpenOpenAlexFDO

Authors Fahimeh Shamsaei, Claudio Telha, Mathieu Van Vyve

Publication date 19 April 2018

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-017-1198-6

zbMATH Keywords

competitive analysismaintenance schedulingrandomized algorithms

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• An on-line scheduling problem of parallel machines with common maintenance time
• New algorithms for an ancient scheduling problem.
• On-line machine covering
• The scheduling of maintenance service
• On-line scheduling revisited

Cites work

• Approximation techniques for average completion time scheduling
• Better Bounds for Online Scheduling
• scientific article; zbMATH DE number 1487870 (Why is no real title available?)
• Lectures on Stochastic Programming
• Matroids, secretary problems, and online mechanisms
• On the competitive ratio for online facility location
• On the online bin packing problem
• Online scheduling with general machine cost functions
• Online Stochastic Matching: Beating 1-1/e
• Robust optimization-methodology and applications
• Toward Robust Revenue Management: Competitive Analysis of Online Booking

Cited in

(2)

• Maintenance scheduling problems as benchmarks for constraint algorithms
• An on-line scheduling problem of parallel machines with common maintenance time

This page was built for publication: On the on-line maintenance scheduling problem

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