Use this URL to cite or link to this record in EThOS:
Title: Scheduling with fixed delivery dates
Author: Lesaoana, Maseka Anna
ISNI:       0000 0001 3608 3344
Awarding Body: University of Southampton
Current Institution: University of Southampton
Date of Award: 1991
Availability of Full Text:
Access from EThOS:
Full text unavailable from EThOS. Please try the link below.
Access from Institution:
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.
Supervisor: Not available Sponsor: Not available
Qualification Name: Thesis (Ph.D.) Qualification Level: Doctoral
EThOS ID:  DOI: Not available
Keywords: Machine scheduling