Sequencing unreliable jobs on parallel machines
type: Item
instance of: scholarly article
title: Sequencing unreliable jobs on parallel machines
zbMATH Open document ID: 1168.90493
author: Alessandro Agnetis
author: Paolo Detti
author: Marco Pranzo
author: Manbir S. Sodhi
published in: Journal of Scheduling
publication date: 2009-08-28T00:00:00Z
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 5599878
zbMATH Keywords: indexable problems
zbMATH Keywords: polymatroids
zbMATH Keywords: NP-hardness
zbMATH Keywords: approximation algorithms
zbMATH Keywords: unsupervised manufacturing systems
MaRDI profile type: Publication
full work available at URL: s10951-008-0076-6
OpenAlex ID: W1984748823
cites work: Conservation Laws, Extended Polymatroids and Multiarmed Bandit Problems; A Polyhedral Approach to Indexable Systems
cites work: Q4198056
cites work: Q5684698
cites work: Q4197923
cites work: Q3525911
cites work: Structure of a simple scheduling polyhedron
cites work: Sequential testing of complex systems: a review
DOI: 10.1007/S10951-008-0076-6
description: scientific article; zbMATH DE number 5599878