Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (Q1761818): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10479-011-1055-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2067283563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flexible solutions in disjunctive scheduling: general formulation and study of the flow-shop case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximization problems in single machine scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Evaluating flexible solutions in single machine scheduling via objective function maximization: the study of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm to minimize total weighted tardiness on a single processor / 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: Algorithms for some maximization scheduling problems on a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Pareto-optimal set of the NP-hard problem of minimization of the maximum lateness for a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of the single-machine total tardiness problem is NP-hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A controlled search simulated annealing method for the single machine weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among single machine weighted completion time scheduling problems / 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: Solution of the single machine total tardiness problem / rank
 
Normal rank

Latest revision as of 21:00, 5 July 2024

scientific article
Language Label Description Also known as
English
Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one
scientific article

    Statements

    Transforming a pseudo-polynomial algorithm for the single machine total tardiness maximization problem into a polynomial one (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    scheduling
    0 references
    single machine problems
    0 references
    maximization problems
    0 references
    total tardiness
    0 references
    polynomial algorithm
    0 references
    0 references

    Identifiers