A branch and price algorithm for single-machine completion time variance
Year of publication: |
2019
|
---|---|
Authors: | Wang, Shijin ; Lu, Ying |
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. 109.2019, p. 188-199
|
Subject: | Scheduling | Branch and price | Single machine | Completion time variance | Mixed integer programming | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Heuristik | Heuristics | Ganzzahlige Optimierung | Integer programming | Operations Research | Operations research |
-
A dominance-based heuristic to minimise completion time variance in a single machine system
Soroush, H. M., (2019)
-
An almost exact solution to the min completion time variance in a single machine
Nasini, Stefano, (2021)
-
A linear programming based heuristic algorithm for bandwidth packing problem with scheduling
Joung, Seulgi, (2020)
- More ...
-
Scheduling with divisible jobs and subcontracting option
Wang, Shijin, (2022)
-
Scheduling deteriorating jobs with past-sequence-dependent delivery times
Liu, Ming, (2013)
-
Niu, Hewen, (2014)
- More ...