A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
From MaRDI portal
(Redirected from Publication:1296660)
Recommendations
- Minimizing makespan in hybrid flowshops
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- Heuristic algorithms for the two-stage hybrid flowshop problem
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- scientific article; zbMATH DE number 522730
- New heuristics for flow shop problem to minimize makespan
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Hybrid Flow Shop Scheduling: Heuristic Solutions and LP-Based Lower Bounds
- Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm
- scientific article; zbMATH DE number 4137521
Cites work
Cited in
(33)- A Two-Stage Flexible Flowshop Problem with Deterioration
- A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
- An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
- scientific article; zbMATH DE number 522730 (Why is no real title available?)
- Méthode heuristique pour le problème de flow shop hybride avec machines dédiées
- A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
- A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
- A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks
- Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
- Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems
- The hybrid flow shop scheduling problem
- Flow-shop scheduling for three serial stations with the last two duplicate
- Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
- scientific article; zbMATH DE number 5052107 (Why is no real title available?)
- Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
- A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
- Exact resolution of the two-stage hybrid flow shop with dedicated machines
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
- Two-stage proportionate flexible flow shop to minimize the makespan
- A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
- Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
- Heuristics for periodical batch job scheduling in a MapReduce computing framework
- An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
- A new three-machine shop scheduling: complexity and approximation algorithm
- Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
- Scheduling flexible flow lines with sequence-dependent setup times
- Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations
This page was built for publication: A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296660)
