A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
type: Item
instance of: scholarly article
title: A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility
zbMATH Open document ID: 1458.90379
author: Chunlong Yu
author: Quirico Semeraro
author: Andrea Matta
published in: Computers \& Operations Research
publication date: 2018-09-18T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6938903
zbMATH Keywords: scheduling
zbMATH Keywords: hybrid flow shop
zbMATH Keywords: genetic algorithm
describes a project that uses: Genocop
describes a project that uses: BPSS
MaRDI profile type: Publication
full work available at URL: j.cor.2018.07.025
OpenAlex ID: W2886663814
Wikidata QID: Q105789937
cites work: Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study
cites work: A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
cites work: Minimizing total tardiness of orders with reentrant lots in a hybrid flowshop
cites work: Iterated greedy local search methods for unrelated parallel machine scheduling
cites work: Q3829367
cites work: Two-Stage, Hybrid Flowshop Scheduling Problem
cites work: Q4187195
cites work: A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
cites work: Scheduling flexible flow lines with sequence-dependent setup times
cites work: Bottleneck-focused scheduling for a hybrid flowshop
cites work: Q4873721
cites work: A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
cites work: Iterated search methods for earliness and tardiness minimization in hybrid flowshops with due windows
cites work: Scheduling
cites work: Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
cites work: A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
cites work: The hybrid flow shop scheduling problem
cites work: A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines
cites work: A memetic algorithm for the flexible flow line scheduling problem with processor blocking
cites work: Genetic algorithms with different representation schemes for complex hybrid flexible flow line problems
cites work: Shifting representation search for hybrid flexible flowline problems
cites work: Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art
cites work: A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
cites work: Multiprocessor task scheduling in multistage hybrid flow-shops: an ant colony system approach
cites work: An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
DOI: 10.1016/J.COR.2018.07.025
description: scientific article; zbMATH DE number 6938903