Pages that link to "Item:Q4542585"
From MaRDI portal
The following pages link to Improved bounds for acyclic job shop scheduling (extended abstract) (Q4542585):
Displaying 11 items.
- Solving the job-shop scheduling problem optimally by dynamic programming (Q339631) (← links)
- On some properties of optimal schedules in the job shop problem with preemption and an arbitrary regular criterion (Q744655) (← links)
- Polynomial time approximation algorithms for machine scheduling: Ten open problems (Q1806342) (← links)
- On the drift of short schedules. (Q1853539) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- Scheduling on unrelated machines under tree-like precedence constraints (Q2391177) (← links)
- A genetic algorithm for the flexible job-shop scheduling problem (Q2482369) (← links)
- On the power of randomization for job shop scheduling with<i>k</i>-units length tasks (Q3625688) (← links)
- Scheduling Problems over Network of Machines (Q5002605) (← links)
- Reconfigurable timed graphs for the design of optimal scheduling in uncertain environments based on transition-timed Petri net (Q6053940) (← links)
- Approximation Algorithms for Generalized Path Scheduling (Q6065400) (← links)