Chris Potts

11 catalog papers. Identity-linked publications and additional name matches are distinguished below.

ORCID: 0000-0001-6924-129X

Publications

• The Vehicle Routing Problem with Release and Due Dates — INFORMS Journal on Computing 2017 (name-matched, not ORCID-linked)
• Rescheduling for Job Unavailability — Operations Research 2010 (name-matched, not ORCID-linked)
• Rescheduling for Multiple New Orders — INFORMS Journal on Computing 2007 (name-matched, not ORCID-linked)
• Rescheduling for New Orders — Operations Research 2004 (name-matched, not ORCID-linked)
• Supply Chain Scheduling: Batching and Delivery — Operations Research 2003 (name-matched, not ORCID-linked)
• An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem — INFORMS Journal on Computing 2002 (name-matched, not ORCID-linked)
• Scheduling with Fixed Delivery Dates — Operations Research 2001 (name-matched, not ORCID-linked)
• A New Heuristic for Three-Machine Flow Shop Scheduling — Operations Research 1996
• Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times — Operations Research 1993
• On the Complexity of Scheduling with Batch Setup Times — Operations Research 1989
• A Branch and Bound Algorithm for the Total Weighted Tardiness Problem — Operations Research 1985 (name-matched, not ORCID-linked)