Pages that link to "Item:Q1291704"
From MaRDI portal
The following pages link to A new constructive heuristic for the flowshop scheduling problem (Q1291704):
Displaying 33 items.
- A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177) (← links)
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem (Q342481) (← links)
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach (Q497626) (← links)
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness (Q670790) (← links)
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284) (← links)
- Some efficient heuristic methods for the flow shop sequencing problem (Q915635) (← links)
- An improved NEH-based heuristic for the permutation flowshop problem (Q925842) (← links)
- An improved particle swarm optimization algorithm for flowshop scheduling problem (Q975447) (← links)
- An efficient heuristic approach to the scheduling of jobs in a flowshop (Q1194720) (← links)
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal (Q1339130) (← links)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop. (Q1399584) (← links)
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime (Q1652234) (← links)
- Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness (Q1765532) (← links)
- A comprehensive review and evaluation of permutation flowshop heuristics (Q1772850) (← links)
- Fast heuristics for minimizing the makespan in non-permutation flow shops (Q1782179) (← links)
- Solving permutation flow shop scheduling problem with sequence-independent setup time (Q2176034) (← links)
- Flow shop scheduling with heterogeneous workers (Q2254003) (← 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)
- A hybrid neural network–genetic algorithm approach for permutation flow shop scheduling (Q3163237) (← links)
- A survey and evaluation of static flowshop scheduling heuristics (Q3329204) (← links)
- A fuzzy greedy heuristic for permutation flow-shop scheduling (Q3582659) (← links)
- An improved genetic algorithm for the flowshop scheduling problem (Q3596697) (← links)
- A high quality solution constructive heuristic for flow shop sequencing (Q4656763) (← links)
- Scheduling production tasks in a two-stage FMS (Q4706330) (← links)
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem (Q4849303) (← links)
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem (Q5103873) (← links)
- Flowshop-scheduling problems with makespan criterion: a review (Q5466734) (← links)
- A fast method for heuristics in large-scale flow shop scheduling (Q5477256) (← links)
- A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains (Q5884367) (← links)
- A note on scheduling flowshops with flexible stage ordering (Q5925946) (← links)
