An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
From MaRDI portal
Publication:947958
DOI10.1016/j.cor.2007.08.007zbMath1163.90507OpenAlexW2075370257MaRDI QIDQ947958
De-Xian Huang, Bin Qian, Ling Wang, Xiong Wang, Wan-Liang Wang
Publication date: 8 October 2008
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2007.08.007
local searchdifferential evolutionhybrid algorithmmulti-objective flow shop schedulingexploration and exploitationlimited buffers
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (11)
Clustered enhanced differential evolution for the blocking flow shop scheduling problem ⋮ A HYBRID HARMONY SEARCH ALGORITHM FOR THE NO-WAIT FLOW-SHOP SCHEDULING PROBLEMS ⋮ A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion ⋮ A multi-objective differential evolution algorithm for parallel batch processing machine scheduling considering electricity consumption cost ⋮ Flexible open shop scheduling problem to minimize makespan ⋮ Hybrid discrete differential evolution algorithm for biobjective cyclic hoist scheduling with reentrance ⋮ Bi-objective no-wait multiproduct multistage product scheduling problem with flexible due dates based on MOIDE-MA ⋮ An enhanced differential evolution algorithm with fast evaluating strategies for TWT-NFSP with SSTs and RTs ⋮ Differential evolution metaheuristics for distributed limited-buffer flowshop scheduling with makespan criterion ⋮ A novel differential evolution algorithm for bi-criteria no-wait flow shop scheduling problems ⋮ A novel hybrid discrete differential evolution algorithm for blocking flow shop scheduling problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking
- Scheduling flow shops using differential evolution algorithm
- On operators and search space topology in multi-objective flow shop scheduling
- A review of metrics on permutations for search landscape analysis
- Some efficient heuristic methods for the flow shop sequencing problem
- A fast tabu search algorithm for the permutation flow-shop problem
- A two-machine permutation flow shop scheduling problem with buffers
- Landscapes, operators and heuristic search
- A genetic algorithm for flowshop sequencing
- Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces
- An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers.
- Flow-shop problems with intermediate buffers
- Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times.
- A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities.
- The permutation flow shop with buffers: A tabu search approach
- Complexity of flow shop scheduling problems with transportation constraints
- Solving multi-objective production scheduling problems using metaheuristics
- Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity
- Benchmarks for basic scheduling problems
- An effective hybrid genetic algorithm for flow shop scheduling with limited buffers
- Genetic local search for multi-objective flowshop scheduling problems
- Some aspects of scatter search in the flow-shop problem
- Flowshop sequencing problems with limited buffer storage
- A Permutation-Based Differential Evolution Algorithm Incorporating Simulated Annealing for Multiprocessor Scheduling with Communication Delays
- On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness
- Flowshop scheduling with limited temporary storage
- Ordonnancements à contraintes disjonctives
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- New block properties for the permutation flow shop problem with application in tabu search
- A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process
- Genetic local search for multi-objective combinatorial optimization
This page was built for publication: An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
