Minimizing late jobs in the general one machine scheduling problem (Q1130035): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Minimizing late jobs in the general one machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Formulating the single machine sequencing problem with release dates as a mixed integer program / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of generalized due date scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Solvable Case of the One-Machine Scheduling Problem with Ready and Due Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3940839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>n</i> Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Scheduling a Single Machine to Minimize the Weighted Number of Late Jobs / rank
 
Normal rank

Revision as of 14:52, 28 May 2024

scientific article
Language Label Description Also known as
English
Minimizing late jobs in the general one machine scheduling problem
scientific article

    Statements

    Minimizing late jobs in the general one machine scheduling problem (English)
    0 references
    16 August 1998
    0 references
    minimizing the number of late jobs
    0 references
    one machine
    0 references
    release dates
    0 references
    different due dates
    0 references
    lower bound
    0 references
    heuristic
    0 references

    Identifiers