Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard (Q2450667): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Sequencing with Earliness and Tardiness Penalties: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / 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: Earliness-Tardiness Scheduling Problems, I: Weighted Deviation of Completion Times About a Common Due Date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Single-Machine Scheduling with Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with symmetric earliness and tardiness penalties / rank
 
Normal rank

Latest revision as of 12:09, 8 July 2024

scientific article
Language Label Description Also known as
English
Single-machine scheduling to minimize the total earliness and tardiness is strongly NP-hard
scientific article

    Statements

    Identifiers