PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Potts, Chris N."

Author of the publication

copydeleteadd this publication to your clipboard
Approximation algorithms for two-machine flow shop scheduling with batch setup times.

, , and . Math. Program., (1998)

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.

Chris Bühler University of Stuttgart

Katrin Christ University of Stuttgart

M. Christmann

Chris Wanner University of Stuttgart

Kasper Christensen University of Stuttgart

 

Other publications of authors with the same name

The Coordination of Scheduling and Batch Deliveries., and . Annals OR, 135 (1): 41-64 (2005)The Two-Stage Assembly Scheduling Problem: Complexity and Approximation., , , , and . Operations Research, 43 (2): 346-355 (1995)Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors., , and . Discrete Optimization, 6 (1): 79-91 (2009)Scheduling two job classes on a single machine.. Computers & OR, 18 (5): 411-415 (1991)Online Scheduling of a Single Machine to Minimize Total Weighted Completion Time., and . Math. Oper. Res., 29 (3): 686-697 (2004)Split-merge: Using exponential neighborhood search for scheduling a batching machine., , , and . Computers & OR, (2015)Approximation algorithms for scheduling a single machine to minimize total late work., and . Oper. Res. Lett., 11 (5): 261-266 (1992)Iterated local search for workforce scheduling and routing problems., , and . J. Heuristics, 23 (6): 471-500 (2017)An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem., , and . INFORMS J. Comput., 14 (1): 52-67 (2002)Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops., , and . INFORMS J. Comput., 13 (2): 120-137 (2001)