Reduction of permutation flowshop problems to single machine problems using machine dominance relations (Q1652025): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2016.07.009 / 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.cor.2016.07.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2465589296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpreemptive flowshop scheduling with machine dominance / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on flow shop scheduling problems with a learning effect on no-idle dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Benchmarks for shop scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-restart iterated local search algorithm for the permutation flow shop problem minimizing total flow time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Development of <i>M</i>-Stage Decision Rule for Scheduling N Jobs Through <i>M</i> Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in machine dominated flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new set of high-performing heuristics to minimise flowtime in permutation flowshops / 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: On insertion tie-breaking rules in heuristics for the permutation flowshop scheduling 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: Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparison of heuristics for flowtime minimisation in permutation flowshops / 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: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Numerical Experiments for an <i>M</i> × <i>J</i> Flow Shop and its Decision-Theoretical Aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flowshop scheduling with dominant machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187195 / 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: Variability of completion time differences in permutation flow shop scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A concise survey of efficiently solvable special cases of the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling permutation flowshops with initial availability constraint: Analysis of solutions and constructive heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for flowshop sequencing / 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: 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: Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutation flow shop scheduling with dominant machines to minimize discounted total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2016.07.009 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:07, 11 December 2024

scientific article
Language Label Description Also known as
English
Reduction of permutation flowshop problems to single machine problems using machine dominance relations
scientific article

    Statements

    Reduction of permutation flowshop problems to single machine problems using machine dominance relations (English)
    0 references
    0 references
    11 July 2018
    0 references
    scheduling
    0 references
    flowshop
    0 references
    processing times
    0 references
    PFSP
    0 references
    makespan
    0 references
    flowtime
    0 references
    single machine
    0 references
    dominating machine
    0 references
    0 references
    0 references

    Identifiers