{"title":"Bicriterion jobshop scheduling with total flowtime and sum of squared lateness","authors":"Parthasarati Dileepan, Tapan Sen","doi":"10.1016/0167-188X(91)90008-P","DOIUrl":null,"url":null,"abstract":"<div><p>In this paper sufficient conditions for optimality for the single machine job scheduling problem with a linear combination of total flowtime and sum of squared lateness as the objective function are developed. Based on the sufficient conditions a lower bound for the objective function for a given schedule is derived. A branch-and-bound procedure incorporating the lower bound has also been developed. In addition, we also show how to fathom nodes in the branching tree using the <em>a-priori</em> precedence relationships among the jobs that can be determined using the sufficient conditions. Computational experiments for the branch-and-bound and its results are also presented.</p></div>","PeriodicalId":100476,"journal":{"name":"Engineering Costs and Production Economics","volume":"21 3","pages":"Pages 295-299"},"PeriodicalIF":0.0000,"publicationDate":"1991-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/0167-188X(91)90008-P","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Engineering Costs and Production Economics","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/0167188X9190008P","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
In this paper sufficient conditions for optimality for the single machine job scheduling problem with a linear combination of total flowtime and sum of squared lateness as the objective function are developed. Based on the sufficient conditions a lower bound for the objective function for a given schedule is derived. A branch-and-bound procedure incorporating the lower bound has also been developed. In addition, we also show how to fathom nodes in the branching tree using the a-priori precedence relationships among the jobs that can be determined using the sufficient conditions. Computational experiments for the branch-and-bound and its results are also presented.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
