A bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop
N. Madhushini; Chandrasekharan Rajendran
| Year of publication: |
2012
|
|---|---|
| Authors: | Madhushini, N. ; Rajendran, Chandrasekharan |
| Published in: |
Technology operation management : TOM ; official publication of the Society of Operations Management. - [New Delhi] : Springer India, ISSN 0974-8091, ZDB-ID 2734482-4. - Vol. 3.2012, 1/2, p. 1-10
|
| Subject: | Permutation flowshop | Branch-and-bound algorithms | Bottleneck assignment problem | Makespan | Durchlaufzeit | Lead time | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound | Evolutionärer Algorithmus | Evolutionary algorithm | Engpass | Bottleneck | Operations Research | Operations research |
| 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/10010248552