Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (Q342177): 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.2015.08.001 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2199221478 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flow-shop problems with intermediate buffers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Three-Machine Flow Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation of Flow Shop Sequencing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved NEH-based heuristic for the permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for nonlinear and parametric optimization (with links to genetic algorithms) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop and Jobshop Schedules: Complexity and Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion / 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: An improved NEH heuristic to minimize makespan in permutation flow shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical analysis of the optimality rate of flow shop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2997911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new constructive heuristic for the flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic-Programming Solution of a Flowshop-Scheduling Problem / 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: Tight Bounds for Permutation Flow Shop Scheduling / 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: Permutation vs. non-permutation flow shop schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant-colony algorithms for permutation flowshop scheduling to minimize makespan/total flowtime of jobs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling 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: Benchmarks for basic scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A particle swarm optimization algorithm for makespan and total flowtime minimization in the permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in permutation flow shop scheduling problems using a hybrid metaheuristic algorithm / rank
 
Normal rank

Latest revision as of 23:58, 12 July 2024

scientific article
Language Label Description Also known as
English
Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops
scientific article

    Statements

    Two simple and effective heuristics for minimizing the makespan in non-permutation flow shops (English)
    0 references
    0 references
    0 references
    17 November 2016
    0 references
    scheduling
    0 references
    metaheuristics
    0 references
    flow shop
    0 references
    non-permutation schedules
    0 references
    0 references

    Identifiers