2009 |
21 | EE | Mikhail A. Kubzin,
Chris N. Potts,
Vitaly A. Strusevich:
Approximation results for flow shop scheduling problems with machine availability constraints.
Computers & OR 36(2): 379-390 (2009) |
20 | EE | Honora K. Smith,
Paul R. Harper,
Chris N. Potts,
Ann Thyle:
Planning sustainable community health schemes in rural areas of developing countries.
European Journal of Operational Research 193(3): 768-777 (2009) |
2008 |
19 | EE | Valery S. Gordon,
Chris N. Potts,
Vitaly A. Strusevich,
J. Douglass Whitehead:
Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation.
J. Scheduling 11(5): 357-370 (2008) |
2007 |
18 | EE | Yury L. Orlovich,
Valery S. Gordon,
Chris N. Potts,
Vitaly A. Strusevich:
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints.
Electronic Notes in Discrete Mathematics 29: 169-173 (2007) |
2005 |
17 | EE | Nicholas G. Hall,
Chris N. Potts:
The Coordination of Scheduling and Batch Deliveries.
Annals OR 135(1): 41-64 (2005) |
16 | EE | Marco Ghirardi,
Chris N. Potts:
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach.
European Journal of Operational Research 165(2): 457-467 (2005) |
2004 |
15 | EE | Jatinder N. D. Gupta,
Christos Koulamas,
George J. Kyparisis,
Chris N. Potts,
Vitaly A. Strusevich:
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.
Annals OR 129(1-4): 171-185 (2004) |
14 | EE | Mikhail Y. Kovalyov,
Chris N. Potts,
Vitaly A. Strusevich:
Batching decisions for assembly production systems.
European Journal of Operational Research 157(3): 620-642 (2004) |
13 | EE | Edward J. Anderson,
Chris N. Potts:
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time.
Math. Oper. Res. 29(3): 686-697 (2004) |
2003 |
12 | EE | Richard W. Eglese,
Martin G. Everett,
Chris N. Potts,
Vitaly A. Strusevich:
Preface: International Symposium on Combinatorial Optimisation.
Discrete Applied Mathematics 133(1-3): 1-2 (2003) |
2002 |
11 | EE | Edward J. Anderson,
Chris N. Potts:
On-line scheduling of a single machine to minimize total weighted completion time.
SODA 2002: 548-557 |
10 | EE | Richard K. Congram,
Chris N. Potts,
Steef L. van de Velde:
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem.
INFORMS Journal on Computing 14(1): 52-67 (2002) |
2001 |
9 | | K. N. Kashyrskikh,
Chris N. Potts,
Sergey V. Sevastianov:
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
Discrete Applied Mathematics 114(1-3): 255-271 (2001) |
8 | EE | Celia A. Glass,
Chris N. Potts,
Vitaly A. Strusevich:
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.
INFORMS Journal on Computing 13(2): 120-137 (2001) |
2000 |
7 | | Nicholas G. Hall,
Chris N. Potts,
Chelliah Sriskandarajah:
Parallel machine scheduling with a common server.
Discrete Applied Mathematics 102(3): 223-243 (2000) |
6 | EE | Jeffrey B. Sidney,
Chris N. Potts,
Chelliah Sriskandarajah:
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups.
Oper. Res. Lett. 26(4): 165-173 (2000) |
5 | EE | Han Hoogeveen,
Chris N. Potts,
Gerhard J. Woeginger:
On-line scheduling on a single machine: maximizing the number of early jobs.
Oper. Res. Lett. 27(5): 193-197 (2000) |
1998 |
4 | | Bo Chen,
Chris N. Potts,
Vitaly A. Strusevich:
Approximation algorithms for two-machine flow shop scheduling with batch setup times.
Math. Program. 82: 255-271 (1998) |
1997 |
3 | EE | Alex J. Orman,
Chris N. Potts:
On the Complexity of Coupled-task Scheduling.
Discrete Applied Mathematics 72(1-2): 141-154 (1997) |
1994 |
2 | EE | Hocine Belouadah,
Chris N. Potts:
Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time.
Discrete Applied Mathematics 48(3): 201-218 (1994) |
1992 |
1 | EE | Hocine Belouadah,
Marc E. Posner,
Chris N. Potts:
Scheduling with release dates on a single machine to minimize total weighted completion time.
Discrete Applied Mathematics 36(3): 213-231 (1992) |