Scheduling with multiple performance measures: the one-machine case
Management Science
One-machine rescheduling heuristics with efficiency and stability as criteria
Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Nondominated Schedules for a Job-Shop with Two Competing Users
Computational & Mathematical Organization Theory
A Multiple-Criterion Model for Machine Scheduling
Journal of Scheduling
Scheduling Problems with Two Competing Agents
Operations Research
Operations Research
A note on the scheduling with two families of jobs
Journal of Scheduling
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
Genetic branch-and-bound or exact genetic algorithm?
EA'07 Proceedings of the Evolution artificielle, 8th international conference on Artificial evolution
Complexity of two dual criteria scheduling problems
Operations Research Letters
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
Operations Research Letters
| Hi-index | 0.00 |
In this paper, we consider the problem of scheduling independent jobs when several agents compete to perform their jobs on a common single processing machine. Each agent wants to minimise its cost function, which depends exclusively on its jobs and we assume that a global cost function concerning the whole set of jobs has to be minimised. This cost function may correspond to the global performance of the workshop or to the global objective of the company, independent of the objectives of the agents. Classical regular objective functions are considered and both the 驴-constraint and a linear combination of criteria are used for finding compromise solutions. This new multi-agent scheduling problem is introduced into the literature and simple reductions with multicriteria scheduling and multi-agent scheduling problems are established. In addition, the complexity results of several problems are proposed and a dynamic programming algorithm is given.