Pages that link to "Item:Q1775061"
From MaRDI portal
The following pages link to Optimal parallel machines scheduling with availability constraints (Q1775061):
Displaying 11 items.
- Bounding strategies for the hybrid flow shop scheduling problem (Q545969) (← links)
- Solving an integrated job-shop problem with human resource constraints (Q744642) (← links)
- Energetic reasoning revisited: Application to parallel machine scheduling (Q835610) (← links)
- Approximation algorithms for the makespan minimization with positive tails on a single machine with a fixed non-availability interval (Q841595) (← links)
- Optimal scheduling of a two-stage hybrid flow shop (Q857819) (← links)
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints (Q967430) (← links)
- Single machine scheduling with forbidden start times (Q1022436) (← links)
- Fault tolerant scheduling of tasks of two sizes under resource augmentation (Q1702666) (← links)
- An approximate decomposition algorithm for scheduling on parallel machines with heads and tails (Q2433392) (← links)
- Makespan minimization for parallel machine scheduling of semi-resumable and non-resumable jobs with multiple availability constraints (Q5879664) (← links)
- Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods (Q6090983) (← links)
