Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints (Q1610141): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Relocation problems are hard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling subject to resource constraints: Classification and complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of scheduling research involving due date determination decisions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal two- and three-stage production schedules with setup times included / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast feasibility test for relocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relocation problems of maximizing new capacities under a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating the best \(K\) sequences in relocation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank

Latest revision as of 15:03, 4 June 2024

scientific article
Language Label Description Also known as
English
Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints
scientific article

    Statements

    Minimizing the weighted number of tardy jobs and maximum tardiness in relocation problem with due date constraints (English)
    0 references
    18 August 2002
    0 references
    0 references
    job scheduling
    0 references
    resource constraint
    0 references
    due date
    0 references
    NP-hardness
    0 references
    dynamic programming
    0 references
    0 references
    0 references