An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

DOI10.1016/J.COR.2005.02.028zbMATH Open1086.90029OpenAlexW4233663429MaRDI QIDQ2489134FDOQ2489134

Authors: Ling Wang, L. Zhang, Dazhong Zheng 

Publication date: 16 May 2006

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

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

Recommendations

• An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
• Hybrid genetic algorithm for permutation flowshop scheduling problems with total flowtime minimization

zbMATH Keywords

Genetic algorithmLimited buffersFlow shop schedulingDecision probabilityHybrid optimization

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Genetic local search for multi-objective combinatorial optimization
• A genetic algorithm for flowshop sequencing
• A fast tabu search algorithm for the permutation flow-shop problem
• Benchmarks for basic scheduling problems
• Ordonnancements à contraintes disjonctives
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• A two-machine permutation flow shop scheduling problem with buffers
• The permutation flow shop with buffers: A tabu search approach
• Flowshop sequencing problems with limited buffer storage
• Job-shop scheduling with blocking and no-wait constraints
• Flow-shop problems with intermediate buffers
• 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
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
• Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
• Title not available (Why is that?)

Cited In (21)

• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers
• A variable block insertion heuristic for the blocking flowshop scheduling problem with total flowtime criterion
• Performance Study of a Genetic Algorithm for Sequencing in Mixed Model Non-permutation Flowshops Using Constrained Buffers
• A note of using effective immune based approach for the flow shop scheduling with buffers
• Heuristics for flow shop rescheduling with mixed blocking constraints
• Scheduling hybrid production with buffer based on genetic algorithm
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• An effective hybrid DE-based algorithm for flow shop scheduling with limited buffers
• Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion
• An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
• A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion
• On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
• Reducing network and computation complexities in neural based real-time scheduling scheme
• Title not available (Why is that?)
• A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
• Evolutionary multiobjective optimization for the multi-machine flow shop scheduling problem under blocking
• Title not available (Why is that?)
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
• Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems

This page was built for publication: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers

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