Multi-agent scheduling on a single machine with max-form criteria
From MaRDI portal
Publication:2470117
DOI10.1016/j.ejor.2007.04.040zbMath1129.90023OpenAlexW2074320981MaRDI QIDQ2470117
Publication date: 13 February 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/10397/1154
Related Items (76)
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 ⋮ Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent ⋮ A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines ⋮ 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 ⋮ Single machine scheduling with two competing agents and equal job processing times ⋮ 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 ⋮ A scheduling problem with three competing agents ⋮ 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 ⋮ Single machine scheduling problem with two synergetic agents and piece-rate maintenance ⋮ 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 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 ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ Two-agent single-machine scheduling with release dates to minimize the makespan ⋮ 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 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 ⋮ A mixed integer linear programming model for multi-satellite scheduling ⋮ 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 ⋮ A competitive two-agent scheduling problem on parallel machines with release dates and preemption ⋮ 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 ⋮ 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 ⋮ Pareto optimization scheduling with two competing agents to minimize the number of tardy jobs and the maximum cost ⋮ 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 single-machine scheduling with assignable due dates ⋮ 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 ⋮ 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 ⋮ Scheduling two agents with controllable processing times ⋮ Scheduling problems with two competing agents to minimize minmax and minsum earliness measures ⋮ A two-machine flowshop problem with two agents ⋮ A Lagrangian approach to single-machine scheduling problems with two competing agents ⋮ Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work ⋮ 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 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 ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fixed interval scheduling: models, applications, computational complexity and algorithms
- A note on the scheduling with two families of jobs
- Sequencing games
- On games corresponding to sequencing situations with ready times
- Approximability of scheduling with fixed jobs
- A multiple-criterion model for machine scheduling
- Minimizing Total Tardiness on One Machine is NP-Hard
- Scheduling Problems with Two Competing Agents
- Optimal Sequencing of a Single Machine Subject to Precedence Constraints
This page was built for publication: Multi-agent scheduling on a single machine with max-form criteria
