This paper presents a state-of-the-art survey on multicriteria scheduling and introduces a definition of a multicriteria scheduling problem. It provides a framework that allows to tackle multicriteria scheduling problems, according to Decision Aid concepts. This problem is decomposed into three different problems. The first problem is about obtaining a model. The second one is how to take criteria into account and the third one is about solving a scheduling problem. An extension to an existing notation...
This paper presents a state-of-the-art survey on multicriteria
scheduling and introduces a definition of a . It provides a framework that allows to tackle multicriteria scheduling
problems, according to Decision Aid concepts. This
problem is decomposed into three different problems. The first problem
is about obtaining a model. The second one is how to take criteria
into account and the third one is about solving a scheduling problem. An extension
to an existing notation for scheduling problems...
In this study, we consider a scheduling environment with ( ≥ 1) parallel machines. The set of jobs to schedule is divided into disjoint subsets. Each subset of jobs is associated with one agent. The agents compete to perform their jobs on common resources. The objective is to find a schedule that minimizes a global objective function
, while maintaining the regular objective function of each agent,
, at a level no greater than a fixed value,
( ∈...
A special class of scheduling problems is studied in this paper,
named Hybrid Flowshop, jobs have to be performed
in a shop and each of them has the same routing (so this is
a flowshop). A job consists in different operations.
A set of machines are able to perform each operation and this
set is called a stage. So when a job consists in two operations,
there are two stages in the shop. After introducing the scheduling
generalities, we define our preocupations and we propose a notation
in order...
Download Results (CSV)