University of Twente Student Theses

Login

Scheduling-Polyhedron with a Time-Horizon

Horjus, S.A.J. (2024) Scheduling-Polyhedron with a Time-Horizon.

[img] PDF
882kB
Abstract:In a single machine scheduling problem where the machine can handle only one job at a time and is non preemptive, we look at schedules on a finite horizon [0, T]. These schedules are defined by a vector containing the completion times of each job. For positive processing times, a polyhedron P can be constituted that completely describes the convex hull of these feasible schedules. In this thesis we find this P and prove that it is the convex hull of all feasible schedules on the horizon [0, T]
Item Type:Essay (Bachelor)
Faculty:EEMCS: Electrical Engineering, Mathematics and Computer Science
Subject:31 mathematics
Programme:Applied Mathematics BSc (56965)
Link to this item:https://purl.utwente.nl/essays/102131
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page