( en | de | ru )

 

Disambiguation of "Potts, Chris N."

Author of the publication

copydeleteadd this publication to your clipboard
Heuristics for a coupled-operation scheduling problem.

, and . JORS, 58 (10): 1375-1388 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

n n n

Lydia Potts

Daniel Potts

Daniela Pottschmidt

Katja Pottschmidt

 

Other publications of authors with the same name

Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops., , and . INFORMS J. Comput., 13 (2): 120-137 (2001)An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem., , and . INFORMS J. Comput., 14 (1): 52-67 (2002)The Coordination of Scheduling and Batch Deliveries., and . Ann. Oper. Res., 135 (1): 41-64 (2005)Preemptive scheduling with finite capacity input buffers., , and . Ann. Oper. Res., (1997)Split-merge: Using exponential neighborhood search for scheduling a batching machine., , , and . Comput. Oper. Res., (2015)Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time., and . Math. Oper. Res., 29 (3): 686-697 (2004)Train Scheduling and Rescheduling in the UK with a Modified Shifting Bottleneck Procedure., , and . ATMOS, volume 25 of OASIcs, page 120-131. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)A Variable Neighborhood Search Heuristic for Tramp Ship Scheduling., , and . ICCL, volume 6971 of Lecture Notes in Computer Science, page 273-285. Springer, (2011)Heuristics for a coupled-operation scheduling problem., and . JORS, 58 (10): 1375-1388 (2007)On-line scheduling of a single machine to minimize total weighted completion time., and . SODA, page 548-557. ACM/SIAM, (2002)