Minimizing total tardiness on one machine is NP-hard
Mathematics of Operations Research
Minimizing mean flow time with release time constraint
Theoretical Computer Science
Annals of Operations Research
A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Handbook of Scheduling: Algorithms, Models, and Performance Analysis
Scheduling Problems with Two Competing Agents
Operations Research
Operations Research
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Theoretical Computer Science
Scheduling: Theory, Algorithms, and Systems
Scheduling: Theory, Algorithms, and Systems
Complexity of two dual criteria scheduling problems
Operations Research Letters
An O(n4) algorithm for preemptive scheduling of a single machine to minimize the number of late jobs
Operations Research Letters
Approximation algorithms for multi-agent scheduling to minimize total weighted completion time
Information Processing Letters
A two-machine flowshop problem with two agents
Computers and Operations Research
Scheduling two agents on uniform parallel machines with makespan and cost functions
Journal of Scheduling
Solving a two-agent single-machine scheduling problem considering learning effect
Computers and Operations Research
Two-Agent scheduling on an unbounded serial batching machine
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Genetic algorithms for a two-agent single-machine problem with release time
Applied Soft Computing
Scheduling problems with two competing agents to minimized weighted earliness-tardiness
Computers and Operations Research
Two-agent singe-machine scheduling with release times to minimize the total weighted completion time
Computers and Operations Research
Unbounded parallel-batching scheduling with two competitive agents
Journal of Scheduling
Approximation schemes for two-machine flow shop scheduling with two agents
Journal of Combinatorial Optimization
Approximation schemes for two-agent scheduling on parallel machines
Theoretical Computer Science
Self-Optimization module for Scheduling using Case-based Reasoning
Applied Soft Computing
Bounded parallel-batching scheduling with two competing agents
Journal of Scheduling
Single machine scheduling with interfering job sets
Computers and Operations Research
| Hi-index | 0.00 |
We consider a scheduling environment with m (m ≥ 1) identical machines in parallel and two agents. Agent A is responsible for n1 jobs and has a given objective function with regard to these jobs; agent B is responsible for n2 jobs and has an objective function that may be either the same or different from the one of agent A. The problem is to find a schedule for the n1 + n2 jobs that minimizes the objective of agent A (with regard to his n1 jobs) while keeping the objective of agent B (with regard to his n2 jobs) below or at a fixed level Q. The special case with a single machine has recently been considered in the literature, and a variety of results have been obtained for two-agent models with objectives such as fmax, Σ wjCj, and Σ Uj. In this paper, we generalize these results and solve one of the problems that had remained open. Furthermore, we enlarge the framework for the two-agent scheduling problem by including the total tardiness objective, allowing for preemptions, and considering jobs with different release dates; we consider also identical machines in parallel. We furthermore establish the relationships between two-agent scheduling problems and other areas within the scheduling field, namely rescheduling and scheduling subject to availability constraints.