Pages that link to "Item:Q3329204"
From MaRDI portal
The following pages link to A survey and evaluation of static flowshop scheduling heuristics (Q3329204):
Displaying 25 items.
- Job-shop production scheduling with reverse flows (Q319298) (← links)
- Scheduling algorithms for flexible flowshops: Worst and average case performance (Q583096) (← links)
- On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
- A bottleneck-based heuristic for minimizing makespan in a flexible flow line with unrelated parallel machines (Q1025264) (← links)
- A survey of priority rule-based scheduling (Q1111923) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- Reduction of job-shop problems to flow-shop problems with precedence constraints (Q1296695) (← links)
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← links)
- Heuristic procedures for minimizing makespan and the number of required pallets (Q1390237) (← links)
- Scheduling a flowline manufacturing cell with sequence dependent family setup times (Q1580980) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- The evolution of schematic representations of flow shop scheduling problems (Q2304109) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem (Q2664317) (← links)
- A heuristic algorithm to schedule work in the repair industry (Q3354848) (← links)
- Flowshop sequencing problems with limited buffer storage (Q3489782) (← links)
- On the combinatorial structure of the permutation flow shop problem (Q3978451) (← links)
- A computational study of heuristics for two-stage flexible flowshops (Q4230155) (← links)
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time (Q4230171) (← links)
- A simulation analysis of robot service movements in FMC (Q4398926) (← links)
- Design and scheduling of flexible assembly lines for printed circuit boards (Q4398942) (← links)
- An improved branch and bound procedure for scheduling a flow line manufacturing cell (Q5478802) (← links)