Strong NP-hardness of minimizing total deviation with generalized and periodic due dates (Q2294353): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127371655, #quickstatements; #temporary_batch_1721950759712
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Just-In-Time Scheduling with Generalized Due Dates and Identical Due Date Intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary NP-hardness of minimizing the total deviation with generalized or assignable due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unary NP-hardness of minimizing total weighted tardiness with generalized due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness–Tardiness Scheduling Problems, II: Deviation of Completion Times About a Restrictive Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Fixed Delivery Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of generalized due date scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with assignable due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197606 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127371655 / rank
 
Normal rank

Latest revision as of 00:35, 27 July 2024

scientific article
Language Label Description Also known as
English
Strong NP-hardness of minimizing total deviation with generalized and periodic due dates
scientific article

    Statements

    Strong NP-hardness of minimizing total deviation with generalized and periodic due dates (English)
    0 references
    0 references
    0 references
    0 references
    10 February 2020
    0 references
    0 references
    scheduling
    0 references
    generalized due dates
    0 references
    periodic due dates
    0 references
    logistics
    0 references
    0 references
    0 references