A note on minimizing the sum of squares of machine completion times on two identical parallel machines
Year of publication: |
March 2017
|
---|---|
Authors: | Walter, Rico |
Published in: |
Central European journal of operations research : CEJOR ; official journal of the Austrian, Croatian, Czech, Hungarian, Slovakian and Slovenian OR Societies. - Berlin : Springer, ISSN 1435-246X, ZDB-ID 1178875-6. - Vol. 25.2017, 1, p. 139-144
|
Subject: | Scheduling | Identical parallel machines | Sum of squares of machine completion times | Makespan | Approximation algorithms | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Durchlaufzeit | Lead time | Theorie | Theory | Branch-and-Bound | Branch and Bound |
-
Wang, Xiuli, (2015)
-
Oron, Daniel, (2017)
-
Robust makespan minimisation in identical parallel machine scheduling problem with interval data
Xu, Xiaoqing, (2013)
- More ...
-
Comparing the minimum completion times of two longest-first scheduling-heuristics
Walter, Rico, (2010)
-
Comparing the minimum completion times of two longest-first scheduling-heuristics
Walter, Rico, (2010)
-
Walter, Rico, (2013)
- More ...