A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

DOI10.1016/S0377-2217(98)00060-5zbMATH Open0937.90035MaRDI QIDQ1296660FDOQ1296660

Authors: Fouad Riane, Abdelhakim Artiba, Salah E. Elmaghraby

Publication date: 2 August 1999

Published in: European Journal of Operational Research (Search for Journal in Brave)

Recommendations

zbMATH Keywords

heuristics scheduling hybrid flowshop

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35)

Cites Work

Cited In (33)

A Two-Stage Flexible Flowshop Problem with Deterioration
A two-stage hybrid flowshop scheduling problem with a function constraint and unrelated alternative machines
An immune algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times
Title not available (Why is that?)
Méthode heuristique pour le problème de flow shop hybride avec machines dédiées
A comparison of priority rules for minimizing the maximum lateness in tree data gathering networks
A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal
Minimizing the Makespan in the 3-Machine Assembly-Type Flowshop Scheduling Problem
Optimization study of three-stage assembly flowshop problem in pharmacy automation dispensing systems
The hybrid flow shop scheduling problem
Flow-shop scheduling for three serial stations with the last two duplicate
Title not available (Why is that?)
Makespan minimization for the \(m\)-machine ordered flow shop scheduling problem
A new heuristic for \(m\)-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness
Heuristic algorithms for multiprocessor task scheduling in a two-stage hybrid flow-shop.
Exact resolution of the two-stage hybrid flow shop with dedicated machines
Hybrid flow-shop scheduling problems with multiprocessor task systems.
Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
A genetic algorithm for hybrid flow-shop scheduling with multiprocessor tasks
Powerful heuristics to minimize makespan in fixed, 3-machine, assembly-type flowshop scheduling
A particle swarm optimization algorithm for hybrid flow-shop scheduling with multiprocessor tasks
Two-stage proportionate flexible flow shop to minimize the makespan
A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
Using the gravitational emulation local search algorithm to solve the multi-objective flexible dynamic job shop scheduling problem in small and medium enterprises
Heuristics for periodical batch job scheduling in a MapReduce computing framework
An improved migrating birds optimisation for a hybrid flowshop scheduling with total flowtime minimisation
Scheduling jobs on a \(k\)-stage flexible flow-shop
Efficiency of the solution representations for the hybrid flow shop scheduling problem with makespan objective
A new three-machine shop scheduling: complexity and approximation algorithm
Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint
Scheduling flexible flow lines with sequence-dependent setup times
Clustering and genetic algorithm based hybrid flowshop scheduling with multiple operations

This page was built for publication: A hybrid three-stage flowshop problem: Efficient heuristics to minimize makespan

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