Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
type: Item
instance of: scholarly article
title: Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions
zbMATH Open document ID: 1391.90233
author: Alessandro Agnetis
author: Paolo Detti
author: Patrick Martineau
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C60
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6901335
zbMATH Keywords: unrecoverable interruptions
zbMATH Keywords: parallel machines scheduling
zbMATH Keywords: NP-hardness
zbMATH Keywords: exact and heuristic algorithms
Wikidata QID: Q115578053
describes a project that uses: ickp
MaRDI profile type: Publication
full work available at URL: j.cor.2016.10.013
OpenAlex ID: W2539602312
cites work: The list scheduling algorithm for scheduling unreliable jobs on two parallel machines
cites work: Sequencing unreliable jobs on parallel machines
cites work: Pro-active failure handling mechanisms for scheduling in grid computing environments
cites work: Static worksharing strategies for heterogeneous computers with unrecoverable interruptions
cites work: Static strategies for worksharing with unrecoverable interruptions
cites work: ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation
DOI: 10.1016/J.COR.2016.10.013
description: scientific article; zbMATH DE number 6901335