Lesaoana, Maseka Anna (1991) Scheduling with fixed delivery dates. University of Southampton, Doctoral Thesis.
Abstract
Most scheduling models assume that a job is delivered to the customer as soon as its processing completes. In many practical situations, delivery dates may be fixed before any jobs can be processed, and if a job completes between these dates it awaits the next delivery time. Thus, in such situations a job completes when it is delivered to the customer. We study deterministic scheduling problems in which deliveries of jobs to customers occur at fixed points in time. These types of problems arise in many situations in real life. The problem types are classified according to their computational complexity into two categories, viz those that are `easily' solvable and those that are `difficult'. Some selected problem types in the latter category are studied. The branch-and-bound technique plays a major role in testing these problems. Heuristic (or approximate) algorithms are also studied.
This record has no associated files available for download.
More information
Identifiers
Catalogue record
Export record
Contributors
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.