Chris N. Potts

Publication Activity (10 Years)

Years Active: 1980-2021
Publications (10 Years): 6

Top Topics

Neighborhood Search

Dynamic Scheduling

Production Planning

Top Venues

Eur. J. Oper. Res.

Ann. Oper. Res.

Comput. Oper. Res.

Publications

Nicholas G. Hall, Marc E. Posner, Chris N. Potts
Online production planning to maximize the number of on-time orders. Ann. Oper. Res. 298 (1) (2021)
Marion L. Penn, Chris N. Potts, Paul R. Harper
Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables. Eur. J. Oper. Res. 262 (1) (2017)
Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts
Dynamic scheduling of aircraft landings. Eur. J. Oper. Res. 258 (1) (2017)
Benjamin C. Shelbourne, Maria Battarra, Chris N. Potts
The Vehicle Routing Problem with Release and Due Dates. INFORMS J. Comput. 29 (4) (2017)
Fulin Xie, Chris N. Potts, Tolga Bektas
Iterated local search for workforce scheduling and routing problems. J. Heuristics 23 (6) (2017)
Dimitris C. Paraskevopoulos, Tolga Bektas, Teodor Gabriel Crainic, Chris N. Potts
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem. Eur. J. Oper. Res. 253 (2) (2016)
Marta Cabo, Edgar Possani, Chris N. Potts, Xiang Song
Split-merge: Using exponential neighborhood search for scheduling a batching machine. Comput. Oper. Res. 63 (2015)
Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts
Airport runway scheduling. Ann. Oper. Res. 204 (1) (2013)
Honora K. Smith, Paul R. Harper, Chris N. Potts
Bicriteria efficiency/equity hierarchical location models for public service application. J. Oper. Res. Soc. 64 (4) (2013)
Banafsheh Khosravi, Julia A. Bennell, Chris N. Potts
Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure. ATMOS (2012)
Nicholas G. Hall, Chris N. Potts
A Proposal for Redesign of the FedEx Cup Playoff Series on the PGA TOUR. Interfaces 42 (2) (2012)
Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich
Hamiltonian properties of locally connected graphs with bounded vertex degree. Discret. Appl. Math. 159 (16) (2011)
Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts
Airport runway scheduling. 4OR 9 (2) (2011)
Fotini Malliappi, Julia A. Bennell, Chris N. Potts
A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling. ICCL (2011)
Jacek Blazewicz, Klaus Ecker, Tamás Kis, Chris N. Potts, Michal Tanas, J. Douglass Whitehead
Scheduling of coupled tasks with unit processing times. J. Sched. 13 (5) (2010)
Nicholas G. Hall, Chris N. Potts
Rescheduling for Job Unavailability. Oper. Res. 58 (3) (2010)
Wieslaw Kubiak, Djamal Rebaine, Chris N. Potts
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors. Discret. Optim. 6 (1) (2009)
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris N. Potts, Jonathan Whitehead
Scheduling of coupled tasks and one-machine no-wait robotic cells. Comput. Oper. Res. 36 (2) (2009)
Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich
Operator non-availability periods. 4OR 7 (3) (2009)
Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich
Approximation results for flow shop scheduling problems with machine availability constraints. Comput. Oper. Res. 36 (2) (2009)
Honora K. Smith, Paul R. Harper, Chris N. Potts, Ann Thyle
Planning sustainable community health schemes in rural areas of developing countries. Eur. J. Oper. Res. 193 (3) (2009)
Nicholas G. Hall, Marc E. Posner, Chris N. Potts
Online Scheduling with Known Arrival Times. Math. Oper. Res. 34 (1) (2009)
Chris N. Potts, Vitaly A. Strusevich
Fifty years of scheduling: a survey of milestones. J. Oper. Res. Soc. 60 (S1) (2009)
Ross A. McDonald, Paul Skipp, Julia A. Bennell, Chris N. Potts, Lyn C. Thomas, C. David O'Connor
Mining whole-sample mass spectrometry proteomics data for biomarkers - An overview. Expert Syst. Appl. 36 (3) (2009)
Amaia Lusa, Chris N. Potts
A variable neighbourhood search algorithm for the constrained task allocation problem. J. Oper. Res. Soc. 59 (6) (2008)
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. Sched. 11 (5) (2008)
Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich
On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints. Electron. Notes Discret. Math. 29 (2007)
Nicholas G. Hall, Zhixin Liu, Chris N. Potts
Rescheduling for Multiple New Orders. INFORMS J. Comput. 19 (4) (2007)
Chris N. Potts, J. Douglass Whitehead
Heuristics for a coupled-operation scheduling problem. J. Oper. Res. Soc. 58 (10) (2007)
Nicholas G. Hall, Chris N. Potts
The Coordination of Scheduling and Batch Deliveries. Ann. Oper. Res. 135 (1) (2005)
Marco Ghirardi, Chris N. Potts
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. Eur. J. Oper. Res. 165 (2) (2005)
H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove
Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs. J. Sched. 8 (2) (2005)
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. Ann. Oper. Res. 129 (1-4) (2004)
Edward J. Anderson, Chris N. Potts
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time. Math. Oper. Res. 29 (3) (2004)
Nicholas G. Hall, Chris N. Potts
Rescheduling for New Orders. Oper. Res. 52 (3) (2004)
Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich
Batching decisions for assembly production systems. Eur. J. Oper. Res. 157 (3) (2004)
Celia A. Glass, Chris N. Potts, A. L. Tuson
Editorial. J. Oper. Res. Soc. 55 (7) (2004)
Nicholas G. Hall, Chris N. Potts
Supply chain scheduling: Batching and delivery. Oper. Res. 51 (4) (2003)
Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich
Preface: International Symposium on Combinatorial Optimisation. Discret. Appl. Math. 133 (1-3) (2003)
Julia A. Bennell, Chris N. Potts, J. Douglass Whitehead
Local search algorithms for the min-max loop layout problem. J. Oper. Res. Soc. 53 (10) (2002)
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 J. Comput. 14 (1) (2002)
Edward J. Anderson, Chris N. Potts
On-line scheduling of a single machine to minimize total weighted completion time. SODA (2002)
Chris N. Potts, J. Douglass Whitehead
Workload balancing and loop layout in the design of a flexible manufacturing system. Eur. J. Oper. Res. 129 (2) (2001)
K. N. Kashyrskikh, Chris N. Potts, Sergey V. Sevastianov
A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates. Discret. Appl. Math. 114 (1-3) (2001)
Nicholas G. Hall, 'Maseka Lesaoana, Chris N. Potts
Scheduling with Fixed Delivery Dates. Oper. Res. 49 (1) (2001)
Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops. INFORMS J. Comput. 13 (2) (2001)
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) (2000)
Chris N. Potts, Mikhail Y. Kovalyov
Scheduling with batching: A review. Eur. J. Oper. Res. 120 (2) (2000)
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) (2000)
Nicholas G. Hall, Chris N. Potts, Chelliah Sriskandarajah
Parallel machine scheduling with a common server. Discret. Appl. Math. 102 (3) (2000)
Alex E. Gerodimos, Celia A. Glass, Chris N. Potts
Scheduling the production of two-component jobs on a single machine. Eur. J. Oper. Res. 120 (2) (2000)
Celia A. Glass, Jatinder N. D. Gupta, Chris N. Potts
Two-Machine No-Wait Flow Shop Scheduling with Missing Operations. Math. Oper. Res. 24 (4) (1999)
Jatinder N. D. Gupta, A. M. A. Hariri, Chris N. Potts
Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs. Ann. Oper. Res. 92 (1999)
Alex E. Gerodimos, Celia A. Glass, Chris N. Potts, Thomas Tautenhahn
Scheduling multi‐operation jobs on a single machine. Ann. Oper. Res. 92 (1999)
Sally C. Brailsford, Chris N. Potts, Barbara M. Smith
Constraint satisfaction problems: Algorithms and applications. Eur. J. Oper. Res. 119 (3) (1999)
Nicholas G. Hall, Marc E. Posner, Chris N. Potts
Scheduling with Finite Capacity Input Buffers. Oper. Res. 46 (3-Supplement-3) (1998)
H. A. J. Crauwels, A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove
Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time. Ann. Oper. Res. 83 (1998)
Celia A. Glass, Chris N. Potts
Structural Properties of Lot Streaming in a Flow Shop. Math. Oper. Res. 23 (3) (1998)
Bo Chen, Chris N. Potts, Vitaly A. Strusevich
Approximation algorithms for two-machine flow shop scheduling with batch setup times. Math. Program. 82 (1998)
H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove
Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem. INFORMS J. Comput. 10 (3) (1998)
Nicholas G. Hall, Marc E. Posner, Chris N. Potts
Scheduling with Finite Capacity Output Buffers. Oper. Res. 46 (3-Supplement-3) (1998)
Nicholas G. Hall, Marc E. Posner, Chris N. Potts
Preemptive scheduling with finite capacity input buffers. Ann. Oper. Res. 70 (1997)
Jatinder N. D. Gupta, A. M. A. Hariri, Chris N. Potts
Scheduling a two-stage hybrid flow shop with parallel machines at the first stage. Ann. Oper. Res. 69 (1997)
Alex J. Orman, Chris N. Potts
On the Complexity of Coupled-task Scheduling. Discret. Appl. Math. 72 (1-2) (1997)
H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove
Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time. Ann. Oper. Res. 70 (1997)
A. M. A. Hariri, Chris N. Potts
Single machine scheduling with batch set-up times to minimize maximum lateness. Ann. Oper. Res. 70 (1997)
Bo Chen, Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich
A New Heuristic for Three-Machine Flow Shop Scheduling. Oper. Res. 44 (6) (1996)
Celia A. Glass, Chris N. Potts
A comparison of local search methods for flow shop scheduling. Ann. Oper. Res. 63 (4) (1996)
Chris N. Potts, S. V. Sevast'janov, Vitaly A. Strusevich, Luk N. Van Wassenhove, Carin M. Zwaneveld
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation. Oper. Res. 43 (2) (1995)
A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove
Single Machine Scheduling to Minimize Total Weighted Late Work. INFORMS J. Comput. 7 (2) (1995)
Mikhail Y. Kovalyov, Chris N. Potts, Luk N. Van Wassenhove
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work. Math. Oper. Res. 19 (1) (1994)
Hocine Belouadah, Chris N. Potts
Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time. Discret. Appl. Math. 48 (3) (1994)
Clyde L. Monma, Chris N. Potts
Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times. Oper. Res. 41 (5) (1993)
Hocine Belouadah, Marc E. Posner, Chris N. Potts
Scheduling with release dates on a single machine to minimize total weighted completion time. Discret. Appl. Math. 36 (3) (1992)
Chris N. Potts, Luk N. Van Wassenhove
Approximation algorithms for scheduling a single machine to minimize total late work. Oper. Res. Lett. 11 (5) (1992)
Chris N. Potts, Luk N. Van Wassenhove
Single Machine Scheduling to Minimize Total Late Work. Oper. Res. 40 (3) (1992)
A. M. A. Hariri, Chris N. Potts
Heuristics for scheduling unrelated parallel machines. Comput. Oper. Res. 18 (3) (1991)
Chris N. Potts
Scheduling two job classes on a single machine. Comput. Oper. Res. 18 (5) (1991)
Chris N. Potts, David B. Shmoys, David P. Williamson
Permutation vs. non-permutation flow shop schedules. Oper. Res. Lett. 10 (5) (1991)
T. S. Abdul-Razaq, Chris N. Potts, Luk N. Van Wassenhove
A survey of algorithms for the single machine total weighted tardiness scheduling problem. Discret. Appl. Math. 26 (2-3) (1990)
Clyde L. Monma, Chris N. Potts
On the Complexity of Scheduling with Batch Setup Times. Oper. Res. 37 (5) (1989)
Chris N. Potts, Luk N. Van Wassenhove
A Branch and Bound Algorithm for the Total Weighted Tardiness Problem. Oper. Res. 33 (2) (1985)
Chris N. Potts
Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discret. Appl. Math. 10 (2) (1985)
Chris N. Potts
Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates. Math. Oper. Res. 10 (4) (1985)
A. M. A. Hariri, Chris N. Potts
An algorithm for single machine sequencing with release dates to minimize total weighted completion time. Discret. Appl. Math. 5 (1) (1983)
Chris N. Potts, Luk N. Van Wassenhove
A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. 1 (5) (1982)
Chris N. Potts
Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times. Oper. Res. 28 (6) (1980)