Pages that link to "Item:Q915635"
From MaRDI portal
The following pages link to Some efficient heuristic methods for the flow shop sequencing problem (Q915635):
Displayed 47 items.
- A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size (Q1596947) (← links)
- Constructing a fuzzy flow-shop sequencing model based on statistical data (Q1603300) (← links)
- The flow shop with parallel machines: A tabu search approach (Q1609888) (← links)
- Performance enhancements to tabu search for the early/tardy scheduling problem (Q1609889) (← links)
- An empirical analysis of heuristics for solving the two-machine flow shop problem with job release times (Q1761212) (← links)
- Parallel hybrid heuristics for the permutation flow shop problem (Q1761767) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Solving the flowshop scheduling problem with sequence dependent setup times using advanced metaheuristics (Q1776952) (← links)
- Heuristics for scheduling in a flow shop with multiple processors (Q1806647) (← links)
- Heuristics for permutation flow shop scheduling with batch setup times (Q1814870) (← links)
- Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation (Q1847225) (← links)
- Handling flexibility in a ``generalised job shop'' with a fuzzy approach (Q1869716) (← links)
- A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion (Q1885958) (← links)
- A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) (← links)
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem (Q1887766) (← links)
- The simple \(F2//C \max\) with forbidden tasks in first or last position: a problem more complex that it seems (Q1887767) (← links)
- Flow-shop scheduling with flexible processors (Q1891241) (← links)
- A comparison of neighborhood search techniques for multi-objective combinatorial problems (Q1915966) (← links)
- A comparison of local search methods for flow shop scheduling (Q1919857) (← links)
- Parallel local search (Q1922627) (← links)
- Local search methods for the flowshop scheduling problem with flowtime minimization (Q1926908) (← links)
- Benchmarks for basic scheduling problems (Q2366085) (← links)
- A user's guide to tabu search (Q2366991) (← links)
- A tabu-search heuristic for the flexible-resource flow shop scheduling problem (Q2367002) (← links)
- A Lagrangean relaxation approach for the mixed-model flow line sequencing problem (Q2456653) (← links)
- Minimizing makespan on an \(m\)-machine re-entrant flowshop (Q2459401) (← links)
- Evaluating parallel simulated evolution strategies for VLSI cell placement (Q2466403) (← links)
- An iterated greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives (Q2467260) (← links)
- An improved NEH heuristic to minimize makespan in permutation flow shops (Q2475856) (← links)
- Comparison of heuristics for flowtime minimisation in permutation flowshops (Q2485174) (← links)
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains (Q2491781) (← links)
- Hierarchical minimization of completion time variance and makespan in jobshops (Q2496030) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
- Two-stage hybrid flow shop with recirculation (Q3563625) (← links)
- An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers (Q3596695) (← links)
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time (Q4230171) (← links)
- Scheduling production tasks in a two-stage FMS (Q4706330) (← links)
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop (Q4717402) (← links)
- Experimental comparison of heuristics for flow shop scheduling (Q4812723) (← links)
- Evaluating artificial intelligence heuristics for a flexible Kanban system: simultaneous Kanban controlling and scheduling (Q5426585) (← links)
- Flow shop-sequencing problem with synchronous transfers and makespan minimization (Q5438669) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- A performance analysis of dispatching rules and a heuristic in static flowshops with missing operations of jobs (Q5935393) (← links)
- A computational study with a new algorithm for the three-machine permutation flow-shop problem with release times (Q5937715) (← links)
- Tabu search for a class of single-machine scheduling problems (Q5945325) (← links)
- Artificial intelligence search methods for multi-machine two-stage scheduling with due date penalty, inventory, and machining costs (Q5953158) (← links)