Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (Q1362988): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Created claim: Wikidata QID (P12): Q127646641, #quickstatements; #temporary_batch_1722799621482
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
Normal rank
 
Property / author
 
Property / author: Zhi-Long Chen / rank
Normal rank
 
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
 
Normal rank
Property / author
 
Property / author: Zhi-Long Chen / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Single Machine Scheduling with Controllable Processing Times and Number of Jobs Tardy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / 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: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bicriterion approach to time/cost trade-offs in sequencing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0167-6377(96)00035-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2005924883 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127646641 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 20:28, 4 August 2024

scientific article
Language Label Description Also known as
English
Single-machine scheduling with trade-off between number of tardy jobs and resource allocation
scientific article

    Statements

    Single-machine scheduling with trade-off between number of tardy jobs and resource allocation (English)
    0 references
    0 references
    0 references
    0 references
    7 August 1997
    0 references
    sequencing
    0 references
    time-cost trade-offs
    0 references
    resource allocation
    0 references
    single-machine scheduling
    0 references
    NP-hardness
    0 references
    pseudo-polynomial-time dynamic programming algorithm
    0 references

    Identifiers