A memetic algorithm for the flexible flow line scheduling problem with processor blocking

DOI10.1016/j.cor.2007.10.011zbMath1157.90428OpenAlexW1967566448MaRDI QIDQ954039

Nima Safaei, Reza Tavakkoli-Moghaddam, Farrokh Sassani

Publication date: 7 November 2008

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

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

zbMATH Keywords

variable neighbourhood searchmemetic algorithmsflexible flow lineprocessor blocking

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (12)

Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints ⋮ Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ AN EFFICIENT AND PRACTICALLY ROBUST HYBRID METAHEURISTIC ALGORITHM FOR SOLVING FUZZY BUS TERMINAL LOCATION PROBLEMS ⋮ A memetic algorithm for bi-objective integrated forward/reverse logistics network design ⋮ A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study ⋮ Scheduling open shops with parallel machines to minimize total completion time ⋮ The effect of various parameters of solution methodology on a flexible integrated supply chain model ⋮ Flexible job shop scheduling with blockages ⋮ A comparison between memetic algorithm and genetic algorithm for an integrated logistics network with flexible delivery path ⋮ Variable neighbourhood search: methods and applications ⋮ The hybrid flow shop scheduling problem ⋮ A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• An efficient genetic algorithm for determining the optimal price discrimination
• Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case
• Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
• A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
• Variable neighborhood search
• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
• Scheduling flexible flow lines with sequence-dependent setup times
• A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
• Optimal versus heuristic scheduling of surface mount technology lines
• Testing Unconstrained Optimization Software
• Scheduling flexible flow lines with no in-process buffers
• Mixed integer programming for scheduling surface mount technology lines
• Stochastic Algorithms: Foundations and Applications

This page was built for publication: A memetic algorithm for the flexible flow line scheduling problem with processor blocking