On the on-line maintenance scheduling problem

DOI10.1007/s11590-017-1198-6zbMath1397.90160OpenAlexW2775139320MaRDI QIDQ1744635

Claudio Telha, Fahimeh Shamsaei, 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 analysisrandomized algorithmsmaintenance scheduling

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Online scheduling with general machine cost functions
• Robust optimization-methodology and applications
• On the competitive ratio for online facility location
• Approximation Techniques for Average Completion Time Scheduling
• Toward Robust Revenue Management: Competitive Analysis of Online Booking
• On the online bin packing problem
• Lectures on Stochastic Programming
• Better Bounds for Online Scheduling
• Online Stochastic Matching: Beating 1-1/e

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