Pages that link to "Item:Q4767113"
From MaRDI portal
The following pages link to Heuristic-Programming Solution of a Flowshop-Scheduling Problem (Q4767113):
Displaying 13 items.
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop (Q582206) (← links)
- On the heuristic solution of the permutation flow shop problem by path algorithms (Q690012) (← links)
- A robust two-machine flow-shop scheduling model with scenario-dependent processing times (Q782088) (← links)
- The two-machine sequence dependent flowshop scheduling problem (Q1081528) (← links)
- A new approach to choosing initial points in local search (Q1116345) (← links)
- Systematic choice of initial points in local search: Extensions and application to neural networks (Q1182102) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- Heuristic methods and applications: A categorized survey (Q1823879) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- The maximal dispersion problem and the ``first point outside the neighbourhood'' heuristic (Q2638928) (← links)
- A functional approach to modelling of manufacturing processes (Q4066841) (← links)
