An exact algorithm for the bi-objective timing problem (Q1653286): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Bicriteria Transportation Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the earliness--tardiness costs on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Piecewise Linear Multicriteria Programs: The Continuous Case and Its Discontinuous Generalization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one-machine just-in-time scheduling problem with preemption / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved earliness--tardiness timing algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybridization of harmony search with variable neighborhood search for restrictive single-machine earliness/tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with unequal release times and idle insert for minimizing the sum of maximum earliness and tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterated local search based on multi-type perturbation for single-machine earliness/tardiness scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a bi-criteria permutation flow-shop problem using shuffled frog-leaping algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic-programming-based exact algorithm for general single-machine scheduling with machine idle time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicriteria models for just-in-time scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs / rank
 
Normal rank

Latest revision as of 06:44, 16 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the bi-objective timing problem
scientific article

    Statements

    An exact algorithm for the bi-objective timing problem (English)
    0 references
    0 references
    0 references
    0 references
    3 August 2018
    0 references
    0 references
    just-in-time scheduling
    0 references
    bi-objective
    0 references
    timing problem
    0 references
    exact algorithm
    0 references
    0 references
    0 references