Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Roberto Tadei / rank
Normal rank
 
Property / author
 
Property / author: Andrea Grosso / rank
Normal rank
 
Property / author
 
Property / author: Q592470 / rank
Normal rank
 
Property / author
 
Property / author: Roberto Tadei / rank
 
Normal rank
Property / author
 
Property / author: Andrea Grosso / rank
 
Normal rank
Property / author
 
Property / author: Frederico Della Croce / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of single machine, multi-criteria scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new decomposition approach for the single machine total tardiness scheduling problem / 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: One-Machine Sequencing to Minimize Certain Functions of Job Tardiness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002567 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fully polynomial approximation scheme for the total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic paradoxes of the single-machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in sequencing / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(01)00334-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1994488876 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:17, 30 July 2024

scientific article
Language Label Description Also known as
English
Finding the Pareto-optima for the total and maximum tardiness single machine problem
scientific article

    Statements

    Finding the Pareto-optima for the total and maximum tardiness single machine problem (English)
    0 references
    2 December 2002
    0 references
    total and maximum tardiness
    0 references
    \(\varepsilon\)-constraint approach
    0 references
    Pareto-optima
    0 references
    branch-and-bound algorithm
    0 references
    0 references
    0 references
    0 references

    Identifiers