On Minimizing Total Tardiness in a Serial Batching Problem (Q2765603): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The complexity of one-machine batching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching identical jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling a batching machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batch sizing and job sequencing on a single machine / 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: Q4124332 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Scheduling with Batch Setup Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with batching: A review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Groups of Jobs on a Single Machine / rank
 
Normal rank

Latest revision as of 21:27, 3 June 2024

scientific article
Language Label Description Also known as
English
On Minimizing Total Tardiness in a Serial Batching Problem
scientific article

    Statements

    On Minimizing Total Tardiness in a Serial Batching Problem (English)
    0 references
    0 references
    0 references
    25 August 2002
    0 references
    pseudopolynomial algorithm
    0 references
    dynamic programming
    0 references
    scheduling of jobs
    0 references
    total tardiness
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references