Pages that link to "Item:Q1847252"
From MaRDI portal
The following pages link to Review of properties of different precedence graphs for scheduling problems (Q1847252):
Displaying 14 items.
- Handling precedence constraints in scheduling problems by the sequence pair representation (Q511691) (← links)
- On a parallel machine scheduling problem with precedence constraints (Q880562) (← links)
- Tree precedence in scheduling: The strong-weak distinction (Q1606979) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- Scheduling chained multiprocessor tasks onto large multiprocessor system (Q1700868) (← links)
- Parallel dedicated machines scheduling with chain precedence constraints (Q1926857) (← links)
- Deep infeasibility exploration method for vehicle routing problems (Q2163783) (← links)
- Minimum equivalent precedence relation systems (Q2410264) (← links)
- Optimal preemptive scheduling on a fixed number of identical parallel machines (Q2488216) (← links)
- A new formulation for scheduling unrelated processor under precedence constraints (Q4511608) (← links)
- STRUCTURAL AND EXTREMAL PROPERTIES OF THE HOT ROLLING BATCHES PRECEDENCE GRAPH (Q4581423) (← links)
- Forcing relations for AND/OR precedence constraints (Q4952622) (← links)
- A Precedence Graph Algorithm for the Shop Scheduling Problem (Q5618270) (← links)
- Literature reviews in operations research: a new taxonomy and a meta review (Q6106580) (← links)