Bicriterion scheduling of identical processing time jobs by uniform processors
Computers and Operations Research
Scheduling equal-length jobs on identical parallel machines
Discrete Applied Mathematics
Nondominated Schedules for a Job-Shop with Two Competing Users
Computational & Mathematical Organization Theory
A note on scheduling multiprocessor tasks with identical processing times
Computers and Operations Research
A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Scheduling Problems with Two Competing Agents
Operations Research
A note on the scheduling with two families of jobs
Journal of Scheduling
A Note on Scheduling Equal-Length Jobs to Maximize Throughput
Journal of Scheduling
Multicriteria Optimization
Multicriteria Scheduling: Theory, Models and Algorithms
Multicriteria Scheduling: Theory, Models and Algorithms
Multi-agent scheduling on a single machine to minimize total weighted number of tardy jobs
Theoretical Computer Science
Competitive Two-Agent Scheduling and Its Applications
Operations Research
Approximation schemes for two-agent scheduling on parallel machines
Theoretical Computer Science
Hi-index | 0.00 |
We consider the problem of scheduling two jobs A and B on a set of m uniform parallel machines. Each job is assumed to be independent from the other: job A and job B are made up of n A and n B operations, respectively. Each operation is defined by its processing time and possibly additional data such as a due date, a weight, etc., and must be processed on a single machine. All machines are uniform, i.e. each machine has its own processing speed. Notice that we consider the special case of equal-size operations, i.e. all operations have the same processing time. The scheduling of operations of job A must be achieved to minimize a general cost function F A , whereas it is the makespan that must be minimized when scheduling the operations of job B. These kind of problems are called multiple agent scheduling problems. As we are dealing with two conflicting criteria, we focus on the calculation of strict Pareto optima for F A and $C_{\mathrm{max}}^{B}$ criteria. In this paper we consider different min-max and min-sum versions of function F A and provide special properties as well as polynomial time algorithms.