Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
From MaRDI portal
Publication:976483
DOI10.1016/j.ejor.2010.03.003zbMath1188.90103OpenAlexW2020768508MaRDI QIDQ976483
Publication date: 11 June 2010
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.03.003
Related Items
Pareto-scheduling of two competing agents with their own equal processing times ⋮ 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 ⋮ 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 ⋮ Scheduling two job families on a single machine with two competitive agents ⋮ Scheduling problems with two competing agents to minimized weighted earliness-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 ⋮ 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 ⋮ A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents ⋮ A survey of due-date related single-machine with two-agent scheduling problem ⋮ 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 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 ⋮ Unbounded parallel-batching scheduling with two competitive agents ⋮ Bounded parallel-batching scheduling with two competing agents ⋮ Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties ⋮ A competitive two-agent scheduling problem on parallel machines with release dates and preemption ⋮ 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 ⋮ Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives ⋮ A just-in-time scheduling problem with two competing agents ⋮ Two competitive agents to minimize the weighted total late work and the total completion time ⋮ Two-agent single-machine scheduling with assignable due dates ⋮ 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 ⋮ A honey-bees optimization algorithm for a two-agent single-machine scheduling problem with ready times ⋮ A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance ⋮ A Branch-and-Bound Algorithm for Two-Agent Scheduling with Learning Effect and Late Work Criterion ⋮ Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria ⋮ SINGLE MACHINE FAMILY SCHEDULING WITH TWO COMPETING AGENTS TO MINIMIZE MAKESPAN ⋮ Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design ⋮ An Ordered Flow Shop with Two Agents
Cites Work
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Sequencing games
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A note on the complexity of the problem of two-agent scheduling on a single machine
- A multiple-criterion model for machine scheduling
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Minimizing Total Tardiness on One Machine is NP-Hard
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
- Scheduling with Opting Out: Improving upon Random Priority
- Scheduling Problems with Two Competing Agents
