Improved Dynamic Programs for Some Batching Problems involving the Maximum Lateness Criterion

A.P.M. Wagelmans () and A.E. Gerodimos
Additional contact information
A.P.M. Wagelmans: Erasmus University Rotterdam
A.E. Gerodimos: Imperial College, London

No 99-036/4, Tinbergen Institute Discussion Papers from Tinbergen Institute

Abstract: 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 determines the optimal batches.In each case, the dynamic program is based on a backward recursionof which a straightfoward implementation requires O(n^2) time, wheren is the number of jobs. We present improved implementations of thesedynamic programs that are based on monotonicity properties of theobjective expressed as a function of the length of the first batch.These properties and the use of efficient data structures enable usto exclude partial schedules that cannot lead to an overall optimumearly on in the enumeration process. The four problems that weconsider are solved in O(n log n) time; in two occasions, thebatching step is actually performed in linear time and the overallcomplexity is determined by the sorting step.

Date: 1999-05-26
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://papers.tinbergen.nl/99036.pdf (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tin:wpaper:19990036

Access Statistics for this paper

More papers in Tinbergen Institute Discussion Papers from Tinbergen Institute Contact information at EDIRC.
Bibliographic data for series maintained by Tinbergen Office +31 (0)10-4088900 ().