Branch-and-bound algorithms for scheduling in an m-machine permutation flowshop with a single objective and with multiple objectives
Year of publication: |
2011
|
---|---|
Authors: | Madhushini, N. ; Rajendran, Chandrasekharan |
Published in: |
European journal of industrial engineering : EJIE. - Genevè : Inderscience Enterprises Ltd., ISSN 1751-5254, ZDB-ID 2384377-9. - Vol. 5.2011, 4, p. 361-387
|
Subject: | Branch-and-Bound | Branch and Bound | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Operations Research | Operations research |
-
Srirangacharyulu, B., (2013)
-
Minimizing mean squared deviation of completion times about a common due date
Bagchi, Uttarayan, (1987)
-
Srirangacharyulu, B., (2011)
- More ...
-
Madhushini, N., (2012)
-
Madhushini, N., (2011)
-
Madhushini, N., (2011)
- More ...