Pages that link to "Item:Q835638"

The following pages link to Sequencing unreliable jobs on parallel machines (Q835638):

Displaying 14 items.

• Scheduling linearly deteriorating jobs by two agents to minimize the weighted sum of two criteria (Q337198) (← links)
• Mapping workflow applications with types on heterogeneous specialized platforms (Q645854) (← links)
• Scheduling nonpreemptive jobs on parallel machines subject to exponential unrecoverable interruptions (Q1652152) (← links)
• A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
• A search game on a hypergraph with booby traps (Q2173302) (← links)
• Search and rescue in the face of uncertain threats (Q2184077) (← links)
• Time-critical testing and search problems (Q2242292) (← links)
• Mapping filtering streaming applications (Q2428659) (← links)
• The list scheduling algorithm for scheduling unreliable jobs on two parallel machines (Q2448904) (← links)
• The largest-Z-ratio-first algorithm is 0.8531-approximate for scheduling unreliable jobs on \(m\) parallel machines (Q2661490) (← links)
• Replication and sequencing of unreliable jobs on parallel machines (Q2669802) (← links)
• A Review for Submodular Optimization on Machine Scheduling Problems (Q3297835) (← links)
• A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
• Unsupervised parallel machines scheduling with tool switches (Q6068687) (← links)