An empirical analysis of the optimality rate of flow shop heuristics (Q1027589): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2008.08.021 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.08.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965349461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improvement heuristic for the flow-shop scheduling problem: an adaptive-learning approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: New heuristics for no-wait flowshops to minimize makespan. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Heuristic Algorithm for the <i>n</i> Job, <i>m</i> Machine Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different behaviour of a double branch-and-bound algorithm on \(\mathrm {Fm}|\mathrm{prmu}|C_{\max}\) and \(\mathrm {Fm}|\mathrm {block}|C_{\max}\) problems / 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: An improved NEH-based heuristic for the permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flow shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Different initial sequences for the heuristic of Nawaz, Enscore and Ham to minimize makespan, idletime or flowtime in the static permutation flowshop sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A review and classification of heuristics for permutation flow-shop scheduling with makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Flowshop and Jobshop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Departures from many queues in series / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some local search algorithms for no-wait flow-shop problem with makespan criterion / 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: Performance guarantees for flowshop heuristics to minimize makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved genetic algorithm for the permutation flowshop scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: RANLUX: A Fortran implementation of the high-quality pseudorandom number generator of Lüscher / 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: Discussion: Sequencing <i>n</i> Jobs on Two Machines with Arbitrary Time Lags / 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: A computational study of the permutation flow shop problem based on a tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete version of particle swarm optimization for flowshop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sevast'yanov's algorithm for the flow-shop scheduling problem / 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: New results in the worst-case analysis for flow-shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on worst-case analysis of approximation algorithms for a scheduling problem / 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: Scheduling flow shops using differential evolution algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525911 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3142061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546263 / 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 Probabilistic Analysis of Two-Machine Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop-scheduling problems with makespan criterion: a review / 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: Vector Summation in Banach Space and Polynomial Algorithms for Flow Shops and Open Shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Shop Scheduling Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results of the worst-case analysis for flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on permutation 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: 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: An ant colony system for permutation flow-shop sequencing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2008.08.021 / rank
 
Normal rank

Latest revision as of 13:43, 10 December 2024

scientific article
Language Label Description Also known as
English
An empirical analysis of the optimality rate of flow shop heuristics
scientific article

    Statements

    An empirical analysis of the optimality rate of flow shop heuristics (English)
    0 references
    0 references
    0 references
    30 June 2009
    0 references
    scheduling
    0 references
    flow shop
    0 references
    makespan
    0 references
    heuristics
    0 references
    optimality
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers