Chris N. Potts

According to our database, Chris N. Potts authored at least 86 papers between 1980 and 2021.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2021

Online production planning to maximize the number of on-time orders.

Nicholas G. Hall, Marc E. Posner, Chris N. Potts

Ann. Oper. Res., 2021

2017

The Vehicle Routing Problem with Release and Due Dates.

Benjamin C. Shelbourne, Maria Battarra, Chris N. Potts

INFORMS J. Comput., 2017

Iterated local search for workforce scheduling and routing problems.

Fulin Xie, Chris N. Potts, Tolga Bektas

J. Heuristics, 2017

Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables.

Marion L. Penn, Chris N. Potts, Paul R. Harper

Eur. J. Oper. Res., 2017

Dynamic scheduling of aircraft landings.

Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts

Eur. J. Oper. Res., 2017

2016

A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem.

Dimitris C. Paraskevopoulos, Tolga Bektas, Teodor Gabriel Crainic, Chris N. Potts

Eur. J. Oper. Res., 2016

2015

Split-merge: Using exponential neighborhood search for scheduling a batching machine.

Marta Cabo, Edgar Possani, Chris N. Potts, Xiang Song

Comput. Oper. Res., 2015

2013

Bicriteria efficiency/equity hierarchical location models for public service application.

Honora K. Smith, Paul R. Harper, Chris N. Potts

J. Oper. Res. Soc., 2013

2012

A Proposal for Redesign of the FedEx Cup Playoff Series on the PGA TOUR.

Nicholas G. Hall, Chris N. Potts

Interfaces, 2012

Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure.

Banafsheh Khosravi, Julia A. Bennell, Chris N. Potts

Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

2011

Hamiltonian properties of locally connected graphs with bounded vertex degree.

Valery S. Gordon, Yury L. Orlovich, Chris N. Potts, Vitaly A. Strusevich

Discret. Appl. Math., 2011

Airport runway scheduling.

Julia A. Bennell, Mohammad Mesgarpour, Chris N. Potts

4OR, 2011

A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling.

Fotini Malliappi, Julia A. Bennell, Chris N. Potts

Proceedings of the Computational Logistics - Second International Conference, 2011

2010

Scheduling of coupled tasks with unit processing times.

Jacek Blazewicz, Klaus Ecker, Tamás Kis, Chris N. Potts, Michal Tanas, J. Douglass Whitehead

J. Sched., 2010

Rescheduling for Job Unavailability.

Nicholas G. Hall, Chris N. Potts

Oper. Res., 2010

2009

Online Scheduling with Known Arrival Times.

Nicholas G. Hall, Marc E. Posner, Chris N. Potts

Math. Oper. Res., 2009

Fifty years of scheduling: a survey of milestones.

Chris N. Potts, Vitaly A. Strusevich

J. Oper. Res. Soc., 2009

Mining whole-sample mass spectrometry proteomics data for biomarkers - An overview.

Ross A. McDonald, Paul Skipp, Julia A. Bennell, Chris N. Potts, Lyn C. Thomas, C. David O'Connor

Expert Syst. Appl., 2009

Planning sustainable community health schemes in rural areas of developing countries.

Honora K. Smith, Paul R. Harper, Chris N. Potts, Ann Thyle

Eur. J. Oper. Res., 2009

Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors.

Wieslaw Kubiak, Djamal Rebaine, Chris N. Potts

Discret. Optim., 2009

Approximation results for flow shop scheduling problems with machine availability constraints.

Mikhail A. Kubzin, Chris N. Potts, Vitaly A. Strusevich

Comput. Oper. Res., 2009

Scheduling of coupled tasks and one-machine no-wait robotic cells.

Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Chris N. Potts, Jonathan Whitehead

Comput. Oper. Res., 2009

Operator non-availability periods.

Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque, Christophe Rapine, Hans Kellerer, Chris N. Potts, Vitaly A. Strusevich

4OR, 2009

2008

Single machine scheduling models with deterioration and learning: handling precedence constraints via priority generation.

Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich, J. Douglass Whitehead

J. Sched., 2008

A variable neighbourhood search algorithm for the constrained task allocation problem.

Amaia Lusa, Chris N. Potts

J. Oper. Res. Soc., 2008

2007

Heuristics for a coupled-operation scheduling problem.

Chris N. Potts, J. Douglass Whitehead

J. Oper. Res. Soc., 2007

Rescheduling for Multiple New Orders.

Nicholas G. Hall, Zhixin Liu, Chris N. Potts

INFORMS J. Comput., 2007

On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints.

Yury L. Orlovich, Valery S. Gordon, Chris N. Potts, Vitaly A. Strusevich

Electron. Notes Discret. Math., 2007

2005

Branch and Bound Algorithms for Single Machine Scheduling with Batching to Minimize the Number of Late Jobs.

H. A. J. Crauwels, Chris N. Potts, Dirk Van Oudheusden, Luk N. Van Wassenhove

J. Sched., 2005

Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach.

Marco Ghirardi, Chris N. Potts

Eur. J. Oper. Res., 2005

The Coordination of Scheduling and Batch Deliveries.

Nicholas G. Hall, Chris N. Potts

Ann. Oper. Res., 2005

2004

Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time.

Edward J. Anderson, Chris N. Potts

Math. Oper. Res., 2004

Editorial.

Celia A. Glass, Chris N. Potts, A. L. Tuson

J. Oper. Res. Soc., 2004

Rescheduling for New Orders.

Nicholas G. Hall, Chris N. Potts

Oper. Res., 2004

Batching decisions for assembly production systems.

Mikhail Y. Kovalyov, Chris N. Potts, Vitaly A. Strusevich

Eur. J. Oper. Res., 2004

Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.

Jatinder N. D. Gupta, Christos Koulamas, George J. Kyparisis, Chris N. Potts, Vitaly A. Strusevich

Ann. Oper. Res., 2004

2003

Supply chain scheduling: Batching and delivery.

Nicholas G. Hall, Chris N. Potts

Oper. Res., 2003

Preface: International Symposium on Combinatorial Optimisation.

Richard W. Eglese, Martin G. Everett, Chris N. Potts, Vitaly A. Strusevich

Discret. Appl. Math., 2003

2002

Local search algorithms for the min-max loop layout problem.

Julia A. Bennell, Chris N. Potts, J. Douglass Whitehead

J. Oper. Res. Soc., 2002

An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem.

Richard K. Congram, Chris N. Potts, Steef L. van de Velde

INFORMS J. Comput., 2002

On-line scheduling of a single machine to minimize total weighted completion time.

Edward J. Anderson, Chris N. Potts

Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001

Scheduling with Fixed Delivery Dates.

Nicholas G. Hall, 'Maseka Lesaoana, Chris N. Potts

Oper. Res., 2001

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.

Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich

INFORMS J. Comput., 2001

Workload balancing and loop layout in the design of a flexible manufacturing system.

Chris N. Potts, J. Douglass Whitehead

Eur. J. Oper. Res., 2001

A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.

K. N. Kashyrskikh, Chris N. Potts, Sergey V. Sevastianov

Discret. Appl. Math., 2001

2000

A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups.

Jeffrey B. Sidney, Chris N. Potts, Chelliah Sriskandarajah

Oper. Res. Lett., 2000

On-line scheduling on a single machine: maximizing the number of early jobs.

Han Hoogeveen, Chris N. Potts, Gerhard J. Woeginger

Oper. Res. Lett., 2000

Scheduling with batching: A review.

Chris N. Potts, Mikhail Y. Kovalyov

Eur. J. Oper. Res., 2000

Scheduling the production of two-component jobs on a single machine.

Alex E. Gerodimos, Celia A. Glass, Chris N. Potts

Eur. J. Oper. Res., 2000

Parallel machine scheduling with a common server.

Nicholas G. Hall, Chris N. Potts, Chelliah Sriskandarajah

Discret. Appl. Math., 2000

1999

Two-Machine No-Wait Flow Shop Scheduling with Missing Operations.

Celia A. Glass, Jatinder N. D. Gupta, Chris N. Potts

Math. Oper. Res., 1999

Constraint satisfaction problems: Algorithms and applications.

Sally C. Brailsford, Chris N. Potts, Barbara M. Smith

Eur. J. Oper. Res., 1999

Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs.

Jatinder N. D. Gupta, A. M. A. Hariri, Chris N. Potts

Ann. Oper. Res., 1999

Scheduling multi‐operation jobs on a single machine.

Alex E. Gerodimos, Celia A. Glass, Chris N. Potts, Thomas Tautenhahn

Ann. Oper. Res., 1999

1998

Approximation algorithms for two-machine flow shop scheduling with batch setup times.

Bo Chen, Chris N. Potts, Vitaly A. Strusevich

Math. Program., 1998

Structural Properties of Lot Streaming in a Flow Shop.

Celia A. Glass, Chris N. Potts

Math. Oper. Res., 1998

Scheduling with Finite Capacity Input Buffers.

Nicholas G. Hall, Marc E. Posner, Chris N. Potts

Oper. Res., 1998

Scheduling with Finite Capacity Output Buffers.

Nicholas G. Hall, Marc E. Posner, Chris N. Potts

Oper. Res., 1998

Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem.

H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove

INFORMS J. Comput., 1998

Branch and bound algorithms for single-machinescheduling with batch set-up times to minimizetotal weighted completion time.

H. A. J. Crauwels, A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove

Ann. Oper. Res., 1998

1997

On the Complexity of Coupled-task Scheduling.

Alex J. Orman, Chris N. Potts

Discret. Appl. Math., 1997

Single machine scheduling with batch set-up times to minimize maximum lateness.

A. M. A. Hariri, Chris N. Potts

Ann. Oper. Res., 1997

Preemptive scheduling with finite capacity input buffers.

Nicholas G. Hall, Marc E. Posner, Chris N. Potts

Ann. Oper. Res., 1997

Scheduling a two-stage hybrid flow shop with parallel machines at the first stage.

Jatinder N. D. Gupta, A. M. A. Hariri, Chris N. Potts

Ann. Oper. Res., 1997

Local search heuristics for single machine scheduling with batch set-up times to minimize total weighted completion time.

H. A. J. Crauwels, Chris N. Potts, Luk N. Van Wassenhove

Ann. Oper. Res., 1997

1996

A New Heuristic for Three-Machine Flow Shop Scheduling.

Bo Chen, Celia A. Glass, Chris N. Potts, Vitaly A. Strusevich

Oper. Res., 1996

A comparison of local search methods for flow shop scheduling.

Celia A. Glass, Chris N. Potts

Ann. Oper. Res., 1996

1995

The Two-Stage Assembly Scheduling Problem: Complexity and Approximation.

Chris N. Potts, S. V. Sevast'janov, Vitaly A. Strusevich, Luk N. Van Wassenhove, Carin M. Zwaneveld

Oper. Res., 1995

Single Machine Scheduling to Minimize Total Weighted Late Work.

A. M. A. Hariri, Chris N. Potts, Luk N. Van Wassenhove

INFORMS J. Comput., 1995

1994

A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work.

Mikhail Y. Kovalyov, Chris N. Potts, Luk N. Van Wassenhove

Math. Oper. Res., 1994

Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time.

Hocine Belouadah, Chris N. Potts

Discret. Appl. Math., 1994

1993

Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times.

Clyde L. Monma, Chris N. Potts

Oper. Res., 1993

1992

Approximation algorithms for scheduling a single machine to minimize total late work.

Chris N. Potts, Luk N. Van Wassenhove

Oper. Res. Lett., 1992

Single Machine Scheduling to Minimize Total Late Work.

Chris N. Potts, Luk N. Van Wassenhove

Oper. Res., 1992

Scheduling with release dates on a single machine to minimize total weighted completion time.

Hocine Belouadah, Marc E. Posner, Chris N. Potts

Discret. Appl. Math., 1992

1991

Permutation vs. non-permutation flow shop schedules.

Chris N. Potts, David B. Shmoys, David P. Williamson

Oper. Res. Lett., 1991

Scheduling two job classes on a single machine.

Chris N. Potts

Comput. Oper. Res., 1991

Heuristics for scheduling unrelated parallel machines.

A. M. A. Hariri, Chris N. Potts

Comput. Oper. Res., 1991

1990

A survey of algorithms for the single machine total weighted tardiness scheduling problem.

T. S. Abdul-Razaq, Chris N. Potts, Luk N. Van Wassenhove

Discret. Appl. Math., 1990

1989

On the Complexity of Scheduling with Batch Setup Times.

Clyde L. Monma, Chris N. Potts

Oper. Res., 1989

1985

Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates.

Chris N. Potts

Math. Oper. Res., 1985

A Branch and Bound Algorithm for the Total Weighted Tardiness Problem.

Chris N. Potts, Luk N. Van Wassenhove

Oper. Res., 1985

Analysis of a linear programming heuristic for scheduling unrelated parallel machines.

Chris N. Potts

Discret. Appl. Math., 1985

1983

An algorithm for single machine sequencing with release dates to minimize total weighted completion time.

A. M. A. Hariri, Chris N. Potts

Discret. Appl. Math., 1983

1982

A decomposition algorithm for the single machine total tardiness problem.

Chris N. Potts, Luk N. Van Wassenhove

Oper. Res. Lett., 1982

1980

Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times.

Chris N. Potts

Oper. Res., 1980