Multi-agent single machine scheduling
From MaRDI portal
Publication:2480197
DOI10.1007/S10479-006-0164-YzbMATH Open1144.90375OpenAlexW2100292670MaRDI QIDQ2480197FDOQ2480197
Authors: Alessandro Agnetis, Dario Pacciarelli, Andrea Pacifici 
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2108/34739
Recommendations
- Single-machine multi-agent scheduling problems with a global objective function
- Scheduling Problems with Two Competing Agents
- Multi-agent scheduling on a single machine with max-form criteria
- 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
- Multiagent scheduling. Models and algorithms
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
- A course in game theory.
- A multiple-criterion model for machine scheduling
- Scheduling Problems with Two Competing Agents
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- A competitive scheduling problem and its relevance to UMTS channel assignment
Cited In (88)
- Two-agent single-machine scheduling with assignable due dates
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment
- 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
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Cooperation in one machine scheduling
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Single Machine Two-Agent Scheduling with Deteriorating Jobs
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- A single-machine scheduling problem with two-agent and deteriorating jobs
- Approximation schemes for two-machine flow shop scheduling with two agents
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Two competitive agents to minimize the weighted total late work and the total completion time
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Scheduling with two competing agents to minimize total weighted earliness
- An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines
- Two-agent scheduling of time-dependent jobs
- A note on a two-agent scheduling problem related to the total weighted late work
- Mathematical programming models for competitive two-agent single-machine scheduling with flexible periodic maintenance activities
- Proportionate flow shop scheduling with multi-agents to maximize total gains of JIT jobs
- A note on scheduling problems with competing agents and earliness minimization objectives
- Scheduling two job families on a single machine with two competitive agents
- Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times
- A competitive two-agent scheduling problem on parallel machines with release dates and preemption
- Title not available (Why is that?)
- Single-machine scheduling with two competing agents and learning consideration
- Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling
- Two-agent scheduling in a flowshop
- Two-agent single-machine scheduling with cumulative deterioration
- Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
- Two-agent scheduling to minimize the total cost
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A tabu method for a two-agent single-machine scheduling with deterioration jobs
- A scheduling problem with three competing agents
- Single machine scheduling with interfering job sets
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness
- An investigation on a two-agent single-machine scheduling problem with unequal release dates
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance
- A two-machine flowshop problem with two agents
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Two-agent single machine scheduling with forbidden intervals
- Two-agent scheduling with position-based deteriorating jobs and learning effects
- Two-agent single-machine scheduling problems under increasing linear deterioration
- Multi-agent scheduling on a single machine with max-form criteria
- Two-agent scheduling with agent specific batches on an unbounded serial batching machine
- A survey of single machine scheduling to minimize weighted number of tardy jobs
- Scheduling interfering job sets on parallel machines
- A single-machine bi-criterion scheduling problem with two agents
- Bounded parallel-batching scheduling with two competing agents
- Unbounded parallel-batching scheduling with two competitive agents
- Single machine family scheduling with two competing agents to minimize makespan
- Two-agent scheduling with rejection on a single machine
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Two-agent single-machine scheduling problem with just-in-time jobs
- Solving a two-agent single-machine scheduling problem considering learning effect
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost
- Single-machine multi-agent scheduling problems with a global objective function
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Vehicle scheduling problems with two agents on a line
- Scheduling two projects with controllable processing times in a single-machine environment
- Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Two-Machine and Two-Agent Flow Shop with Special Processing Times Structures
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- A just-in-time scheduling problem with two competing agents
- A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- Scheduling two agent task chains with a central selection mechanism
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Routing and scheduling problems with two agents on a line-shaped network
- Group Scheduling with Two Competing Agents on a Single Machine
- Multitasking scheduling problems with two competitive agents
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Algorithms for a two-machine no-wait flow shop scheduling problem with two competing agents
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- Title not available (Why is that?)
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria
- A Lagrangian heuristics for balancing the average weighted completion times of two classes of jobs in a single-machine scheduling problem
- Competitive two-agent scheduling with release dates and preemption on a single machine
- Tatonnement beyond gross substitutes? Gradient descent to the rescue
This page was built for publication: Multi-agent single machine scheduling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480197)
