Discrete-continuous scheduling problems -- mean completion time results (Q1278310): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(96)00130-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055224357 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling: Processing Rates Dependent on Number of Jobs in Operation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for some discrete-continuous scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a methodology for discrete-continuous scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiprocessor Scheduling with Memory Allocation—A Deterministic Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4749589 / rank
 
Normal rank

Latest revision as of 18:31, 28 May 2024

scientific article
Language Label Description Also known as
English
Discrete-continuous scheduling problems -- mean completion time results
scientific article

    Statements

    Discrete-continuous scheduling problems -- mean completion time results (English)
    0 references
    0 references
    0 references
    22 February 1999
    0 references
    0 references
    scheduling theory
    0 references
    parallel machine scheduling
    0 references
    continuous resource
    0 references
    mean completion time
    0 references
    0 references