Scheduling with batching: Minimizing the weighted number of tardy jobs (Q1342278): 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: Complexity of Task Sequencing with Deadlines, Set-Up Times and Changeover Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Scheduling of Products with Two Subassemblies on a Single Machine / 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: Batching to Minimize Flow Times on One Machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / 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: One-pass batching algorithms for the one-machine problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for a one machine batching problem / rank
 
Normal rank

Latest revision as of 11:22, 23 May 2024

scientific article
Language Label Description Also known as
English
Scheduling with batching: Minimizing the weighted number of tardy jobs
scientific article

    Statements

    Scheduling with batching: Minimizing the weighted number of tardy jobs (English)
    0 references
    0 references
    0 references
    11 January 1995
    0 references
    0 references
    semiconductor manufacturing
    0 references
    weighted tardiness with batching
    0 references
    processing time
    0 references
    due date
    0 references
    pseudo-polynomial time
    0 references
    NP-completeness
    0 references
    0 references