Pages that link to "Item:Q2059090"
From MaRDI portal
The following pages link to A new algorithm for the two-machine open shop and the polynomial solvability of a scheduling problem with routing (Q2059090):
Displaying 11 items.
- A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem (Q915632) (← links)
- A polynomial algorithm for the two machine job-shop scheduling problem with a fixed number of jobs (Q1326784) (← links)
- A 3/2 algorithm for two-machine open shop with route-dependent processing times (Q1806706) (← links)
- Exponential tightness for integral-type functionals of centered independent differently distributed random variables (Q2145744) (← links)
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches (Q2147068) (← links)
- An algorithm with parameterized complexity of constructing the optimal schedule for the routing open shop problem with unit execution times (Q2633586) (← links)
- Two-machine routing open shop on a tree: instance reduction and efficiently solvable subclass (Q5085264) (← links)
- On the routing open shop problem with two machines on a two-vertex network (Q5263766) (← links)
- An FPTAS for scheduling with resource constraints (Q6047696) (← links)
- Approximation algorithms for two-machine proportionate routing open shop on a tree (Q6134059) (← links)
- Scheduling in manufacturing with transportation: classification and solution techniques (Q6586212) (← links)
