The following pages link to (Q4840097):
Displaying 13 items.
- Approximation algorithms for the parallel flow shop problem (Q421785) (← links)
- A note on the two-stage assembly flow shop scheduling problem with uniform parallel machines (Q881563) (← links)
- A hybrid two-stage flowshop with part family, batch production, major and minor set-ups (Q1291587) (← links)
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage. (Q1410327) (← links)
- A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem (Q1566707) (← links)
- Geometrical heuristics for multiprocessor flowshop scheduling with uniform machines at each stage (Q1607975) (← links)
- Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
- A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation (Q1887965) (← links)
- The consecutive multiprocessor job scheduling problem (Q2178063) (← links)
- A note on makespan minimization in two-stage flexible flow shops with uniform machines (Q2433488) (← links)
- Flexible flow shop scheduling with uniform parallel machines (Q2569085) (← links)
- (Q3481469) (← links)
- Sequencing and scheduling in flowshops with task redistribution (Q4658528) (← links)
