Competitive two-agent scheduling and its applications
From MaRDI portal
Recommendations
- Scheduling Problems with Two Competing Agents
- Competitive two-agent scheduling with release dates and preemption on a single machine
- A just-in-time scheduling problem with two competing agents
- Bounded parallel-batching scheduling with two competing agents
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness
Cited in
(only showing first 100 items - show all)- 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 project scheduling on two unbounded parallel batch machines
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness
- Competitive two-agent scheduling with deteriorating jobs on a single parallel-batching machine
- 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
- A single-machine two-agent scheduling problem by a branch-and-bound and three simulated annealing algorithms
- Two-agent-based single-machine scheduling with switchover time to minimize total weighted completion time and makespan objectives
- Competitive multi-agent scheduling with an iterative selection rule
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- Solving a two-agent single-machine scheduling problem considering learning effect
- A note on two-agent scheduling on an unbounded parallel-batching machine with makespan and maximum lateness objectives
- Approximation schemes for two-machine flow shop scheduling with two agents
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- A note on competing-agent Pareto-scheduling
- Two-agent single-machine scheduling with cumulative deterioration
- 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
- Nash equilibria for the multi-agent project scheduling problem with controllable processing times
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Optimally rescheduling jobs with a last-in-first-out buffer
- Two-agent integrated scheduling of production and distribution operations with fixed departure times
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- Due date assignment and two-agent scheduling under multitasking environment
- Approximation algorithms for bicriteria scheduling problems on identical parallel machines for makespan and total completion time
- Vehicle scheduling problems with two agents on a line
- Pareto-scheduling of two competing agents with their own equal processing times
- A survey of due-date related single-machine with two-agent scheduling problem
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Scheduling two projects with controllable processing times in a single-machine environment
- A just-in-time scheduling problem with two competing agents
- Online single-machine scheduling to minimize the linear combination of makespans of two 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
- Two-agent single-machine scheduling problem with just-in-time jobs
- A common framework and taxonomy for multicriteria scheduling problems with interfering and competing jobs: multi-agent scheduling problems
- A Lagrangian approach to single-machine scheduling problems with two competing agents
- Two-agent scheduling on a single machine with release dates
- A subset-sum type formulation of a two-agent single-machine scheduling problem
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- The complexity of CO-agent scheduling to minimize the total completion time and total number of tardy jobs
- Online scheduling of jobs with favorite machines
- 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
- Scheduling with release dates and preemption to minimize multiple max-form objective functions
- Two-agent scheduling with rejection on a single machine
- Two-agent single-machine scheduling with release dates and preemption to minimize the maximum lateness
- Two agent scheduling with a central selection mechanism
- Scheduling two agent task chains with a central selection mechanism
- A note on the preemptive scheduling to minimize total completion time with release time and deadline constraints
- Two-agent scheduling problems on a single-machine to minimize the total weighted late work
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs
- Two-agent scheduling of time-dependent jobs
- Scheduling two agents on uniform parallel machines with~makespan and cost functions
- Unbounded parallel-batching scheduling with two competitive agents
- Bounded parallel-batching scheduling with two competing agents
- Scheduling two agents with sum-of-processing-times-based deterioration on a single machine
- Multi-agent scheduling on a single machine with max-form criteria
- 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
- Rescheduling to minimize maximum lateness under a limit on the makespan of the original jobs
- Two agents competing for a shared machine
- Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect
- Fast approximation algorithms for bi-criteria scheduling with machine assignment costs
- Rescheduling for two agents under a limit on the lateness of the original jobs
- Single machine family scheduling with two competing agents to minimize makespan
- Single machine scheduling with two competing agents and equal job processing times
- 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
- Single machine scheduling with interfering job sets
- 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
- Scheduling Problems with Two Competing Agents
- Strategies in competing subset selection
- Single machine batch scheduling with two competing agents to minimize total flowtime
- Two-agent scheduling to minimize the total cost
- Two Heterarchical Multiagent Approaches for FMS Dynamic Scheduling
- A competitive two-agent scheduling problem on parallel machines with release dates and preemption
- A branch-and-bound algorithm for two-agent scheduling with learning effect and late work criterion
- A single-machine bi-criterion scheduling problem with two agents
- 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
- Group Scheduling with Two Competing Agents on a Single Machine
- Two-machine and two-agent flow shop with special processing times structures
- Solving multi-agent scheduling problems on parallel machines with a global objective function
- Two approximation algorithms for two-agent scheduling on parallel machines to minimize makespan
- Two‐agent scheduling with linear resource‐dependent processing times
- Two-agent single-machine scheduling with release dates to minimize the makespan
- Two-agent single-machine scheduling with a rate-modifying activity
This page was built for publication: Competitive two-agent scheduling and its applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3100480)
