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).
| Original language | English |
|---|---|
| Pages (from-to) | 285-291 |
| Number of pages | 7 |
| Journal | European Journal of Operational Research |
| Volume | 161 |
| Issue number | 1 |
| DOIs | |
| State | Published - 16 Feb 2005 |
Bibliographical note
Funding Information:We are grateful to professor Mikhail Kovalyov for correcting an error in a previous version of this paper, in which we claimed that the m-machine flow-shop problem can be solved in constant time. This paper was supported in part by the Recanati Fund of The School of Business, The Hebrew University, Jerusalem, Israel.
Keywords
- Batch scheduling
- Flow-shop
- Job-shop
- Makespan