Author name used in this publication: T. C. E. ChengAuthor name used in this publication: M. Y. Kovalyov2003-2004 > Academic research: refereed > Publication in refereed journalAccepted ManuscriptPublishe
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
In this paper, we consider a class of batching and scheduling problems in the two-machine flowshop w...
Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Public...
Article dans revue scientifique avec comité de lecture. internationale.International audienceWe stud...
Article dans revue scientifique avec comité de lecture. internationale.International audienceWe stud...
We study the problem of batching and scheduling n jobs in a flow shop comprising m, m2, machines. Ea...
International audienceThis paper deals with the problem of task scheduling in a no-wait flowshop wit...
textabstractWe study the problem of scheduling a chain-reentrant shop, in which each job goes for it...
We consider a scheduling problem where a set of jobs are simultaneously available for processing in ...
AbstractThis paper addresses scheduling n jobs in a two-machine flow shop to minimize the total comp...
We consider in this paper a two-machine flowshop scheduling problem in which the first machine proce...
n this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-...
Cataloged from PDF version of article.We address the single-machine batch scheduling problem which a...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
In this paper, we consider a class of batching and scheduling problems in the two-machine flowshop w...
Author name used in this publication: T. C. E. Cheng2006-2007 > Academic research: refereed > Public...
Article dans revue scientifique avec comité de lecture. internationale.International audienceWe stud...
Article dans revue scientifique avec comité de lecture. internationale.International audienceWe stud...
We study the problem of batching and scheduling n jobs in a flow shop comprising m, m2, machines. Ea...
International audienceThis paper deals with the problem of task scheduling in a no-wait flowshop wit...
textabstractWe study the problem of scheduling a chain-reentrant shop, in which each job goes for it...
We consider a scheduling problem where a set of jobs are simultaneously available for processing in ...
AbstractThis paper addresses scheduling n jobs in a two-machine flow shop to minimize the total comp...
We consider in this paper a two-machine flowshop scheduling problem in which the first machine proce...
n this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-...
Cataloged from PDF version of article.We address the single-machine batch scheduling problem which a...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
The problem of makespan minimization in a flow shop with two-machines when the input buffer of the s...
DOI
Add to ORKG