Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
From MaRDI portal
Publication:2003565
Recommendations
- Shifting representation search for hybrid flexible flowline problems
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Hybrid flexible flowshop problems: models and solution methods
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- Metaheuristic algorithms for the hybrid flowshop scheduling problem
Cites work
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 1462947 (Why is no real title available?)
- A comprehensive review and evaluation of permutation flowshop heuristics
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Algorithms for a realistic variant of flowshop scheduling
- An Exact Method for Solving the Multi-Processor Flow-Shop
- Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- Heuristics for scheduling in a flow shop with multiple processors
- Hybrid flexible flowshop problems: models and solution methods
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
- Minimizing makespan in hybrid flowshops
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Scheduling multi-stage parallel-processor services to minimize average response time
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- Shifting representation search for hybrid flexible flowline problems
- Simple priority rule combinations: An approach to improve both flow time and tardiness
- The flow shop with parallel machines: A tabu search approach
- The hybrid flow shop scheduling problem
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
Cited in
(8)- A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation
- A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
- Flowshop-scheduling problems with makespan criterion: a review
- Shifting representation search for hybrid flexible flowline problems
- A review and classification on distributed permutation flowshop scheduling problems
- A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
- Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem
- A systematic review of multi-objective hybrid flow shop scheduling
This page was built for publication: Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2003565)
