Multi-agent single machine scheduling
From MaRDI portal
Publication:2480197
DOI10.1007/s10479-006-0164-yzbMath1144.90375OpenAlexW2100292670MaRDI QIDQ2480197
Dario Pacciarelli, Andrea Pacifici, Alessandro Agnetis
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
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (82)
Two-agent scheduling problems on a single-machine to minimize the total weighted late work ⋮ Single machine scheduling with two competing agents, arbitrary release dates and unit processing times ⋮ A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ Single-machine serial-batch delivery scheduling with two competing agents and due date assignment ⋮ 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 ⋮ Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop ⋮ Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs ⋮ Multitasking scheduling problems with two competitive agents ⋮ A note on scheduling problems with competing agents and earliness minimization objectives ⋮ Design of automated negotiation mechanisms for decentralized heterogeneous machine scheduling ⋮ Two-agent scheduling in a flowshop ⋮ Routing and scheduling problems with two agents on a line-shaped network ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ A tabu method for a two-agent single-machine scheduling with deterioration jobs ⋮ Single machine scheduling with interfering job sets ⋮ A scheduling problem with three competing agents ⋮ 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 ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ Scheduling with two competing agents to minimize total weighted earliness ⋮ Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs ⋮ Scheduling Two-Agents with a Time-Dependent Deterioration to Minimize the Minsum Earliness Measures ⋮ Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness ⋮ A survey of single machine scheduling to minimize weighted number of tardy jobs ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ Two-agent scheduling of time-dependent jobs ⋮ 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 agent specific batches on an unbounded serial batching machine ⋮ 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 ⋮ A note on a two-agent scheduling problem related to the total weighted late work ⋮ 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 ⋮ Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine ⋮ Two-agent scheduling to minimize the total cost ⋮ Two-agent single machine scheduling with forbidden intervals ⋮ A two-agent single-machine scheduling problem to minimize the total cost with release dates ⋮ Single-machine multi-agent scheduling problems with a global objective function ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Two-agent supply chain scheduling problem to minimize the sum of the total weighted completion time and batch cost ⋮ Tatonnement beyond gross substitutes? Gradient descent to the rescue ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ Serial-batching scheduling with two agents to minimize makespan and maximum cost ⋮ Scheduling two projects with controllable processing times in a single-machine environment ⋮ A competitive two-agent scheduling problem on parallel machines with release dates and preemption ⋮ 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 single-machine scheduling of jobs with time-dependent processing times and ready times ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A single-machine bi-criterion scheduling problem with two agents ⋮ A just-in-time scheduling problem with two competing agents ⋮ Single-machine scheduling with two competing agents and learning consideration ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ Two-agent single-machine scheduling problem with just-in-time jobs ⋮ Two-agent single-machine scheduling with cumulative deterioration ⋮ 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 ⋮ Group Scheduling with Two Competing Agents on a Single Machine ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Two-agent scheduling with position-based deteriorating jobs and learning effects ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ Two-agent single-machine scheduling problems under increasing linear deterioration ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ A two-machine flowshop problem with two agents ⋮ A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives ⋮ ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost ⋮ Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan ⋮ An algorithm for multi-agent scheduling to minimize the makespan on \(m\) parallel machines ⋮ Scheduling interfering job sets on parallel machines ⋮ SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN ⋮ Scheduling with release dates and preemption to minimize multiple max-form objective functions ⋮ Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost ⋮ Single Machine Two-Agent Scheduling with Deteriorating Jobs ⋮ Two-agent scheduling with rejection on a single machine ⋮ Vehicle scheduling problems with two agents on a line ⋮ Scheduling two agent task chains with a central selection mechanism
Cites Work
- Unnamed Item
- Unnamed Item
- A multiple-criterion model for machine scheduling
- A competitive scheduling problem and its relevance to UMTS channel assignment
- Scheduling Problems with Two Competing Agents
- An n Job, One Machine Sequencing Algorithm for Minimizing the Number of Late Jobs
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Multi-agent single machine scheduling
