Show simple item record

dc.contributor Graduate Program in Management.
dc.contributor.advisor Tuğcu, Seyhan.
dc.contributor.author Alpat, Fahrettin Tuğhan Uludağ.
dc.date.accessioned 2023-03-16T12:13:49Z
dc.date.available 2023-03-16T12:13:49Z
dc.date.issued 1985.
dc.identifier.other AD 1985 Al7
dc.identifier.uri http://digitalarchive.boun.edu.tr/handle/123456789/16787
dc.description.abstract This thesis considers a scheduling problem that has precedence constraints of a general form as in CPM/Pert problems. It consists of two stages: First, the schedule of activities which minimizes total resource usage (optimum schedule) is generated. For this purpose, an exhaustive enumeration procedure is developed. Second, for this schedule, optimum resource requirements and overtime schedule that minimizes the total of regular and overtime work along with hiring and firing costs are determined. To accomplish this, another exhaustive enumeration technique is used to find the set of jobs that uses overtime. Following are obtained: * Total resources used (with and without overtime) for each unit of time in the project, * Set of activities using overtime, * Total cost in case of regular work, * Minimum cost in case of overtime work.
dc.format.extent 30 cm.
dc.publisher Thesis (M.A.) - Bogazici University. Institute for Graduate Studies in Social Sciences, 1985.
dc.subject.lcsh Production scheduling.
dc.subject.lcsh Network analysis (Planning)
dc.subject.lcsh PERT (Network analysis)
dc.title An enumeration method for project scheduling
dc.format.pages viii, 66 leaves;


Files in this item

This item appears in the following Collection(s)

Show simple item record

Search Digital Archive


Browse

My Account