Minimizing the number of tardy jobs in single machine sequencing (Q686166): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Tasks with Nonuniform Deadlines on Two Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Sequencing of a Single Machine Subject to Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217918 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5181074 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the largest suborder of fixed width / rank
 
Normal rank

Revision as of 11:05, 22 May 2024

scientific article
Language Label Description Also known as
English
Minimizing the number of tardy jobs in single machine sequencing
scientific article

    Statements

    Minimizing the number of tardy jobs in single machine sequencing (English)
    0 references
    0 references
    0 references
    17 April 1994
    0 references
    0 references
    scheduling
    0 references
    precedence constraints
    0 references