| Автор | ALIDAEE, BAHRAM |
| Автор | KOCHENBERGER, GARY A. |
| Автор | AHMADIAN, AHMAD |
| Дата выпуска | 1994 |
| dc.description | Two scheduling problems are considered: (1) scheduling n jobs non-preemptively on a single machine to minimize total weighted earliness and tardiness (WET); (2) scheduling n jobs non-preemptively on two parallel identical processors to minimize weighted mean flow time. In the second problem, a pre-ordering of the jobs is assumed that must be satisfied for any set of jobs scheduled on each specific machine. Both problems are known to be NP-complete. A 0-1 quadratic assignment formulation of the problems is presented. An equivalent 0-1 mixed integer linear programming approach for the problems are considered and a numerical example is given. The formulations presented enable one to use optimal and heuristic available algorithms of 0-1 quadratic assignment for the problems considered here. |
| Формат | application.pdf |
| Издатель | Taylor & Francis Group |
| Копирайт | Copyright Taylor and Francis Group, LLC |
| Название | 0-1 Quadratic programming approach for optimum solutions of two scheduling problems |
| Тип | research-article |
| DOI | 10.1080/00207729408928968 |
| Electronic ISSN | 1464-5319 |
| Print ISSN | 0020-7721 |
| Журнал | International Journal of Systems Science |
| Том | 25 |
| Первая страница | 401 |
| Последняя страница | 408 |
| Аффилиация | ALIDAEE, BAHRAM; Mathematics and Physical Sciences Department, West Texas State University |
| Аффилиация | KOCHENBERGER, GARY A.; College of Business Administration, University of Colorado at Denver |
| Аффилиация | AHMADIAN, AHMAD; Management Department, University of Southern Colorado |
| Выпуск | 2 |
