A genetic algorithm for the proportionate multiprocessor open shop

DOI10.1016/J.COR.2008.11.009zbMATH Open1179.90144OpenAlexW1973445991MaRDI QIDQ1010271FDOQ1010271

Authors: 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

Recommendations

• Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
• Competitive genetic algorithms for the open-shop scheduling problem
• A genetic algorithm for an industrial multiprocessor flow shop scheduling problem with recircu\-lation
• A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
• Solving flexible job shop scheduling problem by genetic algorithm

zbMATH Keywords

sequencingdeterministicmultiple 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)

Cites Work

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

Cited In (13)

• A tabu search approach for proportionate multiprocessor open shop scheduling
• 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 approximation algorithms for proportionate open-shop scheduling
• The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
• A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
• Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
• Flexible open shop scheduling problem to minimize makespan
• OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
• Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
• 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
• Competitive genetic algorithms for the open-shop scheduling problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1010271)