default search action
Chris N. Potts
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
- [j84]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): 249-269 (2021)
2010 – 2019
- 2017
- [j83]Julia A. Bennell
Dynamic scheduling of aircraft landings. Eur. J. Oper. Res. 258(1): 315-327 (2017) - [j82]Marion L. Penn
Multiple criteria mixed-integer programming for incorporating multiple factors into the development of master operating theatre timetables. Eur. J. Oper. Res. 262(1): 194-206 (2017) - [j81]Fulin Xie
Iterated local search for workforce scheduling and routing problems. J. Heuristics 23(6): 471-500 (2017) - [j80]Benjamin C. Shelbourne
The Vehicle Routing Problem with Release and Due Dates. INFORMS J. Comput. 29(4): 705-723 (2017) - 2016
- [j79]Dimitris C. Paraskevopoulos, Tolga Bektas
A cycle-based evolutionary algorithm for the fixed-charge capacitated multi-commodity network design problem. Eur. J. Oper. Res. 253(2): 265-279 (2016) - 2015
- [j78]Marta Cabo, Edgar Possani
Split-merge: Using exponential neighborhood search for scheduling a batching machine. Comput. Oper. Res. 63: 125-135 (2015) - 2013
- [j77]Julia A. Bennell
Airport runway scheduling. Ann. Oper. Res. 204(1): 249-270 (2013) - [j76]Honora K. Smith
Bicriteria efficiency/equity hierarchical location models for public service application. J. Oper. Res. Soc. 64(4): 500-512 (2013) - 2012
- [j75]Nicholas G. Hall
A Proposal for Redesign of the FedEx Cup Playoff Series on the PGA TOUR. Interfaces 42(2): 166-179 (2012) - [c3]Banafsheh Khosravi
Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure. ATMOS 2012: 120-131 - 2011
- [j74]Julia A. Bennell
Airport runway scheduling. 4OR 9(2): 115-138 (2011) - [j73]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): 1759-1774 (2011) - [c2]Fotini Malliappi, Julia A. Bennell
A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling. ICCL 2011: 273-285 - 2010
- [j72]Nicholas G. Hall
Rescheduling for Job Unavailability. Oper. Res. 58(3): 746-755 (2010) - [j71]Jacek Blazewicz
Scheduling of coupled tasks with unit processing times. J. Sched. 13(5): 453-461 (2010)
2000 – 2009
- 2009
- [j70]Nadia Brauner, Gerd Finke, Vassilissa Lehoux-Lebacque
Operator non-availability periods. 4OR 7(3): 239-253 (2009) - [j69]Nadia Brauner
Scheduling of coupled tasks and one-machine no-wait robotic cells. Comput. Oper. Res. 36(2): 301-307 (2009) - [j68]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): 379-390 (2009) - [j67]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): 79-91 (2009) - [j66]Honora K. Smith
Planning sustainable community health schemes in rural areas of developing countries. Eur. J. Oper. Res. 193(3): 768-777 (2009) - [j65]Ross A. McDonald, Paul Skipp, Julia A. Bennell
Mining whole-sample mass spectrometry proteomics data for biomarkers - An overview. Expert Syst. Appl. 36(3): 5333-5340 (2009) - [j64]Chris N. Potts, Vitaly A. Strusevich:
Fifty years of scheduling: a survey of milestones. J. Oper. Res. Soc. 60(S1) (2009) - [j63]Nicholas G. Hall
Online Scheduling with Known Arrival Times. Math. Oper. Res. 34(1): 92-102 (2009) - 2008
- [j62]Amaia Lusa
A variable neighbourhood search algorithm for the constrained task allocation problem. J. Oper. Res. Soc. 59(6): 812-822 (2008) - [j61]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): 357-370 (2008) - 2007
- [j60]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: 169-173 (2007) - [j59]Nicholas G. Hall, Zhixin Liu
Rescheduling for Multiple New Orders. INFORMS J. Comput. 19(4): 633-645 (2007) - [j58]Chris N. Potts, J. Douglass Whitehead:
Heuristics for a coupled-operation scheduling problem. J. Oper. Res. Soc. 58(10): 1375-1388 (2007) - 2005
- [j57]Nicholas G. Hall
The Coordination of Scheduling and Batch Deliveries. Ann. Oper. Res. 135(1): 41-64 (2005) - [j56]Marco Ghirardi
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach. Eur. J. Oper. Res. 165(2): 457-467 (2005) - [j55]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): 161-177 (2005) - 2004
- [j54]Jatinder N. D. Gupta
Scheduling Three-Operation Jobs in a Two-Machine Flow Shop to Minimize Makespan. Ann. Oper. Res. 129(1-4): 171-185 (2004) - [j53]Mikhail Y. Kovalyov
Batching decisions for assembly production systems. Eur. J. Oper. Res. 157(3): 620-642 (2004) - [j52]Nicholas G. Hall
Rescheduling for New Orders. Oper. Res. 52(3): 440-453 (2004) - [j51]Celia A. Glass
Editorial. J. Oper. Res. Soc. 55(7): 685-686 (2004) - [j50]Edward J. Anderson
Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time. Math. Oper. Res. 29(3): 686-697 (2004) - 2003
- [j49]Richard W. Eglese, Martin G. Everett
Preface: International Symposium on Combinatorial Optimisation. Discret. Appl. Math. 133(1-3): 1-2 (2003) - [j48]Nicholas G. Hall
Supply chain scheduling: Batching and delivery. Oper. Res. 51(4): 566-584 (2003) - 2002
- [j47]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): 52-67 (2002) - [j46]Julia A. Bennell
Local search algorithms for the min-max loop layout problem. J. Oper. Res. Soc. 53(10): 1109-1117 (2002) - [c1]Edward J. Anderson, Chris N. Potts:
On-line scheduling of a single machine to minimize total weighted completion time. SODA 2002: 548-557 - 2001
- [j45]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): 255-271 (2001) - [j44]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): 326-336 (2001) - [j43]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): 120-137 (2001) - [j42]Nicholas G. Hall, 'Maseka Lesaoana, Chris N. Potts:
Scheduling with Fixed Delivery Dates. Oper. Res. 49(1): 134-144 (2001) - 2000
- [j41]Nicholas G. Hall, Chris N. Potts, Chelliah Sriskandarajah:
Parallel machine scheduling with a common server. Discret. Appl. Math. 102(3): 223-243 (2000) - [j40]Chris N. Potts, Mikhail Y. Kovalyov
Scheduling with batching: A review. Eur. J. Oper. Res. 120(2): 228-249 (2000) - [j39]Alex E. Gerodimos, Celia A. Glass
Scheduling the production of two-component jobs on a single machine. Eur. J. Oper. Res. 120(2): 250-259 (2000) - [j38]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): 165-173 (2000) - [j37]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): 193-197 (2000)
1990 – 1999
- 1999
- [j36]Alex E. Gerodimos, Celia A. Glass, Chris N. Potts, Thomas Tautenhahn:
Scheduling multi‐operation jobs on a single machine. Ann. Oper. Res. 92: 87-105 (1999) - [j35]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: 107-123 (1999) - [j34]Sally C. Brailsford
Constraint satisfaction problems: Algorithms and applications. Eur. J. Oper. Res. 119(3): 557-581 (1999) - [j33]Celia A. Glass, Jatinder N. D. Gupta
Two-Machine No-Wait Flow Shop Scheduling with Missing Operations. Math. Oper. Res. 24(4): 911-924 (1999) - 1998
- [j32]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: 59-76 (1998) - [j31]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): 341-350 (1998) - [j30]Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Scheduling with Finite Capacity Input Buffers. Oper. Res. 46(3-Supplement-3): S154-S159 (1998) - [j29]Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Scheduling with Finite Capacity Output Buffers. Oper. Res. 46(3-Supplement-3): S84-S97 (1998) - [j28]Celia A. Glass, Chris N. Potts:
Structural Properties of Lot Streaming in a Flow Shop. Math. Oper. Res. 23(3): 624-639 (1998) - [j27]Bo Chen
Approximation algorithms for two-machine flow shop scheduling with batch setup times. Math. Program. 82: 255-271 (1998) - 1997
- [j26]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: 171-191 (1997) - [j25]A. M. A. Hariri, Chris N. Potts:
Single machine scheduling with batch set-up times to minimize maximum lateness. Ann. Oper. Res. 70: 75-92 (1997) - [j24]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: 261-279 (1997) - [j23]Nicholas G. Hall, Marc E. Posner, Chris N. Potts:
Preemptive scheduling with finite capacity input buffers. Ann. Oper. Res. 70: 399-413 (1997) - [j22]Alex J. Orman, Chris N. Potts:
On the Complexity of Coupled-task Scheduling. Discret. Appl. Math. 72(1-2): 141-154 (1997) - 1996
- [j21]Celia A. Glass, Chris N. Potts:
A comparison of local search methods for flow shop scheduling. Ann. Oper. Res. 63(4): 489-509 (1996) - [j20]Bo Chen
A New Heuristic for Three-Machine Flow Shop Scheduling. Oper. Res. 44(6): 891-898 (1996) - 1995
- [j19]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): 232-242 (1995) - [j18]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): 346-355 (1995) - 1994
- [j17]Hocine Belouadah, Chris N. Potts:
Scheduling Identical Parallel Machines to Minimize Total Weighted Completion Time. Discret. Appl. Math. 48(3): 201-218 (1994) - [j16]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): 86-93 (1994) - 1993
- [j15]Clyde L. Monma, Chris N. Potts:
Analysis of Heuristics for Preemptive Parallel Machine Scheduling with Batch Setup Times. Oper. Res. 41(5): 981-993 (1993) - 1992
- [j14]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): 213-231 (1992) - [j13]Chris N. Potts, Luk N. Van Wassenhove:
Single Machine Scheduling to Minimize Total Late Work. Oper. Res. 40(3): 586-595 (1992) - [j12]Chris N. Potts, Luk N. Van Wassenhove:
Approximation algorithms for scheduling a single machine to minimize total late work. Oper. Res. Lett. 11(5): 261-266 (1992) - 1991
- [j11]A. M. A. Hariri, Chris N. Potts:
Heuristics for scheduling unrelated parallel machines. Comput. Oper. Res. 18(3): 323-331 (1991) - [j10]Chris N. Potts:
Scheduling two job classes on a single machine. Comput. Oper. Res. 18(5): 411-415 (1991) - [j9]Chris N. Potts, David B. Shmoys
Permutation vs. non-permutation flow shop schedules. Oper. Res. Lett. 10(5): 281-284 (1991) - 1990
- [j8]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): 235-253 (1990)
1980 – 1989
- 1989
- [j7]Clyde L. Monma, Chris N. Potts:
On the Complexity of Scheduling with Batch Setup Times. Oper. Res. 37(5): 798-804 (1989) - 1985
- [j6]Chris N. Potts:
Analysis of a linear programming heuristic for scheduling unrelated parallel machines. Discret. Appl. Math. 10(2): 155-164 (1985) - [j5]Chris N. Potts, Luk N. Van Wassenhove:
A Branch and Bound Algorithm for the Total Weighted Tardiness Problem. Oper. Res. 33(2): 363-377 (1985) - [j4]Chris N. Potts:
Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates. Math. Oper. Res. 10(4): 576-584 (1985) - 1983
- [j3]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): 99-109 (1983) - 1982
- [j2]Chris N. Potts, Luk N. Van Wassenhove:
A decomposition algorithm for the single machine total tardiness problem. Oper. Res. Lett. 1(5): 177-181 (1982) - 1980
- [j1]Chris N. Potts:
Technical Note - Analysis of a Heuristic for One Machine Sequencing with Release Dates and Delivery Times. Oper. Res. 28(6): 1436-1441 (1980)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: