A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (Q2335532): Difference between revisions

Latest revision as of 02:51, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes	scientific article

Statements

instance of

scholarly article

0 references

title

A random-keys genetic algorithm for scheduling unrelated parallel batch processing machines with different capacities and arbitrary job sizes (English)

0 references

0 references

0 references

0 references

0 references

Applied Mathematics and Computation

0 references

publication date

14 November 2019

0 references

zbMATH Keywords

scheduling

0 references

unrelated parallel machines

0 references

batch processing machines

0 references

random-keys genetic algorithm

0 references

describes a project that uses

CPLEX

0 references

MaRDI profile type

Publication

0 references

full work available at URL

https://doi.org/10.1016/j.amc.2018.04.024

0 references

cites work

0 references

Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness

0 references

Scheduling a batching machine

0 references

Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes

0 references

Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure

0 references

Efficient scheduling algorithms for a single batch processing machine

0 references

An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes

0 references

A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes

0 references

Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework

0 references

Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes

0 references

Minimizing makespan on a single batch processing machine with dynamic job arrivals

0 references

Efficient Algorithms for Scheduling Semiconductor Burn-In Operations

0 references

Scheduling with agreeable release times and due dates on a batch processing machine

0 references

Minimizing makespan on a single batching machine with release times and non-identical job sizes

0 references

Feature Article—Genetic Algorithms for the Operations Researcher

0 references

Minimizing makespan on a single burn-in oven in semiconductor manufacturing

0 references

Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals

0 references

Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations

0 references

Scheduling a single batch processing machine with non-identical job sizes

0 references

Q5367825

0 references

Minimizing makespan on a single batch processing machine with nonidentical job sizes

0 references

Identifiers

zbMATH Open document ID

1427.90166

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

10.1016/J.AMC.2018.04.024

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2335532

@@ Property / DOI @@
-.1016/j.amc.2018.04.024
@@ Property / DOI: 10.1016/j.amc.2018.04.024 / rank @@
-Normal rank
@@ Property / DOI @@
+.1016/J.AMC.2018.04.024
@@ Property / DOI: 10.1016/J.AMC.2018.04.024 / rank @@
+Normal rank