A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem

DOI10.1016/j.ejco.2022.100032zbMath1530.90036OpenAlexW4281918260MaRDI QIDQ6114936

Matteo Avolio, Antonio Fuduli

Publication date: 12 July 2023

Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejco.2022.100032

zbMATH Keywords

Lagrangian relaxationschedulingsingle-machineweighted completion time

Mathematics Subject Classification ID

Cooperative games (91A12) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An investigation on a two-agent single-machine scheduling problem with unequal release dates
• Two-agent scheduling to minimize the total cost
• Two-agent scheduling on uniform parallel machines with min-max criteria
• About Lagrangian methods in integer optimization
• An algorithm for the quadratic assignment problem using Benders' decomposition
• Price of fairness in two-agent single-machine scheduling problems
• Lagrangean relaxation. (With comments and rejoinder).
• A Lagrangian approach to single-machine scheduling problems with two competing agents
• Two-agent scheduling on a single machine with release dates
• Stability and fairness in the job scheduling problem
• A subset-sum type formulation of a two-agent single-machine scheduling problem
• A multiple-criterion model for machine scheduling
• Multi-agent single machine scheduling
• The efficiency-fairness balance of round robin scheduling
• The Price of Fairness
• Scheduling Problems with Two Competing Agents
• Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Multiagent Scheduling
• Essentials of numerical nonsmooth optimization

This page was built for publication: A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem