A.E. Gerodimos
http://repub.eur.nl/ppl/4600/
List of Publicationsenhttp://repub.eur.nl/logo.jpg
http://repub.eur.nl/
RePub, Erasmus University RepositoryImproved dynamic programs for some batching problems involving the maximum lateness criterion
http://repub.eur.nl/pub/14436/
Sun, 01 Oct 2000 00:00:01 GMT<div>A.P.M. Wagelmans</div><div>A.E. Gerodimos</div>
We study four scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature that consist of a sorting step to determine an optimal job sequence, followed by a dynamic programming step that determines the optimal batches. In each case, the dynamic program is based on a backward recursion of which a straightforward implementation requires O(n2) time, where n is the number of jobs. We present improved implementations of these dynamic programs that are based on monotonicity properties of the objective expressed as a function of the total processing time of the first batch. These properties and the use of efficient data structures enable optimal solutions to be found for each of the four problems in O(n log n) time; in two cases, the batching step is actually performed in linear time and the overall complexity is determined by the sorting step.Improved dynamic programs for batching problems with maximum lateness criterion
http://repub.eur.nl/pub/1521/
Thu, 31 Dec 1998 00:00:01 GMT<div>A.P.M. Wagelmans</div><div>A.E. Gerodimos</div>
We study a class of scheduling problems involving the maximum lateness criterion and an element of batching. For all the problems that we examine, algorithms appear in the literature
which consist of a sorting step to determine an optimal job sequence, followed by a dynamic programming step which determines the optimal
batches. In each case, the dynamic program is based on a backward recursion of which a
straightfoward implementation requires O(n^2) time, where n is the number of jobs. We present improved implementations of these dynamic
programs that are based on monotonicity properties of the objective expressed as a function of the length of the first batch. These
properties and the use of efficient data structures enable us to exclude partial schedules that cannot lead to an overall optimum
early on in the enumeration process. The four problems that we consider are solved in O(n log n) time; in two occasions, the batching step is actually performed in linear time and the overall
complexity is determined by the sorting step.