Completion time variance minimisation on two identical parallel processors
Year of publication: |
September 2017
|
---|---|
Authors: | Srirangacharyulu, B. |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 86.2017, p. 54-64
|
Subject: | Scheduling | Completion time variance | Branch and bound | Scheduling-Verfahren | Scheduling problem | Heuristik | Heuristics | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
Ozturk, Onur, (2017)
-
Scheduling identical parallel machines with fixed delivery dates to minimize total tardiness
Mensendiek, Arne, (2015)
-
Three-machine flow shop scheduling with overlapping waiting time constraints
Kim, Hyun-Jung, (2019)
- More ...
-
Completion time variance minimization in single machine and multi-machine systems
Srirangacharyulu, B., (2010)
-
Srirangacharyulu, B., (2011)
-
Srirangacharyulu, B., (2013)
- More ...