Online scheduling problems with flexible release dates: applications to infrastructure restoration

DOI10.1016/j.cor.2017.11.014zbMath1391.90300OpenAlexW2775696784WikidataQ113103316 ScholiaQ113103316MaRDI QIDQ1651574

Sarah G. Nurre, Thomas C. Sharkey

Publication date: 12 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.11.014

zbMATH Keywords

schedulingonline optimizationflexible release datesinfrastructure restoration

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (4)

Predictive-reactive strategy for identical parallel machine rescheduling ⋮ Interdependent integrated network design and scheduling problems with movement of machines ⋮ Applying ``peeling onion approach for competitive analysis in online scheduling with rejection ⋮ Modeling interdependencies in infrastructure systems using multi-layered network flows

Uses Software

• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Incremental network design with shortest paths
• Emergency path restoration problems
• On-line scheduling to minimize average completion time revisited.
• Incremental network design with maximum flows
• Strategic network restoration
• LP-based online scheduling: From single to parallel machines
• Online algorithms. The state of the art
• Competitive snoopy caching
• Randomized algorithms for on-line scheduling problems: How low can't you go?
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
• Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
• The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
• Efficient recovery from power outage (extended abstract)
• Optimal two- and three-stage production schedules with setup times included
• Incremental Network Design with Minimum Spanning Trees
• Earliest Arrival Flows with Multiple Sources
• Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses
• Online Stochastic Packing Applied to Display Ad Allocation
• Online Searching
• Logic-based MultiObjective Optimization for Restoration Planning
• Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
• Integrated network design and scheduling problems with parallel identical machines: Complexity results and dispatching rules
• Optimal on-line algorithms for single-machine scheduling
• Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time
• Scheduling

This page was built for publication: Online scheduling problems with flexible release dates: applications to infrastructure restoration