An algorithm for single machine sequencing with deadlines to minimize total weighted completion time (Q1170111): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Single machine scheduling to minimize weighted sum of completion times with secondary criterion - A branch and bound approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize the weighted sum of completion times with secondary criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a scheduling problem with dual criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the extension of a result on scheduling with secondary criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4055377 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ONE MACHINE SCHEDULING PROBLEM WITH DUAL CRITERIA / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Total Costs in One-Machine Scheduling / rank
 
Normal rank

Latest revision as of 16:09, 13 June 2024

scientific article
Language Label Description Also known as
English
An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
scientific article

    Statements

    An algorithm for single machine sequencing with deadlines to minimize total weighted completion time (English)
    0 references
    1983
    0 references
    single machine sequencing
    0 references
    deadlines
    0 references
    minimization of total weighted completion time
    0 references
    n jobs
    0 references
    branch and bound algorithm
    0 references
    lower bounds
    0 references
    multiplier adjustment method
    0 references
    dominance conditions
    0 references
    heuristic
    0 references
    Lagrangean relaxation
    0 references
    optimal solution
    0 references
    processing without interruption
    0 references
    computational experience
    0 references
    0 references
    0 references

    Identifiers