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

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2018.04.024 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: CPLEX / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.amc.2018.04.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2801954026 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unrelated parallel batch processing machines with non-identical job sizes and unequal ready times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic algorithm based scheduling of parallel batch machines with incompatible job families to minimize total weighted tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimising makespan on parallel batch processing machines with non-identical ready time and arbitrary job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the makespan on a batch machine with non-identical job sizes: An exact procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient scheduling algorithms for a single batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved meta-heuristic for makespan minimization of a single batch machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A meta-heuristic to minimize makespan for parallel batch machines with arbitrary job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single batch-processing machine with arbitrary job sizes and incompatible job families: An ant colony framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective hybrid genetic algorithm for minimizing makespan on a single-batch-processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Algorithms for Scheduling Semiconductor Burn-In Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with agreeable release times and due dates on a batch processing machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batching machine with release times and non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling unrelated parallel batch processing machines with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feature Article—Genetic Algorithms for the Operations Researcher / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single burn-in oven in semiconductor manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single burn-in oven with job families and dynamic job arrivals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriteria scheduling on a single batching machine with job transportation and deterioration considerations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a single batch processing machine with non-identical job sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5367825 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on a single batch processing machine with nonidentical job sizes / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129885005 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2018.04.024 / rank
 
Normal rank

Latest revision as of 01: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

    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
    14 November 2019
    0 references
    scheduling
    0 references
    unrelated parallel machines
    0 references
    batch processing machines
    0 references
    random-keys genetic algorithm
    0 references
    0 references

    Identifiers