Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
type: Item
instance of: scholarly article
title: Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
zbMATH Open document ID: 1176.90247
author: N. E. Zubov
published in: Computers \& Operations Research
publication date: 2009-08-14T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C11
zbMATH DE Number: 5595294
zbMATH Keywords: bi-objective parallel machine scheduling
zbMATH Keywords: sequence-dependent setup times
zbMATH Keywords: precedence constraints
zbMATH Keywords: genetic algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2009.02.012
OpenAlex ID: W2054944815
cites work: A tabu search algorithm for parallel machine total tardiness problem
cites work: Early/tardy scheduling with sequence dependent setups on uniform parallel machines
cites work: Parallel machine scheduling with earliness and tardiness penalties
cites work: Scheduling parallel processors to minimize setup time
cites work: Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times
cites work: On the Complexity of Scheduling with Batch Setup Times
cites work: Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times
cites work: A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
cites work: Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system
cites work: Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times
cites work: List scheduling in a parallel machine environment with precedence constraints and setup times
cites work: Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness
cites work: Q4692508
cites work: A memetic algorithm for the flexible flow line scheduling problem with processor blocking
DOI: 10.1016/J.COR.2009.02.012
description: scientific article; zbMATH DE number 5595294