Narrow search
Showing 81 - 90 of 165
Cover Image
Algorithms for two-machine flow-shop sequencing with precedente constraints
Hariri, A. M. A.; Potts, C. N. - In: European journal of operational research : EJOR 17 (1984) 2, pp. 238-248
Persistent link: https://www.econbiz.de/10003571127
Cover Image
An algorithm for single machine sequencing with deaslines to minimize total weighted competition time
Potts, C. N.; Wassenhove, L. N. van - In: European journal of operational research : EJOR 12 (1983) 4, pp. 379-387
Persistent link: https://www.econbiz.de/10003654014
Cover Image
An adaptive branching rule for the permutation flow-shop problem
Potts, C. N. - In: European Journal of Operational Research 5 (1980) 1, pp. 19-25
Persistent link: https://www.econbiz.de/10005240390
Cover Image
Local search heuristics for single-machine scheduling with batching to minimize the number of late jobs
Crauwels, H. A. J.; Potts, C. N.; Van Wassenhove, L. N. - In: European Journal of Operational Research 90 (1996) 2, pp. 200-213
Persistent link: https://www.econbiz.de/10005329745
Cover Image
Editorial
Gupta, J. N. D.; Potts, C. N. - In: European Journal of Operational Research 70 (1993) 3, pp. 269-271
Persistent link: https://www.econbiz.de/10005329925
Cover Image
Workload balancing and loop layout in the design of a flexible manufacturing system
Potts, C. N.; Whitehead, J. D. - In: European Journal of Operational Research 129 (2001) 2, pp. 326-336
Persistent link: https://www.econbiz.de/10005337511
Cover Image
A branch and bound algorithm to minimize the number of late jobs in a permutation flow-shop
Hariri, A. M. A.; Potts, C. N. - In: European Journal of Operational Research 38 (1989) 2, pp. 227-226
Persistent link: https://www.econbiz.de/10005151700
Cover Image
An algorithm for single machine sequencing with deadlines to minimize total weighted completion time
Potts, C. N.; Van Wassenhove, L. N. - In: European Journal of Operational Research 12 (1983) 4, pp. 379-387
Persistent link: https://www.econbiz.de/10005152168
Cover Image
Makespan minimization for scheduling unrelated parallel machines: A recovering beam search approach
Ghirardi, M.; Potts, C. N. - In: European Journal of Operational Research 165 (2005) 2, pp. 457-467
Persistent link: https://www.econbiz.de/10005158383
Cover Image
A branch and bound algorithm for the two-stage assembly scheduling problem
Hariri, A. M. A.; Potts, C. N. - In: European Journal of Operational Research 103 (1997) 3, pp. 547-556
Persistent link: https://www.econbiz.de/10005257366