An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions (Q1772863): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
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/j.cor.2004.03.003 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085055635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4695783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Processor Scheduling with Symmetric Earliness and Tardiness Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: PERT scheduling with convex cost functions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approach to nonlinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3134873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5289009 / rank
 
Normal rank

Latest revision as of 10:24, 10 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions
scientific article

    Statements

    An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions (English)
    0 references
    0 references
    0 references
    21 April 2005
    0 references
    0 references
    Scheduling
    0 references
    Single-machine scheduling
    0 references
    Idle time
    0 references
    Convex cost
    0 references
    Fixed sequence
    0 references
    Semiactive schedule
    0 references
    0 references