Pages that link to "Item:Q2277356"
From MaRDI portal
The following pages link to A new heuristic for the n-job, M-machine flow-shop problem (Q2277356):
Displayed 38 items.
- An effective differential evolution algorithm for permutation flow shop scheduling problem (Q298425) (← links)
- An improved particle swarm optimization with decline disturbance index (DDPSO) for multi-objective job-shop scheduling problem (Q336962) (← links)
- A discrete inter-species cuckoo search for flowshop scheduling problems (Q337568) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- Scheduling flow shops using differential evolution algorithm (Q817560) (← links)
- A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem (Q857333) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- An iterated local search algorithm for the permutation flowshop problem with total flowtime criterion (Q959513) (← links)
- Flow shops with WIP and value added costs (Q969753) (← links)
- Flowshop sequencing with mean flowtime objective (Q1130072) (← links)
- An efficient heuristic approach to the scheduling of jobs in a flowshop (Q1194720) (← links)
- The job shop scheduling problem: Conventional and new solution techniques (Q1268188) (← links)
- Search heuristics for a flowshop scheduling problem in a printed circuit board assembly process (Q1278196) (← links)
- A fast tabu search algorithm for the permutation flow-shop problem (Q1278198) (← links)
- Sevast'yanov's algorithm for the flow-shop scheduling problem (Q1278200) (← links)
- A new constructive heuristic for the flowshop scheduling problem (Q1291704) (← links)
- Some results of the worst-case analysis for flow shop scheduling (Q1296692) (← links)
- A tabu search approach for the flow shop scheduling problem (Q1296693) (← links)
- A note on worst-case analysis of approximation algorithms for a scheduling problem (Q1330557) (← links)
- Heuristics for scheduling in flowshop with multiple objectives (Q1388918) (← links)
- A heuristic algorithm for mean flowtime objective in flowshop scheduling (Q1389189) (← links)
- Heuristic procedures for minimizing makespan and the number of required pallets (Q1390237) (← links)
- Case study on statistically estimating minimum makespan for flow line scheduling problems. (Q1427564) (← links)
- Constructing a fuzzy flow-shop sequencing model based on statistical data (Q1603300) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← 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)
- The two- and \(m\)-machine flowshop scheduling problems with bicriteria of makespan and mean flowtime (Q1869720) (← links)
- A neuro-tabu search heuristic for the flow shop scheduling problem (Q1885991) (← links)
- Solving multi-objective production scheduling problems using metaheuristics (Q1887769) (← links)
- Some aspects of scatter search in the flow-shop problem (Q2570162) (← links)
- A new heuristic for the flowshop scheduling problem to minimize makespan and maximum tardiness (Q3596698) (← links)
- Forward Backward Transformation (Q3649623) (← links)
- A heuristic for scheduling in flowshop and flowline-based manufacturing cell with multi-criteria (Q4394375) (← links)
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop (Q4717402) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- A flexible flowshop problem with total flow time minimization (Q5939584) (← links)
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem (Q5946533) (← links)