Browsing by Author "Marx, J. D."
Now showing 1 - 1 of 1
Results Per Page
Sort Options
- ItemDevelopment of a scheduling model and solution algorithms for carriers in the automotive manufacturing environment(Stellenbosch : Stellenbosch University, 2006-04) Marx, J. D.; Van Wijck, W.; Bekker, James F.; Stellenbosch University. Faculty of Engineering. Dept. of Industrial Engineering.ENGLISH ABSTRACT: The aim of this thesis was to develop a scheduling model and solution algorithms for a generic problem that can be used to solve a scheduling problem at Autocarriers. The main characteristics of the generic problem are the following: Transporters are required to deliver various containers (each having a specific origin vertex and destination vertex) by transporting them through a network. Each transporter has a restricted cargo capacity which is a function of the number and types of containers loaded on the transporter. Containers can be stored temporarily at any vertex so that they can be moved by one or more transporters. Costs are incurred by delivering containers later than the required time and for transporters moving along the arcs of the network. A problem definition was created that describes the various entities of the generic problem. The problem definition was used to develop a scheduling model consisting of an objective function and a solution space. The solution space is defined by a set of conditions that describes all valid solutions to the problem. Two heuristic algorithms were developed to generate solutions to the problem. The maximum service level algorithm attempts to deliver containers on time without any regard to the cost involved. The second algorithm, the minimum total cost algorithm, attempts to minimise the sum of the costs of the problem. A software tool was developed that can be used to define an instance (or specific occurrence) of the generic problem and solve the problem approximately by means of the solution algorithms. The software tool has a simulation capability that is useful for evaluating the solution algorithms; hence various changes to a problem can be evaluated.