An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine (Q6084515): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A bicriteria two-machine flow-shop serial-batching scheduling problem with bounded batch size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop problems with intermediate buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation schedules for a two-machine flow shop with storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note of using effective immune based approach for the flow shop scheduling with buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: The variable neighborhood search for the two machine flow shop problem with a passive prefetch / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-machine flowshop problem with processing time-dependent buffer constraints-an application in multimedia presentations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective hybrid PSO-based algorithm for flow shop scheduling with limited buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of flowshop scheduling problems with a new blocking constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid variable neighborhood search algorithm for solving the limited-buffer permutation flow shop scheduling problem with the makespan criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with limited temporary storage / 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: New hard benchmark for flowshop scheduling problems minimising makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective hybrid genetic algorithm for flow shop scheduling with limited buffers / rank
 
Normal rank

Latest revision as of 09:14, 21 August 2024

scientific article; zbMATH DE number 7772900
Language Label Description Also known as
English
An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine
scientific article; zbMATH DE number 7772900

    Statements

    An iterated local search algorithm for the two-machine flow shop problem with buffers and constant processing times on one machine (English)
    0 references
    0 references
    0 references
    0 references
    1 December 2023
    0 references
    flow shops with buffers
    0 references
    iterated local search
    0 references
    NEH heuristic
    0 references
    permutation schedules
    0 references

    Identifiers