Chris N. Potts

According to our database1, Chris N. Potts authored at least 78 papers between 1983 and 2017.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
The Vehicle Routing Problem with Release and Due Dates.
INFORMS Journal on Computing, 2017

Iterated local search for workforce scheduling and routing problems.
J. Heuristics, 2017

Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables.
European Journal of Operational Research, 2017

Dynamic scheduling of aircraft landings.
European Journal of Operational Research, 2017

2016
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem.
European Journal of Operational Research, 2016

2015
Split-merge: Using exponential neighborhood search for scheduling a batching machine.
Computers & OR, 2015

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

Airport runway scheduling.
Annals OR, 2013

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

Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure.
Proceedings of the 12th Workshop on Algorithmic Approaches for Transportation Modelling, 2012

2011
Hamiltonian properties of locally connected graphs with bounded vertex degree.
Discrete Applied Mathematics, 2011

Airport runway scheduling.
4OR, 2011

A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling.
Proceedings of the Computational Logistics - Second International Conference, 2011

2010
Scheduling of coupled tasks with unit processing times.
J. Scheduling, 2010

Rescheduling for Job Unavailability.
Operations Research, 2010

2009
Online Scheduling with Known Arrival Times.
Math. Oper. Res., 2009

Fifty years of scheduling: a survey of milestones.
JORS, 2009

Mining whole-sample mass spectrometry proteomics data for biomarkers - An overview.
Expert Syst. Appl., 2009

Planning sustainable community health schemes in rural areas of developing countries.
European Journal of Operational Research, 2009

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

Approximation results for flow shop scheduling problems with machine availability constraints.
Computers & OR, 2009

Scheduling of coupled tasks and one-machine no-wait robotic cells.
Computers & OR, 2009

Operator non-availability periods.
4OR, 2009

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

2007
Heuristics for a coupled-operation scheduling problem.
JORS, 2007

Rescheduling for Multiple New Orders.
INFORMS Journal on Computing, 2007

On Hamilton Cycles in Locally Connected Graphs with Vertex Degree Constraints.
Electronic Notes in Discrete Mathematics, 2007

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

Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach.
European Journal of Operational Research, 2005

The Coordination of Scheduling and Batch Deliveries.
Annals OR, 2005

2004
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time.
Math. Oper. Res., 2004

Editorial.
JORS, 2004

Rescheduling for New Orders.
Operations Research, 2004

Batching decisions for assembly production systems.
European Journal of Operational Research, 2004

Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan.
Annals OR, 2004

2003
Supply chain scheduling: Batching and delivery.
Operations Research, 2003

Preface: International Symposium on Combinatorial Optimisation.
Discrete Applied Mathematics, 2003

2002
An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem.
INFORMS Journal on Computing, 2002

On-line scheduling of a single machine to minimize total weighted completion time.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Scheduling with Fixed Delivery Dates.
Operations Research, 2001

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops.
INFORMS Journal on Computing, 2001

Workload balancing and loop layout in the design of a flexible manufacturing system.
European Journal of Operational Research, 2001

A 3/2-approximation algorithm for two-machine flow-shop sequencing subject to release dates.
Discrete Applied Mathematics, 2001

2000
A heuristic for scheduling two-machine no-wait flow shops with anticipatory setups.
Oper. Res. Lett., 2000

On-line scheduling on a single machine: maximizing the number of early jobs.
Oper. Res. Lett., 2000

Scheduling with batching: A review.
European Journal of Operational Research, 2000

Scheduling the production of two-component jobs on a single machine.
European Journal of Operational Research, 2000

Parallel machine scheduling with a common server.
Discrete Applied Mathematics, 2000

1999
Two-Machine No-Wait Flow Shop Scheduling with Missing Operations.
Math. Oper. Res., 1999

Constraint satisfaction problems: Algorithms and applications.
European Journal of Operational Research, 1999

Single‐machine scheduling to minimize maximumtardiness with minimum number of tardy jobs.
Annals OR, 1999

Scheduling multi‐operation jobs on a single machine.
Annals OR, 1999

1998
Approximation algorithms for two-machine flow shop scheduling with batch setup times.
Math. Program., 1998

Structural Properties of Lot Streaming in a Flow Shop.
Math. Oper. Res., 1998

Scheduling with Finite Capacity Input Buffers.
Operations Research, 1998

Scheduling with Finite Capacity Output Buffers.
Operations Research, 1998

Local Search Heuristics for the Single Machine Total Weighted Tardiness Scheduling Problem.
INFORMS Journal on Computing, 1998

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

1997
On the Complexity of Coupled-task Scheduling.
Discrete Applied Mathematics, 1997

Single machine scheduling with batch set-up times to minimize maximum lateness.
Annals OR, 1997

Preemptive scheduling with finite capacity input buffers.
Annals OR, 1997

Scheduling a two-stage hybrid flow shop with parallel machines at the first stage.
Annals OR, 1997

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

1996
A New Heuristic for Three-Machine Flow Shop Scheduling.
Operations Research, 1996

A comparison of local search methods for flow shop scheduling.
Annals OR, 1996

1995
The Two-Stage Assembly Scheduling Problem: Complexity and Approximation.
Operations Research, 1995

Single Machine Scheduling to Minimize Total Weighted Late Work.
INFORMS Journal on Computing, 1995

1994
A Fully Polynomial Approximation Scheme for Scheduling a Single Machine to Minimize Total Weighted Late Work.
Math. Oper. Res., 1994

Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time.
Discrete Applied Mathematics, 1994

1993
Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times.
Operations Research, 1993

1992
Single Machine Scheduling to Minimize Total Late Work.
Operations Research, 1992

Scheduling with release dates on a single machine to minimize total weighted completion time.
Discrete Applied Mathematics, 1992

1991
Scheduling two job classes on a single machine.
Computers & OR, 1991

Heuristics for scheduling unrelated parallel machines.
Computers & OR, 1991

1990
A survey of algorithms for the single machine total weighted tardiness scheduling problem.
Discrete Applied Mathematics, 1990

1989
On the Complexity of Scheduling with Batch Setup Times.
Operations Research, 1989

1985
A Branch and Bound Algorithm for the Total Weighted Tardiness Problem.
Operations Research, 1985

1983
An algorithm for single machine sequencing with release dates to minimize total weighted completion time.
Discrete Applied Mathematics, 1983


  Loading...