| Автор | Van Deman, John M. |
| Автор | Baker, Kenneth R. |
| Дата выпуска | 1974 |
| dc.description | AbstractThis paper deals with the flow shop model in which no intermediate job queues are permitted. A branch and bound algorithm for minimizing mean flowtime is developed and detailed computational experience is reported. Experimental results suggest that this problem can be solved as readily as the makespan problem in the traditional flow shop model. |
| Формат | application.pdf |
| Издатель | Taylor & Francis Group |
| Копирайт | Copyright Taylor and Francis Group, LLC |
| Название | Minimizing Mean Flowtime in the Flow Shop with No Intermediate Queues |
| Тип | research-article |
| DOI | 10.1080/05695557408974929 |
| Print ISSN | 0569-5554 |
| Журнал | A I I E Transactions |
| Том | 6 |
| Первая страница | 28 |
| Последняя страница | 34 |
| Аффилиация | Van Deman, John M.; North Carolina State University |
| Аффилиация | Baker, Kenneth R.; Duke University |
| Выпуск | 1 |
