Chris N. Potts

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