An exact extended formulation for the unrelated parallel machine total weighted completion time problem
From MaRDI portal
Publication:2400044
Recommendations
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
- Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
Cites work
- A branch-and-bound algorithm to minimize total weighted completion time on identical parallel machines with job release dates
- A Functional Equation and its Application to Resource Allocation and Sequencing Problems
- A new dynamic programming algorithm for the parallel machines total weighted completion time problem
- A note on the selection of Benders' cuts
- A state-of-the-art review of parallel-machine scheduling research
- A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An improved branching scheme for the branch and bound procedure of schedulingnjobs onmparallel machines to minimize total weighted flowtime
- An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem
- Assignment Problems
- Convex quadratic and semidefinite programming relaxations in scheduling
- Experimental comparison of approximation algorithms for scheduling unrelated parallel machines
- Formulating the single machine sequencing problem with release dates as a mixed integer program
- GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times
- Handbook on Scheduling
- Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
- scientific article; zbMATH DE number 1783886 (Why is no real title available?)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
- Minimizing total tardiness in an unrelated parallel-machine scheduling problem
- Minimizing Weighted Completion Times with Deadlines
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms
- On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
- On the minimization of total weighted flow time with identical and uniform parallel machines
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Parallel machine scheduling by column generation
- Partitioning procedures for solving mixed-variables programming problems
- Preemption in single machine earliness/tardiness scheduling
- Scheduling
- Scheduling identical parallel machines to minimize total weighted completion time
- Scheduling independent tasks to reduce mean finishing time
- Scheduling jobs on parallel machines to minimize a regular step total cost function
- Single machine scheduling with release dates
- Solving Parallel Machine Scheduling Problems by Column Generation
- The one-machine problem with earliness and tardiness penalties
Cited in
(14)- Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines
- Unrelated parallel machine scheduling with multiple time windows: an application to Earth observation satellite scheduling
- On the exact solution of a large class of parallel machine scheduling problems
- A new approximation algorithm for unrelated parallel machine scheduling with release dates
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems
- On the mass COVID-19 vaccination scheduling problem
- A strong preemptive relaxation for weighted tardiness and earliness/tardiness problems on unrelated parallel machines
- A branch-and-price algorithm for parallel machine scheduling using ZDDs and generic branching
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- A branch-and-price algorithm for unrelated parallel machine scheduling with machine usage costs
- Unrelated parallel machine scheduling with random rework and limited preemption
- One Benders cut to rule all schedules in the neighbourhood
- Mathematical models and an effective exact algorithm for unrelated parallel machine scheduling with family setup times and machine cost
- An efficient metaheuristic algorithm for unrelated parallel machine scheduling to minimize total weighted completion time
This page was built for publication: An exact extended formulation for the unrelated parallel machine total weighted completion time problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2400044)
