Single-machine multi-agent scheduling problems with a global objective function

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 th...

Full description

Saved in:
Bibliographic Details
Published in:Journal of scheduling 2012-06, Vol.15 (3), p.311-321
Main Authors: Huynh Tuong, N., Soukhal, A., Billaut, J.-C.
Format: Article
Language:English
Subjects:
Algorithms
Artificial Intelligence
Business and Management
Calculus of Variations and Optimal Control
Optimization
Cost function
Criteria
Dynamic programming
Job shops
Multiagent systems
Operations Research/Decision Theory
Optimization
Production capacity
Reduction
Scheduling
Supply Chain Management
Workshops
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1094-6136
1099-1425
DOI:10.1007/s10951-011-0252-y