Branch-and-bound algorithms for scheduling in permutation flowshops to minimize the sum of weighted flowtime/sum of weighted tardiness/sum of weighted flowtime and weighted tardiness/sum of weighted flowtime, weighted tardiness and weighted earliness of jobs
N. Madhushini, C. Rajendran and Y. Deepa
| Year of publication: |
2009
|
|---|---|
| Authors: | Madhushini, N. ; Rajendran, C. ; Deepa, Y. |
| Published in: |
Journal of the Operational Research Society : OR. - Basingstoke, Hampshire : Palgrave, ISSN 0030-3623, ZDB-ID 716033-1. - Vol. 60.2009, 7, p. 991-1004
|
| Subject: | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Theorie | Theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10003869847