| Автор | Bozoki, George |
| Автор | Richard, Jean-Paul |
| Дата выпуска | 1970 |
| dc.description | AbstractThe continuous-process job-shop scheduling problem (CPJS) arises typically in the following way: (1) a set of M machines or production facilities are available; (2) a set of N jobs are to be processed through these machines in accordance with a technological matrix; (3) the machines associated with a given job must all be used simultaneously for the completion of this job; (4) a predetermined production time is required for each job; (5) the objective is to determine a production schedule which minimizes the total completion time (makespan) of all jobs. A branch-and-bound type algorithm for the solution of the (CPJS) problem is presented. |
| Формат | application.pdf |
| Издатель | Taylor & Francis Group |
| Копирайт | Copyright Taylor and Francis Group, LLC |
| Название | A Branch-and-Bound Algorithm for the Continuous-Process Job-Shop Scheduling Problem |
| Тип | research-article |
| DOI | 10.1080/05695557008974759 |
| Print ISSN | 0569-5554 |
| Журнал | A I I E Transactions |
| Том | 2 |
| Первая страница | 246 |
| Последняя страница | 252 |
| Аффилиация | Bozoki, George; Stanford University |
| Аффилиация | Richard, Jean-Paul; Stanford University |
| Выпуск | 3 |
