Necessary and sufficient conditions of optimality for some classical scheduling problems (Q852941): 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/j.ejor.2005.09.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2078711278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2734595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3339651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4130999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3525910 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Augmentations of consistent partial orders for the one-machine total tardiness problem / rank
 
Normal rank

Latest revision as of 23:06, 24 June 2024

scientific article
Language Label Description Also known as
English
Necessary and sufficient conditions of optimality for some classical scheduling problems
scientific article

    Statements

    Necessary and sufficient conditions of optimality for some classical scheduling problems (English)
    0 references
    0 references
    0 references
    15 November 2006
    0 references
    0 references
    scheduling problems
    0 references
    optimality characterization
    0 references
    critical jobs
    0 references
    partial order
    0 references
    0 references