Scheduling with discounted revenues


Thesis Type: Postgraduate

Institution Of The Thesis: Orta Doğu Teknik Üniversitesi, Faculty of Engineering, Department of Industrial Engineering, Turkey

Approval Date: 2003

Student: AHMET KICIROĞLU

Co-Supervisor: MERAL AZİZOĞLU, HALDUN SÜRAL

Abstract:

Majority of the studies in the scheduling literature is devoted to time based performance measures. In this thesis, we develop a model that considers monetary issues in single machine scheduling environments. We assume all the jobs should be completed by a common due date. An early revenue is earned if the completion time is before or on the due date, and a tardy revenue is gained if the job is completed after the due date. We consider restricted and unrestricted due date versions of the problem. Our objective is the maximization of the net present value of all revenues. We first investigate some special cases of the problem, and present polynomial time algorithms to solve them. Then, we develop branch and bound algorithms with lower and upper bounding mechanisms. Computational experiments have shown that the branch and bound algorithms can solve large-sized problems in reasonable times.