A genetic algorithm for the proportionate multiprocessor open shop

DOI10.1016/j.cor.2008.11.009zbMath1179.90144OpenAlexW1973445991MaRDI QIDQ1010271

Marie E. Matta

Publication date: 3 April 2009

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2008.11.009

zbMATH Keywords

deterministicsequencingmultiple machines: proportionate multiprocessor open shopproduction/schedulingprogramming: genetic algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35)

Related Items (10)

Flexible open shop scheduling problem to minimize makespan ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling ⋮ OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises ⋮ Large-scale medical examination scheduling technology based on intelligent optimization ⋮ A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop ⋮ Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling algorithms for flexible flowshops: Worst and average case performance
• Scheduling open shops with parallel machines
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• Makespan minimization in open shops: A polynomial time approximation scheme
• Approximation algorithms for the multiprocessor open shop scheduling problem
• Worst-case analysis of heuristics for open shops with parallel machines
• A genetic algorithm for flowshop sequencing
• A genetic algorithm for the job shop problem
• A hybrid genetic algorithm for the open shop scheduling problem
• Local search algorithms for the multiprocessor flow shop scheduling problem
• The flow shop with parallel machines: A tabu search approach
• An Adaptable Scheduling Algorithm for Flexible Flow Lines
• Open Shop Scheduling to Minimize Finish Time
• The Complexity of Flowshop and Jobshop Scheduling
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• Genetic Algorithms and Random Keys for Sequencing and Optimization
• Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
• Short Shop Schedules
• Linear time approximation scheme for the multiprocessor open shop problem

This page was built for publication: A genetic algorithm for the proportionate multiprocessor open shop