A new approximation algorithm for unrelated parallel machine scheduling with release dates (Q2289003): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10479-019-03346-4 / rank
Normal rank
 
Property / cites work
 
Property / cites work: On the minimization of total weighted flow time with identical and uniform parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact extended formulation for the unrelated parallel machine total weighted completion time problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Parallel Machine Scheduling Problems by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of heuristics for the parallel-machine flexible-resource scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On modelling the maximum workload allocation for parallel unrelated machines with setups / rank
 
Normal rank
Property / cites work
 
Property / cites work: A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3840371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates and tails on two unrelated parallel machines to minimize the makespan / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics based on partial enumeration for the unrelated parallel processor scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Task Scheduling in Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite relaxations for partitioning, assignment and ordering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Unrelated Machines by Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hierarchy of relaxations and convex hull characterizations for mixed- integer zero-one programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution algorithms for unrelated machines minmax regret scheduling problem with interval processing times and the total flow time criterion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A \((2 + \epsilon)\)-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2.542-approximation for precedence constrained single machine scheduling with release dates and total weighted completion time objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unrelated Machine Scheduling with Stochastic Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lagrangian Relaxation Algorithm for scheduling dissimilar parallel machines with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Machine Scheduling by Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for unrelated machine scheduling to minimize makespan / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127435289 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10479-019-03346-4 / rank
 
Normal rank

Latest revision as of 20:26, 17 December 2024

scientific article
Language Label Description Also known as
English
A new approximation algorithm for unrelated parallel machine scheduling with release dates
scientific article

    Statements

    A new approximation algorithm for unrelated parallel machine scheduling with release dates (English)
    0 references
    0 references
    0 references
    0 references
    20 January 2020
    0 references
    unrelated parallel machine scheduling
    0 references
    release dates
    0 references
    semi-definite programming
    0 references
    approximation algorithm
    0 references
    branch-and-bound
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references