Multiagent scheduling. Models and algorithms
From MaRDI portal
Recommendations
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Single-machine multi-agent scheduling problems with a global objective function
- scientific article; zbMATH DE number 2160610
Cited in
(only showing first 100 items - show all)- Two-agent parallel-machine scheduling with rejection
- Multi-agent scheduling on a single machine with max-form criteria
- Multi-agent single machine scheduling
- Bilevel adversarial scheduling problem on parallel machines
- Two-agent single-machine scheduling with a rate-modifying activity
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems
- Minmax scheduling problems with common due-date and completion time penalty
- ND-agent scheduling of linear-deteriorating tasks with positional due indices to minimize total completion time and maximum cost
- Improved algorithms for two-agent scheduling on an unbounded serial-batching machine
- Single-machine preemptive scheduling with release dates involving the total weighted late work criterion
- Two-agent scheduling in a two-machine open shop
- Multi-project scheduling problem under shared multi-skill resource constraints
- Two-agent scheduling on a single parallel-batching machine with equal processing time and non-identical job sizes
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
- Fifty years of research in scheduling -- theory and applications
- Competing multi-agent scheduling of equal-length jobs on a single machine or uniform parallel machines
- Two-agent scheduling with time-dependent and position-dependent in a flow-shop system
- Scheduling two interfering job sets on identical parallel machines with makespan and total completion time minimization
- A two-machine no-wait flow shop problem with two competing agents
- Single-machine scheduling of multiple projects with controllable processing times
- Competitive two-agent scheduling problems to minimize the weighted combination of makespans in a two-machine open shop
- Single-machine scheduling problems with general truncated sum-of-actual-processing-time-based learning effect
- Two-agent vehicle scheduling problem on a line-shaped network
- Due date-related scheduling with two agents. Models and algorithms
- Collective schedules: axioms and algorithms
- A survey of scheduling with parallel batch (p-batch) processing
- The price of fairness for a two-agent scheduling game minimizing total completion time
- Two-agent scheduling on unrelated parallel machines with total completion time and weighted number of tardy jobs criteria
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times
- Hierarchical optimization on an unbounded parallel-batching machine
- Two-agent single-scheduling problems of proportionally-linear deteriorated jobs with the maxi-and-total cost criteria
- Two-agent single-machine scheduling with release dates to minimize the makespan
- A two-agent single-machine scheduling problem to minimize the total cost with release dates
- Single machine scheduling with a generalized job-dependent cumulative effect
- Minmax common flow-allowance problems with convex resource allocation and position-dependent workloads
- 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
- Bicriteria scheduling for due date assignment with total weighted tardiness
- scientific article; zbMATH DE number 2085240 (Why is no real title available?)
- Scheduling with assignable due dates, two competing agents and late work related criteria
- Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines
- Multi-agent scheduling on a single machine with a fixed number of competing agents to minimize the weighted sum of number of tardy jobs and makespans
- A review and classification of scheduling objectives in unpaced flow shops for discrete manufacturing
- Single-machine scheduling with multi-agents to minimize total weighted late work
- Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent
- Solving multi-agent scheduling problems on parallel machines with a global objective function
- Single machine adversarial bilevel scheduling problems
- Multi-criteria scheduling: an agent-based approach for expert knowledge integration
- An uncertain parallel machine problem with deterioration and learning effect
- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times
- Price of fairness in two-agent single-machine scheduling problems
- Minmax common due-window assignment scheduling with deteriorating jobs
- Refined conditions for V-shaped optimal sequencing on a single machine to minimize total completion time under combined effects
- Scheduling two projects with controllable processing times in a single-machine environment
- Scheduling with competing agents, total late work and job rejection
- A further study on two-agent parallel-batch scheduling with release dates and deteriorating jobs to minimize the makespan
- Complexities of some problems on multi-agent scheduling on a single machine
- Bicriteria scheduling of equal length jobs on uniform parallel machines
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection
- Single machine scheduling with two competing agents, arbitrary release dates and unit processing times
- Pareto‐optimization of three‐agent scheduling to minimize the total weighted completion time, weighted number of tardy jobs, and total weighted late work
- A note on competing-agent Pareto-scheduling
- Single machine scheduling with two competing agents and equal job processing times
- Two-agent scheduling on a bounded series-batch machine to minimize makespan and maximum cost
- scientific article; zbMATH DE number 1943842 (Why is no real title available?)
- Single-machine minmax common due-window assignment and scheduling problems with convex resource allocation
- Two-agent bounded parallel-batching scheduling for minimizing maximum cost and makespan
- Trade-off between utility and fairness in two-agent single-machine scheduling
- Analyzing the price of fairness in scheduling problems with two agents
- Dynamic scheduling problems in theory and practice
- Single-machine primary-secondary scheduling with total tardiness being the primary criterion
- Serial-batching scheduling with two agents to minimize makespan and maximum cost
- Resource-constrained scheduling with non-constant capacity and non-regular activities
- A just-in-time scheduling problem with two competing agents
- Scheduling on parallel processors with varying processing times
- Single-machine scheduling of proportional-linearly deteriorating jobs with positional due indices
- A new approximation algorithm for multi-agent scheduling to minimize makespan on two machines
- Two-Agent Scheduling with Resource Augmentation on Multiple Machines
- Competitive multi-agent scheduling with an iterative selection rule
- Pareto-scheduling of two competing agents with total weighted tardiness being one criterion
- Polynomial time approximation scheme for two parallel machines scheduling with a common due date to maximize early work
- Two-agent scheduling of unit processing time jobs to minimize total weighted completion time and total weighted number of tardy jobs
- Unary NP-hardness of minimizing the number of tardy jobs with deadlines
- Complexity analyses for multi-agent scheduling problems with a global agent and equal length jobs
- Two-agent parallel machine scheduling with a restricted number of overlapped reserved tasks
- Two competitive agents to minimize the weighted total late work and the total completion time
- Scheduling two agent task chains with a central selection mechanism
- A two-agent single machine scheduling problem with due-window assignment and a common flow-allowance
- Scheduling jobs with a V-shaped time-dependent processing time
- Optimal algorithms for preemptive two-agent scheduling on uniform parallel machines
- Two-agent preemptive Pareto-scheduling to minimize the number of tardy jobs and total late work
- Single-machine hierarchical scheduling with release dates and preemption to minimize the total completion time and a regular criterion
- Scheduling with two competing agents to minimize total weighted earliness
- An algorithm for multi-agent scheduling to minimize the makespan on m parallel machines
- Two-agent scheduling of time-dependent jobs
- A note on a two-agent scheduling problem related to the total weighted late work
- Dynamic scheduling with uncertain job types
- Modeling and simulation of multi-agent scheduling systems based on HTCP-net
- Multi-agent scheduling in a no-wait flow shop system to maximize the weighted number of just-in-time jobs
- Multicriteria scheduling. Theory, models and algorithms. Translated from the French by Henry Scott.
This page was built for publication: Multiagent scheduling. Models and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402189)
