An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: Scheduling identical parallel machines to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Handbook on Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling independent tasks to reduce mean finishing time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemption in single machine earliness/tardiness scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Assignment Problems / 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: A state-of-the-art review of parallel-machine scheduling research / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs on parallel machines to minimize a regular step total cost function / 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 the selection of Benders' cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single Machine Scheduling with Release Dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Functional Equation and its Application to Resource Allocation and Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new dynamic programming algorithm for the parallel machines total weighted completion time problem / 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: Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4546261 / 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: On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing Weighted Completion Times with Deadlines / 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: A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved branching scheme for the branch and bound procedure of scheduling<i>n</i>jobs on<i>m</i>parallel machines to minimize total weighted flowtime / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing total tardiness in an unrelated parallel-machine scheduling problem / 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: The one-machine problem with earliness and tardiness penalties / 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

Latest revision as of 08:14, 14 July 2024

scientific article
Language Label Description Also known as
English
An exact extended formulation for the unrelated parallel machine total weighted completion time problem
scientific article

    Statements

    An exact extended formulation for the unrelated parallel machine total weighted completion time problem (English)
    0 references
    0 references
    0 references
    25 August 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    unrelated parallel machines
    0 references
    weighted completion time
    0 references
    Benders decomposition
    0 references
    cut strengthening
    0 references
    exact method
    0 references
    preemptive relaxation
    0 references
    transportation problem
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references