Article ID Journal Published Year Pages File Type
10328300 Discrete Applied Mathematics 2005 8 Pages PDF
Abstract
We consider the problem of scheduling n jobs on m identical parallel batching machines. Each job is characterized by a release time and a processing time. Each machine can process up to B(B
Keywords
Related Topics
Physical Sciences and Engineering Computer Science Computational Theory and Mathematics
Preview
Minimizing makespan with release times on identical parallel batching machines
Authors
, , ,