Pages that link to "Item:Q5395665"
From MaRDI portal
The following pages link to Hardness of Approximating Flow and Job Shop Scheduling Problems (Q5395665):
Displaying 10 items.
- A study on several combination problems of classic shop scheduling and shortest path (Q344790) (← links)
- On the weak computability of a four dimensional orthogonal packing and time scheduling problem (Q391303) (← links)
- Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← links)
- Solving constrained flow-shop scheduling problem through multistage fuzzy binding approach with fuzzy due dates (Q2092700) (← links)
- Scheduling problems over a network of machines (Q2281619) (← links)
- Combinations of Some Shop Scheduling Problems and the Shortest Path Problem: Complexity and Approximation Algorithms (Q3196375) (← links)
- Scheduling Problems over Network of Machines (Q5002605) (← links)
- Shop scheduling in manufacturing environments: a review (Q6060656) (← links)
- Maximizing Throughput in Flow Shop Real-Time Scheduling (Q6084409) (← links)
- A complexity analysis and algorithms for two-machine shop scheduling problems under linear constraints (Q6204660) (← links)