Single-machine scheduling with trade-off between number of tardy jobs and compression cost (Q835563): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(7 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-007-0027-7 / rank
Normal rank
 
Property / author
 
Property / author: Yong He / rank
Normal rank
 
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
Normal rank
 
Property / author
 
Property / author: Yong He / rank
 
Normal rank
Property / author
 
Property / author: Cheng, T. C. Edwin / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2092460090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with discretely controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with trade-off between number of tardy jobs and resource allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The discrete time-cost tradeoff problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks / 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: Q3993418 / 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: Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem / 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 / DOI
 
Property / DOI: 10.1007/S10951-007-0027-7 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:36, 10 December 2024

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

    Statements

    Single-machine scheduling with trade-off between number of tardy jobs and compression cost (English)
    0 references
    0 references
    0 references
    0 references
    28 August 2009
    0 references
    single-machine scheduling problem
    0 references
    pseudo-polynomial time algorithm
    0 references
    strongly polynomial time algorithm
    0 references
    controllable processing times
    0 references

    Identifiers