Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
From MaRDI portal
Publication:976483
Recommendations
- Scheduling with two competing agents to minimize total weighted earliness
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- Scheduling Problems with Two Competing Agents
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
Cites work
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- A multiple-criterion model for machine scheduling
- A note on the complexity of the problem of two-agent scheduling on a single machine
- Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
- Minimizing Total Tardiness on One Machine is NP-Hard
- Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
- Multi-agent scheduling on a single machine with max-form criteria
- Scheduling Problems with Two Competing Agents
- Scheduling with Opting Out: Improving upon Random Priority
- Sequencing games
- Two-Agent Scheduling with Linear Deteriorating Jobs on a Single Machine
Cited in
(43)- Scheduling two-agents with a time-dependent deterioration to minimize the minsum earliness measures
- Pareto-scheduling of two competing agents with their own equal processing times
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Two-agent single-machine scheduling with assignable due dates
- 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
- 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
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- Two-agent scheduling in a two-machine open shop
- Two competitive agents to minimize the weighted total late work and the total completion time
- A just-in-time scheduling problem with two competing agents
- Single machine family scheduling with two competing agents to minimize makespan
- A survey of due-date related single-machine with two-agent scheduling problem
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents
- Scheduling Problems with Two Competing Agents
- A note on scheduling to meet two min-sum objectives
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Bounded parallel-batching scheduling with two competing agents
- Unbounded parallel-batching scheduling with two competitive agents
- Group Scheduling with Two Competing Agents on a Single Machine
- Supply chain scheduling in a collaborative manufacturing mode: model construction and algorithm design
- Multitasking scheduling problems with two competitive agents
- A note on scheduling problems with competing agents and earliness minimization objectives
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties
- Scheduling with two competing agents to minimize total weighted earliness
- 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
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
- 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
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- 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
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- 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
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Single machine scheduling problem with two synergetic agents and piece-rate maintenance
This page was built for publication: Scheduling problems with two competing agents to minimize minmax and minsum earliness measures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976483)
