Reducibility among single machine weighted completion time scheduling problems (Q922287): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines / rank
 
Normal rank
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 with release dates on a single machine to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of a single machine to minimize total weighted completion time subject to release dates / 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: On n/1/?? dynamic deterministic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time / 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: A note on a scheduling problem with dual criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Dominance Concept in Scheduling <i>n</i> Jobs on a Single Machine with Ready Times and Due Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem / 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: Q3899811 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with Deadlines and Loss Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Weighted Completion Times with Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Deadline Constrained Weighted Completion Time Problem: Analysis of a Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: A decomposition algorithm for the single machine total tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with deadlines to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4068433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON THE USE OF DECOMPOSITION APPROACHES IN A SINGLE MACHINE SCHDULING PROBLEM / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02248586 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983340643 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:15, 30 July 2024

scientific article
Language Label Description Also known as
English
Reducibility among single machine weighted completion time scheduling problems
scientific article

    Statements

    Reducibility among single machine weighted completion time scheduling problems (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    sum of weighted completion time problems
    0 references
    release date
    0 references
    deadline
    0 references
    continuous machine processing
    0 references
    0 references
    0 references
    0 references
    0 references