An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (Q947958): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2007.08.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075370257 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast tabu search algorithm for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New block properties for the permutation flow shop problem with application in tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm to minimize the makespan in a flowshop with blocking / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3807868 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine permutation flow shop scheduling problem with buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The permutation flow shop with buffers: A tabu search approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop sequencing problems with limited buffer storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop problems with intermediate buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of flow shop scheduling problems with transportation constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markovian analysis for performance evaluation and scheduling in \(m\) machine stochastic flow-shop with buffers of any capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch scheduling in a two-machine flow shop with limited buffer and sequence independent setup times and removal times. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach for batch scheduling in flexible flow lines with limited intermediate buffers. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3970631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3607719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving multi-objective production scheduling problems using metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic local search for multi-objective combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic local search for multi-objective flowshop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Differential evolution -- a simple and efficient heuristic for global optimization over continuous spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667349 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling flow shops using differential evolution algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Permutation-Based Differential Evolution Algorithm Incorporating Simulated Annealing for Multiprocessor Scheduling with Communication Delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Landscapes, operators and heuristic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some aspects of scatter search in the flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some efficient heuristic methods for the flow shop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4817405 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Genetic Algorithms and Random Keys for Sequencing and Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review of metrics on permutations for search landscape analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: On operators and search space topology in multi-objective flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3876725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization / rank
 
Normal rank

Revision as of 17:05, 28 June 2024

scientific article
Language Label Description Also known as
English
An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers
scientific article

    Statements

    An effective hybrid DE-based algorithm for multi-objective flow shop scheduling with limited buffers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    8 October 2008
    0 references
    differential evolution
    0 references
    multi-objective flow shop scheduling
    0 references
    limited buffers
    0 references
    hybrid algorithm
    0 references
    local search
    0 references
    exploration and exploitation
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers