Replication and sequencing of unreliable jobs on parallel machines

DOI10.1016/J.COR.2021.105634MaRDI QIDQ2669802zbMATH OpenOpenAlexFDO

Authors Alessandro Agnetis, Mario Benini, Paolo Detti, Ben Hermans, Marco Pranzo

Publication date 9 March 2022

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

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

zbMATH Keywords

schedulingNP-hardnessmachine breakdownunreliable jobs

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Recommendations

• Sequencing unreliable jobs on parallel machines
• The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
• Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
• The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines
• Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Note on Stochastic Scheduling on a Single Machine Subject to Breakdown–The Preemptive Repeat Model
• A survey on offline scheduling with rejection
• Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
• Scheduling with limited machine availability
• Selecting jobs for scheduling on a machine subject to failure
• Sequencing unreliable jobs on parallel machines
• Single machine flow-time scheduling with a single breakdown
• Static strategies for worksharing with unrecoverable interruptions
• The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines
• The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
• Three-dimensional axial assignment problems with decomposable cost coefficients
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation

Cited in

(4)

• A stochastic bi-objective project scheduling model under failure of activities
• Sequencing unreliable jobs on parallel machines
• Job replication on multiserver systems
• The list scheduling algorithm for scheduling unreliable jobs on two parallel machines

This page was built for publication: Replication and sequencing of unreliable jobs on parallel machines

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