Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
type: Item
instance of: scholarly article
title: Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
zbMATH Open document ID: 1458.90291
author: Victor Fernandez-Viagas
author: Paz Perez-Gonzalez
author: Jose M. Framinan
published in: Computers \& Operations Research
publication date: 2019-07-09T00:00:00Z
full work available at URL: https://idus.us.es/handle//11441/95243
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 7077665
zbMATH Keywords: scheduling
zbMATH Keywords: hybrid flow shop
zbMATH Keywords: MILP
zbMATH Keywords: complete enumeration
zbMATH Keywords: makespan
zbMATH Keywords: solution representation
zbMATH Keywords: review
zbMATH Keywords: flowshop
MaRDI profile type: Publication
OpenAlex ID: W2943474422
cites work: Scheduling multi-stage parallel-processor services to minimize average response time
cites work: Simple priority rule combinations: An approach to improve both flow time and tardiness
cites work: Parallel genetic algorithms with migration for the hybrid flow shop scheduling problem
cites work: Heuristics for scheduling in a flow shop with multiple processors
cites work: Comparison of Scheduling Rules in a Flow Shop with Multiple Processors: A Simulation
cites work: An Exact Method for Solving the Multi-Processor Flow-Shop
cites work: Reduction of permutation flowshop problems to single machine problems using machine dominance relations
cites work: A new vision of approximate methods for the permutation flowshop to minimise makespan: state-of-the-art and computational evaluation
cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
cites work: Two-Stage, Hybrid Flowshop Scheduling Problem
cites work: Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
cites work: Q4487091
cites work: Minimizing makespan in hybrid flowshops
cites work: Hybrid flexible flowshop problems: models and solution methods
cites work: Algorithms for a realistic variant of flowshop scheduling
cites work: The flow shop with parallel machines: A tabu search approach
cites work: A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
cites work: Hybrid flow-shop scheduling problems with multiprocessor task systems.
cites work: Effective metaheuristics for scheduling a hybrid flowshop with sequence-dependent setup times
cites work: Scheduling jobs on a \(k\)-stage flexible flow-shop
cites work: Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics
cites work: Q3525910
cites work: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
cites work: A comprehensive review and evaluation of permutation flowshop heuristics
cites work: The hybrid flow shop scheduling problem
cites work: Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
cites work: Shifting representation search for hybrid flexible flowline problems
cites work: A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
cites work: Two-stage no-wait hybrid flowshop scheduling with inter-stage flexibility
DOI: 10.1016/J.COR.2019.05.002
description: scientific article; zbMATH DE number 7077665