Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
From MaRDI portal
Recommendations
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Approximation schemes for two-agent scheduling on parallel machines
- Two-agent scheduling to minimize the total cost
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- scientific article; zbMATH DE number 6531341
Cites work
- scientific article; zbMATH DE number 2119733 (Why is no real title available?)
- A competitive scheduling problem and its relevance to UMTS channel assignment
- A note on scheduling to meet two min-sum objectives
- Approximation Schemes for the Restricted Shortest Path Problem
- Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems
- Competitive two-agent scheduling and its applications
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Rescheduling for New Orders
- Scheduling Problems with Two Competing Agents
- Technical Note—Minimizing Average Flow Time with Parallel Machines
Cited in
(47)- Approximation schemes for two-agent scheduling on parallel machines
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- Two-agent single-machine scheduling with assignable due dates
- Two-agent single-machine scheduling with release dates to minimize the makespan
- Two-agent single-machine scheduling problem with just-in-time jobs
- An ordered flow shop with two agents
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- A batch scheduling problem with two agents
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- Solving a two-agent single-machine scheduling problem considering learning effect
- Two-machine and two-agent flow shop with special processing times structures
- Single machine batch scheduling with two competing agents to minimize total flowtime
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- 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
- A just-in-time scheduling problem with two competing agents
- An approximation algorithm for multi-agent scheduling on two uniform parallel machines
- Single machine family scheduling with two competing agents to minimize makespan
- Single machine scheduling with two competing agents and equal job processing times
- Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
- Shared processor scheduling
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Two-agent scheduling to minimize the total cost
- A two-machine flowshop problem with two agents
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Two-agent scheduling on a single machine with release dates
- scientific article; zbMATH DE number 1839475 (Why is no real title available?)
- Approximation schemes for two-machine flow shop scheduling with two agents
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- A single-machine bi-criterion scheduling problem with two agents
- Vehicle scheduling problems with two agents on a line
- Single-machine scheduling with multi-agents to minimize total weighted late work
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Scheduling two projects with controllable processing times in a single-machine environment
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- A two-agent single-machine scheduling problem with late work criteria
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Routing and scheduling problems with two agents on a line-shaped network
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
This page was built for publication: Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989525)
