Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints (Q833543): Difference between revisions

Latest revision as of 04:34, 10 December 2024

scientific article

Language	Label	Description	Also known as
English	Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints	scientific article

Statements

instance of

scholarly article

0 references

title

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints (English)

0 references

author

N. E. Zubov

0 references

published in

Computers \& Operations Research

0 references

publication date

14 August 2009

0 references

zbMATH Keywords

bi-objective parallel machine scheduling

0 references

sequence-dependent setup times

0 references

precedence constraints

0 references

genetic algorithm

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.cor.2009.02.012

0 references

cites work

A tabu search algorithm for parallel machine total tardiness problem

0 references

Early/tardy scheduling with sequence dependent setups on uniform parallel machines

0 references

Parallel machine scheduling with earliness and tardiness penalties

0 references

Scheduling parallel processors to minimize setup time

0 references

Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times

0 references

On the Complexity of Scheduling with Batch Setup Times

0 references

Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times

0 references

A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families

0 references

Minimizing earliness and tardiness subject to total completion time in an identical parallel machine system

0 references

Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times

0 references

List scheduling in a parallel machine environment with precedence constraints and setup times

0 references

Bi-criteria scheduling problems: Number of tardy jobs and maximum weighted tardiness

0 references

Q4692508

0 references

A memetic algorithm for the flexible flow line scheduling problem with processor blocking

0 references

Identifiers

zbMATH Open document ID

1176.90247

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

10.1016/J.COR.2009.02.012

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:833543

@@ Property / DOI @@
-.1016/J.COR.2009.02.012
@@ Property / DOI: 10.1016/J.COR.2009.02.012 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.COR.2009.02.012
@@ Property / DOI: 10.1016/J.COR.2009.02.012 / rank @@
+Normal rank