Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (Q1752203): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2016.06.062 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2461363908 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cost-effectiveness of a preventive counseling and support package for postnatal depression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a class of two-resource allocation problem by equivalent load method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for Certain Multiprocessing Anomalies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource Management in Machine Scheduling Problems: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for parallel machine scheduling problems with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Allocation of resources in project management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single and two-resource allocation algorithms for minimizing the maximal lateness in a single machine / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the total weighted flow time in a single machine with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with a convex resource consumption function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine batch scheduling to minimize total completion time and resource consumption costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252722 / rank
 
Normal rank

Latest revision as of 17:11, 15 July 2024

scientific article
Language Label Description Also known as
English
Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times
scientific article

    Statements

    Approximation algorithms for the workload partition problem and applications to scheduling with variable processing times (English)
    0 references
    0 references
    0 references
    0 references
    24 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    workload partition problem
    0 references
    scheduling
    0 references
    identical parallel machines
    0 references
    controllable processing times
    0 references
    approximation algorithms
    0 references
    0 references