Minimizing total tardiness in permutation flowshops (Q1127155): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Tardiness on One Machine is NP-Hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lessons of Flowshop Scheduling Research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3938812 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new integer programming formulation for the permutation flowshop problem / 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: On Flow Shop Scheduling with Release and Due Dates to Minimize Maximum Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating improved dominance conditions for the flowshop problem / 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: Heuristics for Flowshop Scheduling Problems Minimizing Mean 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: A General Bounding Scheme for the Permutation Flow-Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focused Scheduling in Proportionate Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Ordered Flow Shop Sequeneing Problem With TWK Type Due Dates and Total Tardiness Criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adaptive branching rule for the permutation flow-shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / 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: Optimal Elimination Methods in the <i>m</i> × <i>n</i> Flow-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Sequencing <i>n</i> Jobs on <i>m</i> Machines to Minimise Maximum Tardiness: A Branch-and-Bound Solution / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:38, 28 May 2024

scientific article
Language Label Description Also known as
English
Minimizing total tardiness in permutation flowshops
scientific article

    Statements

    Minimizing total tardiness in permutation flowshops (English)
    0 references
    0 references
    13 August 1998
    0 references
    0 references
    permutation flowshop scheduling
    0 references
    total tardiness
    0 references
    branch-and-bound
    0 references