Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
474838 | Computers & Operations Research | 2009 | 9 Pages |
Abstract
In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
L.L. Liu, C.T. Ng, T.C.E. Cheng,