Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions

DOI10.1016/j.cor.2016.10.013zbMath1391.90233OpenAlexW2539602312WikidataQ115578053 ScholiaQ115578053MaRDI QIDQ1652152

Patrick Martineau, Alessandro Agnetis, Paolo Detti

Publication date: 11 July 2018

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

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

zbMATH Keywords

NP-hardnessunrecoverable interruptionsparallel machines schedulingexact and heuristic algorithms

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

Replication and sequencing of unreliable jobs on parallel machines

Uses Software

• ickp

Cites Work

• Static strategies for worksharing with unrecoverable interruptions
• Static worksharing strategies for heterogeneous computers with unrecoverable interruptions
• Pro-active failure handling mechanisms for scheduling in grid computing environments
• Sequencing unreliable jobs on parallel machines
• ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
• The list scheduling algorithm for scheduling unreliable jobs on two parallel machines

This page was built for publication: Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions