On scheduling with non-increasing time slot cost to minimize total weighted completion time (Q1702736): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10951-015-0462-9 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-015-0462-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2276780023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Algorithms and a PTAS for Cost-Aware Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Cost-Aware Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with variable time slot costs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10951-015-0462-9 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 04:55, 11 December 2024

scientific article
Language Label Description Also known as
English
On scheduling with non-increasing time slot cost to minimize total weighted completion time
scientific article

    Statements

    On scheduling with non-increasing time slot cost to minimize total weighted completion time (English)
    0 references
    0 references
    0 references
    0 references
    28 February 2018
    0 references
    operations research
    0 references
    scheduling
    0 references
    time slot cost
    0 references
    total weighted completion time
    0 references

    Identifiers