A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (Q596267): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(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: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Minimizing Total Tardiness in a Serial Batching Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A practical use of Jackson's preemptive schedule for solving the job shop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On decomposition of the total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some new efficient methods to solve the \(n/1/r_ i/\sum{}T_ i\) scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993992 / 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: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating filtering techniques for numeric CSPs / 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: Minimizing maximum lateness on one machine: computational experience and some applications / 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 / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0377-2217(03)00378-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2051889693 / rank
 
Normal rank

Latest revision as of 10:26, 30 July 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates
scientific article

    Statements

    A branch-and-bound procedure to minimize total tardiness on one machine with arbitrary release dates (English)
    0 references
    0 references
    0 references
    0 references
    10 August 2004
    0 references
    Scheduling
    0 references
    Single machine
    0 references
    Total tardiness
    0 references

    Identifiers