A memetic algorithm for the flexible flow line scheduling problem with processor blocking
DOI10.1016/J.COR.2007.10.011zbMATH Open1157.90428OpenAlexW1967566448MaRDI QIDQ954039FDOQ954039
Authors: R. Tavakkoli-Moghaddam, N. Safaei, 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
Recommendations
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
- Multi-objective fuzzy flexible job shop scheduling using memetic algorithm
- A new neighborhood based Memetic algorithm for permutation flowshop scheduling problem
- Scheduling flexible flow lines with no in-process buffers
- A competent memetic algorithm for complex scheduling
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Testing Unconstrained Optimization Software
- Variable neighborhood search
- A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
- A hybrid genetic algorithm for the finite horizon economic lot and delivery scheduling in supply chains
- A comparison of scheduling algorithms for flexible flow shop problems with unrelated parallel machines, setup times, and dual criteria
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- Scheduling flexible flow lines with sequence-dependent setup times
- Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
- The finite horizon economic lot scheduling in flexible flow lines
- An efficient genetic algorithm for determining the optimal price discrimination
- Scheduling flexible flow lines with no in-process buffers
- Mixed integer programming for scheduling surface mount technology lines
- Stochastic Algorithms: Foundations and Applications
- Two metaheuristic methods for the common cycle economic lot sizing and scheduling in flexible flow shops with limited intermediate buffers: the finite horizon case
- Optimal versus heuristic scheduling of surface mount technology lines
- Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
- Title not available (Why is that?)
Cited In (13)
- Scheduling open shops with parallel machines to minimize total completion time
- Hybrid flow-shop: a memetic algorithm using constraint-based scheduling for efficient search
- A memetic algorithm for a multi-objective obnoxious waste location-routing problem: a case study
- 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
- Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
- An efficient and practically robust hybrid metaheuristic algorithm for solving fuzzy bus terminal location problems
- Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
- A memetic algorithm for bi-objective integrated forward/reverse logistics network design
- Flexible job shop scheduling with blockages
- The effect of various parameters of solution methodology on a flexible integrated supply chain model
Uses Software
This page was built for publication: A memetic algorithm for the flexible flow line scheduling problem with processor blocking
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q954039)
