Similar Search Results

An optimal algorithm for preemptive on-line scheduling

Chen, Bo; Vliet, André van; Woeginger, Gerhard J. - 1994

Persistent link: https://www.econbiz.de/10000151646

A linear-time algorithm for sequencing jobs with a fixed number of job-classes

Veen, Jack A. van der; Zhang, Shuzhong - 1994

Persistent link: https://www.econbiz.de/10000151675

Improved dynamic programs for some batching problems involving the maximum lateness criterion

Wagelmans, Albert P. M.; Gerodimos, A. E. - 1999

We study a class of scheduling problems involving the maximumlateness criterion and an element of batching. For all the problemsthat we examine, algorithms appear in the literature which consistof a sorting step to determine an optimal job sequence, followedby a dynamic programming step which...

Persistent link: https://www.econbiz.de/10011301157

Heuristic concentration and tabu search : a nose to nose comparison

Rosing, K. E.; ReVelle, C. S. - 1997

In 1997 two papers new applying the metaheuristics Tabu Search (TS) and Heuristic Concentration (HC) tothe p-median problem were published in consecutive volumes of the European Journal of OperationalResearch. Here we apply the method of HC some of the data sets which were used for...

Persistent link: https://www.econbiz.de/10010337322

Robot cars and dynamic bottleneck congestion : the effects on capacity, value of time and preference heterogeneity

Berg, Vincent A. C. van den; Verhoef, Erik T. - 2015 - This version: 9 June 2015

"Robot cars" are cars that allow for automated driving. They can drive closer together than human driven "normal cars …" and thereby raise road capacity. Obtaining a robot car instead of a normal car can also be expected to lower the userś … robot car users, the VOT is therefore (more strongly) heterogeneous. We study the effect of robot cars on social welfare for …

Persistent link: https://www.econbiz.de/10010532595