Pages that link to "Item:Q1917234"
From MaRDI portal
The following pages link to Selecting jobs for scheduling on a machine subject to failure (Q1917234):
Displaying 15 items.
- Permutation flow shop scheduling with order acceptance and weighted tardiness (Q419558) (← links)
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
- Sequencing unreliable jobs on parallel machines (Q835638) (← links)
- Simultaneous selection (Q906442) (← links)
- Job selection and sequencing on a single machine in a random environment (Q1310027) (← links)
- Multi-period job selection: Planning work loads to maximize profit (Q1348559) (← links)
- A game theoretic approach to a problem in polymatroid maximization (Q2098075) (← links)
- A unifying look at sequence submodularity (Q2238597) (← links)
- The list scheduling algorithm for scheduling unreliable jobs on two parallel machines (Q2448904) (← links)
- Replication and sequencing of unreliable jobs on parallel machines (Q2669802) (← links)
- Multi-objective evolutionary algorithms are generally good: maximizing monotone submodular functions over sequences (Q2681004) (← links)
- Scheduling tasks with failure probabilities to minimize expected cost (Q4735026) (← links)
- Scheduling jobs that are subject to failure propagation (Q5688021) (← links)
- Greedy solutions of selection and ordering problems (Q5945209) (← links)
- Optimal activation of halting multi‐armed bandit models (Q6057028) (← links)