Skip navigation
Statistics
Help
About OPUS
How to Deposit
Managing Copyright
Notice
Browse
UTS Organisational Groups
Browse Items by:
Issue Date
Author
Title
Type
ARC/NHRMC Funded
Search OPUS
OPUS at UTS
Browsing byAuthorGu, H
Jump to:
0-9
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Y
Z
or enter first few letters:
Sort by:
title
issue date
submit date
ARC/NHRMC funded
In order:
Ascending
Descending
Results/Page
5
10
15
20
25
30
35
40
45
50
55
60
65
70
75
80
85
90
95
100
Authors/Record:
All
1
5
10
15
20
25
30
35
40
45
50
Showing results 1 to 20 of 25
next >
Issue Date
Title
Author(s)
2016-07-25
Bi-criteria sequencing of courses and formation of classes for a bottleneck classroom
Czibula, OG
;
Gu, H
;
Hwang, FJ
;
Kovalyov, MY
;
Zinder, Y
2018-09-01
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
Gu, H
;
Kononov, A
;
Memar, J
;
Zinder, Y
2018-01-01
Efficient lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
Gu, H
;
Memar, J
;
Zinder, Y
2015-01-01
Exact and heuristic methods for the resource-constrained net present value problem
Gu, H
;
Schutt, A
;
Stuckey, PJ
;
Wallace, MG
;
Chu, G
2020-01-01
A Genetic Algorithm Approach for Scheduling Trains Maintenance Under Uncertainty
Gu, H
;
Lam, HC
2019-09-01
A genetic algorithm for assigning train arrival dates at a maintenance centre
Gu, H
;
Joyce, M
;
Lam, HC
;
Woods, M
;
Zinder, Y
2019-09-01
Improved Lagrangian relaxation based optimization procedure for scheduling with storage
Gu, H
;
Memar, J
;
Zinder, Y
2012-01-01
An improved Lagrangian relaxation method for maximising the net present value of large resource-constrained projects
Gu, H
;
Wallace, Mark G.
;
Stuckey, Peter J.
2016-07-01
Improving problem reduction for 0-1 Multidimensional Knapsack Problems with valid inequalities
Gu, H
2013-12-01
A lagrangian relaxation based forward-backward improvement heuristic for maximising the net present value of resource-constrained projects
Gu, H
;
Schutt, A
;
Stuckey, PJ
2019-01-01
Lagrangian Relaxation in Iterated Local Search for the Workforce Scheduling and Routing Problem
Gu, H
;
Zhang, Y
;
Zinder, Y
2018-03-29
Lagrangian relaxation versus genetic algorithm based metaheuristic for a large partitioning problem
Czibula, OG
;
Gu, H
;
Zinder, Y
2016-01-01
A lagrangian relaxation-based heuristic to solve large extended graph partitioning problems
Czibula, OG
;
Gu, H
;
Zinder, Y
2012-11-07
Maximising the net present value of large resource-constrained projects
Gu, H
;
Stuckey, PJ
;
Wallace, MG
2014-01-01
A Multi-Stage IP-Based Heuristic for Class Timetabling and Trainer Rostering
Czibula, O
;
Gu, H
;
Russell, A
;
Zinder, Y
;
Ozcan, E
;
Burke, E
;
McCollum, B
2017-05-01
A multi-stage IP-based heuristic for class timetabling and trainer rostering
Czibula, O
;
Gu, H
;
Russell, A
;
Zinder, Y
2008-05-01
Rescheduling algorithm based on rolling horizon decomposition for a dynamic job shop with uncertain arriving time
Liu, L
;
Gu, H
;
Xi, Y
2018-01-01
Scheduling batch processing in flexible flowshop with job dependent buffer requirements: Lagrangian relaxation approach
Gu, H
;
Memar, J
;
Zinder, Y
2016-01-01
Scheduling personnel retraining: Column generation heuristics
Czibula, OG
;
Gu, H
;
Zinder, Y
2005-01
Scientific Development and Industrial Applications of Nanotechnology in China
Gu, H
;
Schulte, J
;
Schulte, DJ