Abstract
In this thesis, a dock scheduling problem for an assembly plant of a large automobile manufacturer is solved heuristically with the methods of integer programming. The problem consists of scheduling the unloading process of a large number of trucks, which supply the assembly plant with parts, at two unloading docks with capacity restrictions. The problem under study is encountered within an environment of a Just-in-Time supply system with high delivery frequency and low delivery volume. In an extension of the dock scheduling problem, the logistic system for the supply of parts is deigned, deciding both the proper capacity of the system along with the trucks' composition. The computation of the dock unloading schedule is a high-level decision problem. Therefore all data is assumed to be deterministic. Comprehensive computational results that demonstrate the efficiency of the proposed approaches are included.