12 pagesIn scheduling literature, the notion of machine non-availability periods is well known, for instance for maintenance. In our case of planning chemical experiments, we have special periods (the week-ends, holidays, vacations) where the chemists are not available. However, human intervention by the chemists is required to handle the starting and termination of the experiments. This gives rise to a new type of scheduling problems, namely problems of finding schedules that respect the operator non-availability periods. These problems are analyzed on a single machine with the makespan as criterion. Properties are described and performance ratios are given for list scheduling algorithms
This paper addresses a two-machine open shop scheduling problem, in which the machines are not conti...
We consider a single machine scheduling problem in which the processing time of a job is a simple li...
AbstractThis article considers a single machine scheduling problem with an availability constraint u...
In the scheduling literature, the notion of machine non availability periods is well known, for inst...
Through an industrial application, we were confronted with the planning of experiments where human i...
International audienceThrough an industrial application, we were confronted with the planning of exp...
Scheduling Theory studies planning and timetabling of various industrial and human activities and, t...
In this paper, open shop scheduling problems with limited machine availability are studied. Such a l...
In this paper we address the problem of scheduling jobs on a single machine with cyclical machine av...
Colloque avec actes et comité de lecture. internationale.International audienceMost of papers dedica...
In real world scheduling applications, machines might not be available during certain time periods d...
Most studies conducted on scheduling problems are assumed that the machine is continuously available...
Research on non-regular performance measures is at best scarce in the deterministic machine scheduli...
In single machine scheduling problems with availability constraints, machines are not available for ...
2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
This paper addresses a two-machine open shop scheduling problem, in which the machines are not conti...
We consider a single machine scheduling problem in which the processing time of a job is a simple li...
AbstractThis article considers a single machine scheduling problem with an availability constraint u...
In the scheduling literature, the notion of machine non availability periods is well known, for inst...
Through an industrial application, we were confronted with the planning of experiments where human i...
International audienceThrough an industrial application, we were confronted with the planning of exp...
Scheduling Theory studies planning and timetabling of various industrial and human activities and, t...
In this paper, open shop scheduling problems with limited machine availability are studied. Such a l...
In this paper we address the problem of scheduling jobs on a single machine with cyclical machine av...
Colloque avec actes et comité de lecture. internationale.International audienceMost of papers dedica...
In real world scheduling applications, machines might not be available during certain time periods d...
Most studies conducted on scheduling problems are assumed that the machine is continuously available...
Research on non-regular performance measures is at best scarce in the deterministic machine scheduli...
In single machine scheduling problems with availability constraints, machines are not available for ...
2006-2007 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
This paper addresses a two-machine open shop scheduling problem, in which the machines are not conti...
We consider a single machine scheduling problem in which the processing time of a job is a simple li...
AbstractThis article considers a single machine scheduling problem with an availability constraint u...