A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks

DOI10.1007/s10951-005-1640-yzbMath1123.90314OpenAlexW2065067435MaRDI QIDQ880507

M. Fikret Ercan, Oguz, Ceyda

Publication date: 15 May 2007

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-005-1640-y

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search, Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective, Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect, Taking advantage of a diverse set of efficient production schedules: a two-step approach for scheduling with side concerns, The optimal number of used machines in a two-stage flexible flowshop scheduling problem, Batch scheduling in a two-stage flexible flow shop problem, A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks, A two-stage flow shop scheduling with a critical machine and batch availability, Bi-objective approaches for home healthcare medical team planning and scheduling problem, Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective, The production scheduling problem in a multi-page invoice printing system, The hybrid flow shop scheduling problem, A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility, Multi-objective two-stage multiprocessor flow shop scheduling – a subgroup particle swarm optimisation approach, Machine scheduling in production: a content analysis, Solving a Mathematical Model for Small Vegetable Sellers in India by a Stochastic Knapsack Problem: An Advanced Genetic Algorithm Based Approach

Uses Software

• Genocop

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Scheduling independent two processor tasks on a uniform duo-processor system
• Global lower bounds for flow shops with multiple processors
• Polynomial algorithms for resource-constrained and multiprocessor task scheduling problems
• Scheduling multiprocessor tasks -- An overview
• Branch and bound crossed with GA to solve hybrid flowshops
• A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan
• A genetic algorithm for flowshop sequencing
• A genetic algorithm for the job shop problem
• Evolution based learning in a job shop scheduling environment
• Heuristic algorithms for the two-stage hybrid flowshop problem
• Current trends in deterministic scheduling
• Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
• Scheduling UET task systems with concurrency on two parallel identical processors
• Hybrid flow-shop scheduling problems with multiprocessor task systems.
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• Shop scheduling problems with multiprocessor tasks on dedicated processors
• Scheduling Multiprocessor Tasks to Minimize Schedule Length
• Two-Stage, Hybrid Flowshop Scheduling Problem
• Complexity of Scheduling Parallel Task Systems
• Concurrent Task Systems
• Les problèmes d'ordonnancement de type flow-shop hybride : état de l'art