Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9664051 | European Journal of Operational Research | 2005 | 7 Pages |
Abstract
We address a batch scheduling problem of n identical processing time jobs on an m-machine flow-shop and a 2-machine job-shop. The objective is makespan minimization. Both problems are shown to be solved in O(n).
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Gur Mosheiov, Daniel Oron,