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

DOI10.1016/J.COR.2005.02.028MaRDI QIDQ2489134zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

• scientific article; zbMATH DE number 4076953 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
• A fast tabu search algorithm for the permutation flow-shop problem
• A genetic algorithm for flowshop sequencing
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage.
• A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
• A two-machine permutation flow shop scheduling problem with buffers
• Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
• Benchmarks for basic scheduling problems
• Flow-shop problems with intermediate buffers
• Flowshop sequencing problems with limited buffer storage
• Generating Experimental Data for Computational Testing with Machine Scheduling Applications
• Genetic local search for multi-objective combinatorial optimization
• Improved genetic algorithm for the permutation flowshop scheduling problem.
• Job-shop scheduling with blocking and no-wait constraints
• Mixed integer programming for scheduling flexible flow lines with limited intermediate buffers
• On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
• Ordonnancements à contraintes disjonctives
• The application of the simulated annealing algorithm to the solution of the \(n/m/C_{\max}\) flowshop problem
• The permutation flow shop with buffers: A tabu search approach

Cited in

(24)

• A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations
• Q-learning algorithm performance for M-machine, N-jobs flow shop scheduling problems to minimize makespan
• 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
• Security based bi-objective flow shop scheduling model and its hybrid genetic algorithm
• 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
• Iterated greedy algorithms for the blocking flowshop scheduling problem with makespan criterion
• Scheduling hybrid production with buffer based on genetic algorithm
• Heuristics for flow shop rescheduling with mixed blocking constraints
• 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
• Inventory based bi-objective flow shop scheduling model and its hybrid genetic algorithm
• Reducing network and computation complexities in neural based real-time scheduling scheme
• On permutation schedules for two-machine flow shops with buffer constraints and constant processing times on one machine
• 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
• Advanced metaheuristics for bi-criteria optimization in a distributed blocking flow shop problem with setup times
• Heuristics and metaheuristics for mixed blocking constraints flowshop scheduling problems
• scientific article; zbMATH DE number 6780786 (Why is no real title available?)
• 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)