An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (Q2475841): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2006.12.013 / 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: Flowshop scheduling with limited temporary storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Two-Machine Flow-Shops with Finite Intermediate Storage / 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: Complexity of flow shop scheduling problems with transportation constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Sequencing with Finite Intermediate 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: The permutation flow shop with buffers: A tabu search approach / 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: Flow-shop problems with intermediate buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing in an Assembly Line with Blocking to Minimize Cycle Time / 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: A tabu search algorithm for the multi-stage parallel machine problem with limited buffer capacities. / 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: 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: Directing orbits of chaotic systems by particle swarm optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved particle swarm optimization combined with chaos / 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: Variable neighborhood search: Principles and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective hybrid optimization strategy for job-shop scheduling problems / 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 / DOI
 
Property / DOI: 10.1016/J.COR.2006.12.013 / rank
 
Normal rank

Latest revision as of 21:02, 18 December 2024

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

    Statements

    An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers (English)
    0 references
    0 references
    0 references
    0 references
    11 March 2008
    0 references
    flow shop scheduling
    0 references
    limited buffers
    0 references
    hybrid algorithm
    0 references
    particle swarm optimization
    0 references
    adaptive meta-Lamarckian learning
    0 references
    simulated annealing
    0 references

    Identifiers