Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
From MaRDI portal
Publication:2003565
DOI10.1016/j.cor.2019.05.002zbMath1458.90291OpenAlexW2943474422MaRDI QIDQ2003565
Jose M. Framinan, Victor Fernandez-Viagas, Paz Perez-Gonzalez
Publication date: 9 July 2019
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/handle//11441/95243
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (4)
Effective constructive heuristics for distributed no-wait flexible flow shop scheduling problem ⋮ A review and classification on distributed permutation flowshop scheduling problems ⋮ A systematic review of multi-objective hybrid flow shop scheduling ⋮ A simulation-optimization model for solving flexible flow shop scheduling problems with rework and transportation
Cites Work
- Unnamed Item
- Unnamed Item
- Algorithms for a realistic variant of flowshop scheduling
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
- A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
- Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
- Shifting representation search for hybrid flexible flowline problems
- Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
- Minimizing makespan in hybrid flowshops
- Hybrid flow-shop scheduling problems with multiprocessor task systems.
- The flow shop with parallel machines: A tabu search approach
- Hybrid flexible flowshop problems: models and solution methods
- Reduction of permutation flowshop problems to single machine problems using machine dominance relations
- Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
- Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
- A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
- A comprehensive review and evaluation of permutation flowshop heuristics
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
- Heuristics for scheduling in a flow shop with multiple processors
- The hybrid flow shop scheduling problem
- Scheduling jobs on a \(k\)-stage flexible flow-shop
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- Scheduling multi-stage parallel-processor services to minimize average response time
- Two-Stage, Hybrid Flowshop Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Simple priority rule combinations: An approach to improve both flow time and tardiness
- Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
- An Exact Method for Solving the Multi-Processor Flow-Shop
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
This page was built for publication: Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
