A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (Q1278296): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(95)00168-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2047821474 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: On scheduling to minimize earliness-tardiness and batch delivery costs with a common due date / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4034337 / rank
 
Normal rank

Latest revision as of 17:31, 28 May 2024

scientific article
Language Label Description Also known as
English
A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs
scientific article

    Statements

    A note on the complexity of single-machine scheduling with a common due date, earliness-tardiness, and batch delivery costs (English)
    0 references
    0 references
    22 February 1999
    0 references
    single-machine scheduling
    0 references
    batch delivery
    0 references
    common due date
    0 references
    strongly NP-hard
    0 references

    Identifiers