Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (Q711284): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2010.05.089 / 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 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: Q3525911 / 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: A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates / 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: Minimizing tardiness in a two-machine flow-shop / 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: Scheduling in flowshops to minimize total tardiness of jobs / 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: Impact of permutation enforcement when minimizing total weighted tardiness in dynamic flowshops with uncertain processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On ‘redundant’ constraints in Stafford's MILP model for the flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative evaluation of MILP flowshop models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820362 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Formulation for the Job-Shop Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on hashing functions and tabu search algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A user's guide to tabu search / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2010.05.089 / rank
 
Normal rank

Latest revision as of 01:31, 10 December 2024

scientific article
Language Label Description Also known as
English
Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness
scientific article

    Statements

    Tabu search for non-permutation flowshop scheduling problem with minimizing total tardiness (English)
    0 references
    0 references
    0 references
    25 October 2010
    0 references
    scheduling
    0 references
    non-permutation flowshop
    0 references
    tardiness
    0 references
    MILP model
    0 references
    tabu search
    0 references

    Identifiers