A bottleneck-assignment based branch-and-bound algorithm to minimize the makespan in an m-machine permutation flowshop
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 | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm | Operations Research | Operations research | Theorie | Theory |
-
Yamashiro, Hirochika, (2021)
-
Minimization of maximum lateness on parallel machines with a single server and job release dates
Elidrissi, Abdelhak, (2024)
-
Wang, Jian-Jun, (2015)
- More ...
-
Madhushini, N., (2011)
-
Madhushini, N., (2011)
-
Madhushini, N., (2011)
- More ...