Pages that link to "Item:Q3951895"
From MaRDI portal
The following pages link to A Vector-Sum Theorem and its Application to Improving Flow Shop Guarantees (Q3951895):
Displaying 13 items.
- A fluid approach to large volume job shop scheduling (Q600845) (← links)
- New results in the worst-case analysis for flow-shop scheduling (Q689950) (← links)
- A vector-sum theorem in two-dimensional space (Q1067215) (← links)
- Regular hypergraphs, Gordon's lemma, Steinitz' lemma and invariant theory (Q1087559) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- On some geometric methods in scheduling theory: A survey (Q1337673) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- Scheduling in network flow shops (Q2564878) (← links)
- Flexible flow shop scheduling with uniform parallel machines (Q2569085) (← links)
- Performance guarantees for flowshop heuristics to minimize makespan (Q2572856) (← links)
- Structured Hadamard Conjecture (Q2840800) (← links)
- Approximation scheduling algorithms: a survey (Q4207781) (← links)
- Scheduling jobshops with some identical or similar jobs (Q5946718) (← links)