Add to ORKGIn this paper we consider the single machine batch scheduling problem with family setup times and release dates to minimize makespan. We show that this problem is strongly NP-hard, and give an O
We consider scheduling problems with job processing time compatibility on a single unbounded batch m...
AbstractWe study the single-machine scheduling problem with release and delivery times in which the ...
Cataloged from PDF version of article.We address the single-machine batch scheduling problem which a...
Author name used in this publication: Z. H. LiuAuthor name used in this publication: C. T. NgAuthor ...
AbstractIn this paper we consider the unbounded single machine parallel batch scheduling problem wit...
textabstractWe address the NP-hard problem of scheduling n independent jobs with release dates, due ...
Author name used in this publication: Z. H. LiuAuthor name used in this publication: T. C. E. Cheng2...
We consider the single-familiy scheduling problem with batching on a single ma-chine, with a setup t...
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and f...
Published article at http://dx.doi.org/10.1023/A:1024858623282In this paper, we consider the single ...
AbstractIn this paper, we consider the problem of scheduling jobs with release dates on a single-bat...
AbstractIn this paper we consider the problem of scheduling family jobs on a parallel-batching machi...
We study a problem in which a set of n jobs has to be batched as well as scheduled for processing on...
We consider the single machine parallel-batching scheduling problem with precedence relations, relea...
Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng20...
We consider scheduling problems with job processing time compatibility on a single unbounded batch m...
AbstractWe study the single-machine scheduling problem with release and delivery times in which the ...
Cataloged from PDF version of article.We address the single-machine batch scheduling problem which a...
Author name used in this publication: Z. H. LiuAuthor name used in this publication: C. T. NgAuthor ...
AbstractIn this paper we consider the unbounded single machine parallel batch scheduling problem wit...
textabstractWe address the NP-hard problem of scheduling n independent jobs with release dates, due ...
Author name used in this publication: Z. H. LiuAuthor name used in this publication: T. C. E. Cheng2...
We consider the single-familiy scheduling problem with batching on a single ma-chine, with a setup t...
We address the NP-hard problem of scheduling n independent jobs with release dates, due dates, and f...
Published article at http://dx.doi.org/10.1023/A:1024858623282In this paper, we consider the single ...
AbstractIn this paper, we consider the problem of scheduling jobs with release dates on a single-bat...
AbstractIn this paper we consider the problem of scheduling family jobs on a parallel-batching machi...
We study a problem in which a set of n jobs has to be batched as well as scheduled for processing on...
We consider the single machine parallel-batching scheduling problem with precedence relations, relea...
Author name used in this publication: C. T. NgAuthor name used in this publication: T. C. E. Cheng20...
We consider scheduling problems with job processing time compatibility on a single unbounded batch m...
AbstractWe study the single-machine scheduling problem with release and delivery times in which the ...
Cataloged from PDF version of article.We address the single-machine batch scheduling problem which a...