Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
From MaRDI portal
Publication:989525
DOI10.1016/J.IPL.2009.04.018zbMath1205.68516OpenAlexW2091376812MaRDI QIDQ989525
Kangbok Lee, Byung-Cheon Choi, Joseph Y.-T. Leung, Michael L. Pinedo
Publication date: 20 August 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2009.04.018
approximation algorithmFPTAStotal weighted completion timemulti-agent schedulingmulti-objective shortest-path problem
Related Items (42)
A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ Fast approximation algorithms for bi-criteria scheduling with machine assignment costs ⋮ Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ Routing and scheduling problems with two agents on a line-shaped network ⋮ Scheduling problems with two competing agents to minimized weighted earliness-tardiness ⋮ Two-agent singe-machine scheduling with release times to minimize the total weighted completion time ⋮ An investigation on a two-agent single-machine scheduling problem with unequal release dates ⋮ Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Approximation schemes for two-machine flow shop scheduling with two agents ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures ⋮ Single-machine scheduling with multi-agents to minimize total weighted late work ⋮ Single machine batch scheduling with two competing agents to minimize total flowtime ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ A two-agent single-machine scheduling problem with late work criteria ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ A note on two-agent scheduling with resource dependent release times on a single machine ⋮ A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms ⋮ Scheduling two agents with sum-of-processing-times-based deterioration on a single machine ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems ⋮ Solving a two-agent single-machine scheduling problem considering learning effect ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ Scheduling problems with two competing agents to minimize minmax and minsum earliness measures ⋮ A two-machine flowshop problem with two agents ⋮ Two-agent scheduling on a single machine with release dates ⋮ A Batch Scheduling Problem with Two Agents ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ An approximation algorithm for multi-agent scheduling on two uniform parallel machines ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines ⋮ Shared processor scheduling ⋮ SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN ⋮ An Ordered Flow Shop with Two Agents ⋮ Vehicle scheduling problems with two agents on a line
Cites Work
- Unnamed Item
- A note on scheduling to meet two min-sum objectives
- Competitive Two-Agent Scheduling and Its Applications
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Scheduling Problems with Two Competing Agents
- Rescheduling for New Orders
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Approximation Schemes for the Restricted Shortest Path Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Technical Note—Minimizing Average Flow Time with Parallel Machines
This page was built for publication: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
