DSpace Arşivi :: by Yazar "Dawd, Sebrina Tadesse" değerine göre listeleniyor

Listeleniyor 1 - 1 / 1

A branch and bound approach for single machine scheduling problem
(İstanbul Ticaret Üniversitesi, 2017) Dawd, Sebrina Tadesse; Ayvaz, Berk
Last decades, scheduling problems have attracted researchers because of the fact that they play a critical role in production planning. This paper studies to minimize the sum weight of lateness on a single machine scheduling problem. There are given n jobs and for each job we have a release date, a processing time, a due date and weight in a constraint working environment. Single machine models are important for various reasons because of the fact that it not only provides insights into the single machine environment but also bottleneck problem. There are various exact methods in order to solve single machine scheduling problem with make span objective function. However, if the objective functions is tardiness, lateness, weighted tardiness, weighted lateness etc. to find exact solution is very difficult. In this paper, branch and bound method is proposed to solve single machine scheduling problem with the total weighed lateness objective for small number of job. The proposed method has applied on a job size of 4, 5 and 8 and provides optimal result.