Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (Q337017): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90B35 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650665 / rank
 
Normal rank
Property / zbMATH Keywords
 
scheduling
Property / zbMATH Keywords: scheduling / rank
 
Normal rank
Property / zbMATH Keywords
 
re-entrant flowshop
Property / zbMATH Keywords: re-entrant flowshop / rank
 
Normal rank
Property / zbMATH Keywords
 
sequence-dependent setup times
Property / zbMATH Keywords: sequence-dependent setup times / rank
 
Normal rank
Property / zbMATH Keywords
 
branch and bound
Property / zbMATH Keywords: branch and bound / rank
 
Normal rank
Property / zbMATH Keywords
 
heuristics
Property / zbMATH Keywords: heuristics / 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.2014.02.002 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027361800 / 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: Minimizing makespan on a two-machine re-entrant flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-machine flowshop scheduling problem with total tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note on minimizing total tardiness in a two-machine flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness in permutation flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focused Scheduling in Proportionate Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search for total tardiness minimization in flowshop scheduling problems / 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: The Total Tardiness Problem: Review and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition methods for reentrant flow shops with sequence-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan on an \(m\)-machine re-entrant flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-family scheduling in a two-machine reentrant flow shop with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness on a two-machine re-entrant flowshop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing makespan in re-entrant permutation flow-shops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual algorithm for the one-machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:46, 12 July 2024

scientific article
Language Label Description Also known as
English
Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times
scientific article

    Statements

    Minimizing total tardiness in a two-machine re-entrant flowshop with sequence-dependent setup times (English)
    0 references
    0 references
    0 references
    10 November 2016
    0 references
    0 references
    scheduling
    0 references
    re-entrant flowshop
    0 references
    sequence-dependent setup times
    0 references
    branch and bound
    0 references
    heuristics
    0 references
    0 references