Pages that link to "Item:Q4706278"
From MaRDI portal
The following pages link to Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem (Q4706278):
Displaying 32 items.
- Job-shop production scheduling with reverse flows (Q319298) (← links)
- On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem (Q336966) (← links)
- A new set of high-performing heuristics to minimise flowtime in permutation flowshops (Q337260) (← links)
- Variability of completion time differences in permutation flow shop scheduling (Q337356) (← links)
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness (Q337554) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime (Q339553) (← links)
- A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
- A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem (Q857345) (← links)
- A proposal for a hybrid meta-strategy for combinatorial optimization problems (Q945052) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- Minimizing the bicriteria of makespan and maximum tardiness with an upper bound on maximum tardiness (Q958459) (← links)
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) (← links)
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics (Q1017464) (← links)
- An empirical analysis of the optimality rate of flow shop heuristics (Q1027589) (← links)
- The distributed permutation flowshop scheduling problem (Q1040975) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Scheduling blocking flowshops with setup times via constraint guided and accelerated local search (Q2003564) (← 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)
- Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach (Q2572853) (← links)
- Relationship between common objective functions, idle time and waiting time in permutation flow shop scheduling (Q2664303) (← links)
- \(N\)-NEH+ algorithm for solving permutation flow shop problems (Q2668738) (← links)
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems (Q2668784) (← links)
- New heuristics for no-wait flow shops with a linear combination of makespan and maximum lateness (Q3055285) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- An adaptive dynamic neighborhood crow search algorithm for solving permutation flow shop scheduling problems (Q6065137) (← links)
- Automatic design of constructive heuristics for a reconfigurable distributed flowshop group scheduling problem (Q6065623) (← links)
- Improved NEH-based heuristic for the blocking flow-shop problem with bicriteria of the makespan and machine utilization (Q6094862) (← links)
- The seeds of the NEH algorithm: an overview using bibliometric analysis (Q6200788) (← links)
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing (Q6547128) (← links)
- Deterministic constructive \(\nu N\)-NEH+ algorithm to solve permutation flow shop scheduling problem with makespan criterion (Q6551067) (← links)
