Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
DOI10.1016/J.COR.2016.10.013zbMATH Open1391.90233OpenAlexW2539602312WikidataQ115578053 ScholiaQ115578053MaRDI QIDQ1652152FDOQ1652152
Authors: Alessandro Agnetis, Paolo Detti, Patrick Martineau 
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
Recommendations
- Evaluation of the expected makespan of a set of non-resumable jobs on parallel machines with stochastic failures
- Parallel-machine scheduling under potential disruption
- scientific article; zbMATH DE number 640393
- Scheduling on a single processor subject to interruptions in processing
- Minimizing weighted tardiness of jobs with stochastic interruptions in parallel machines
Approximation methods and heuristics in mathematical programming (90C59) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Abstract computational complexity for mathematical programming problems (90C60)
Cites Work
- ``Product partition and related problems of scheduling and systems reliability: computational complexity and approximation
- Sequencing unreliable jobs on parallel machines
- 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
- The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
Cited In (4)
Uses Software
This page was built for publication: Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1652152)
