Sequencing unreliable jobs on parallel machines
From MaRDI portal
Publication:835638
DOI10.1007/s10951-008-0076-6zbMath1168.90493OpenAlexW1984748823MaRDI QIDQ835638
Alessandro Agnetis, Paolo Detti, Marco Pranzo, Sodhi, Manbir S.
Publication date: 28 August 2009
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-008-0076-6
Management decision making, including multiple objectives (90B50) Deterministic scheduling theory in operations research (90B35)
Related Items (14)
Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria ⋮ 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 ⋮ A search game on a hypergraph with booby traps ⋮ A General Framework for Approximating Min Sum Ordering Problems ⋮ Replication and sequencing of unreliable jobs on parallel machines ⋮ Search and rescue in the face of uncertain threats ⋮ Unsupervised parallel machines scheduling with tool switches ⋮ Mapping filtering streaming applications ⋮ Mapping workflow applications with types on heterogeneous specialized platforms ⋮ The list scheduling algorithm for scheduling unreliable jobs on two parallel machines ⋮ A Review for Submodular Optimization on Machine Scheduling Problems ⋮ Time-critical testing and search problems ⋮ A game theoretic approach to a problem in polymatroid maximization
Cites Work
This page was built for publication: Sequencing unreliable jobs on parallel machines
