A genetic algorithm for the proportionate multiprocessor open shop
From MaRDI portal
(Redirected from Publication:1010271)
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
Cites work
- A genetic algorithm for flowshop sequencing
- A genetic algorithm for the job shop problem
- A hybrid genetic algorithm for the open shop scheduling problem
- A multi-stage parallel-processor flowshop problem with minimum flowtime
- An Adaptable Scheduling Algorithm for Flexible Flow Lines
- Approximation algorithms for the multiprocessor open shop scheduling problem
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Genetic Algorithms for Combinatorial Optimization: The Assemble Line Balancing Problem
- scientific article; zbMATH DE number 5345853 (Why is no real title available?)
- scientific article; zbMATH DE number 43238 (Why is no real title available?)
- scientific article; zbMATH DE number 3466794 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 1500536 (Why is no real title available?)
- scientific article; zbMATH DE number 4115948 (Why is no real title available?)
- Linear time approximation scheme for the multiprocessor open shop problem
- Local search algorithms for the multiprocessor flow shop scheduling problem
- Makespan minimization in open shops: A polynomial time approximation scheme
- Open Shop Scheduling to Minimize Finish Time
- Scheduling algorithms for flexible flowshops: Worst and average case performance
- Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
- Scheduling open shops with parallel machines
- Short Shop Schedules
- The Complexity of Flowshop and Jobshop Scheduling
- The flow shop with parallel machines: A tabu search approach
- Worst-case analysis of heuristics for open shops with parallel machines
Cited in
(13)- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- Competitive genetic algorithms for the open-shop scheduling problem
- The development of genetic algorithms for the finite capacity scheduling of complex products, with multiple levels of product structure.
- Large-scale medical examination scheduling technology based on intelligent optimization
- A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop
- A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times
- A tabu search approach for proportionate multiprocessor open shop scheduling
- Flexible open shop scheduling problem to minimize makespan
- Multiprocessor task scheduling in multistage hybrid flow-shops: a genetic algorithm approach
- OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises
- Polynomial time approximation algorithms for proportionate open-shop scheduling
- 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
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)
