A new constructive heuristic for the flowshop scheduling problem
From MaRDI portal
Publication:1291704
Recommendations
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- A New Heuristic Method for the Permutation Flow Shop Scheduling Problem
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- A high quality solution constructive heuristic for flow shop sequencing
- Fast heuristics for minimizing the makespan in non-permutation flow shops
Cites work
- A Functional Heuristic Algorithm for the Flowshop Scheduling Problem
- A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
- A Note on Heuristics of Flow-Shop Scheduling
- A fast tabu search algorithm for the permutation flow-shop problem
- A new heuristic for the n-job, M-machine flow-shop problem
- A new heuristic method for the flow shop sequencing problem
- A note on worst-case analysis of approximation algorithms for a scheduling problem
- A survey and evaluation of static flowshop scheduling heuristics
- An Evaluation of Flow Shop Sequencing Heuristics
- Flowshop and Jobshop Schedules: Complexity and Approximation
- New results in the worst-case analysis for flow-shop scheduling
- Optimal two- and three-stage production schedules with set-up time included
- Permutation vs. non-permutation flow shop schedules
- Sevast'yanov's algorithm for the flow-shop scheduling problem
- Some efficient heuristic methods for the flow shop sequencing problem
- Technical Note—Johnson's Three-Machine Flow-Shop Conjecture
- The Complexity of Flowshop and Jobshop Scheduling
- The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
- Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops
- Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
- Worst-case analysis of an approximation algorithm for flow-shop scheduling
Cited in
(32)- A hybrid neural network-genetic algorithm approach for permutation flow shop scheduling
- A fuzzy greedy heuristic for permutation flow-shop scheduling
- A new heuristic scheduling method for the make-pack-route problem in make-to-order supply chains
- A survey and evaluation of static flowshop scheduling heuristics
- Solving permutation flow shop scheduling problem with sequence-independent setup time
- General flowshop scheduling problem with the sequence dependent setup times: a heuristic approach
- Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
- Flow shop scheduling with heterogeneous workers
- Scheduling production tasks in a two-stage FMS
- Flowshop-scheduling problems with makespan criterion: a review
- \(N\)-NEH+ algorithm for solving permutation flow shop problems
- New idle time-based tie-breaking rules in heuristics for the permutation flowshop scheduling problems
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- An improved genetic algorithm for the flowshop scheduling problem
- A generalized constructive algorithm using insertion-based heuristics
- Some efficient heuristic methods for the flow shop sequencing problem
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- An improved NEH-based heuristic for the permutation flowshop problem
- Non-permutation flow shop scheduling with order acceptance and weighted tardiness
- An effective new heuristic algorithm for solving permutation flow shop scheduling problem
- An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal
- An improved particle swarm optimization algorithm for flowshop scheduling problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- An efficient heuristic approach to the scheduling of jobs in a flowshop
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- A beam-search-based constructive heuristic for the PFSP to minimise total flowtime
- Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
- Fast heuristics for minimizing the makespan in non-permutation flow shops
- A high quality solution constructive heuristic for flow shop sequencing
- New simple constructive heuristic algorithms for minimizing total flow-time in the permutation flowshop scheduling problem
- A fast method for heuristics in large-scale flow shop scheduling
- A note on scheduling flowshops with flexible stage ordering
This page was built for publication: A new constructive heuristic for the flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1291704)
