{"title":"Order acceptance and scheduling in a parallel machine environment with weighted completion time","authors":"Venkata Prasad Palakiti, Usha Mohan, V. Ganesan","doi":"10.1504/EJIE.2018.10014670","DOIUrl":null,"url":null,"abstract":"This paper studies the order acceptance and scheduling (OAS) problem in an identical parallel machine environment where orders are characterised by their revenues, processing times and weights. A mixed integer linear programming (MILP) model is presented for the problem with the objective of maximising the revenue minus the scheduling cost. The problem is NP- hard and a branch and bound (B%B) algorithm is developed to solve the problem. An extension of the B%B algorithm is proposed to solve very large problem instances to obtain e-optimal solutions. The B%B algorithm and the extended B%B are evaluated for their performances against the solutions obtained by solving the MILP problem formulation using CPLEX solver through computational experiments. [Received 15 June 2017; Revised 2 February 2018; Accepted 10 March 2018]","PeriodicalId":1,"journal":{"name":"Accounts of Chemical Research","volume":null,"pages":null},"PeriodicalIF":16.4000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Accounts of Chemical Research","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1504/EJIE.2018.10014670","RegionNum":1,"RegionCategory":"化学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"CHEMISTRY, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 4
Abstract
This paper studies the order acceptance and scheduling (OAS) problem in an identical parallel machine environment where orders are characterised by their revenues, processing times and weights. A mixed integer linear programming (MILP) model is presented for the problem with the objective of maximising the revenue minus the scheduling cost. The problem is NP- hard and a branch and bound (B%B) algorithm is developed to solve the problem. An extension of the B%B algorithm is proposed to solve very large problem instances to obtain e-optimal solutions. The B%B algorithm and the extended B%B are evaluated for their performances against the solutions obtained by solving the MILP problem formulation using CPLEX solver through computational experiments. [Received 15 June 2017; Revised 2 February 2018; Accepted 10 March 2018]
期刊介绍：
Accounts of Chemical Research presents short, concise and critical articles offering easy-to-read overviews of basic research and applications in all areas of chemistry and biochemistry. These short reviews focus on research from the author’s own laboratory and are designed to teach the reader about a research project. In addition, Accounts of Chemical Research publishes commentaries that give an informed opinion on a current research problem. Special Issues online are devoted to a single topic of unusual activity and significance.
Accounts of Chemical Research replaces the traditional article abstract with an article "Conspectus." These entries synopsize the research affording the reader a closer look at the content and significance of an article. Through this provision of a more detailed description of the article contents, the Conspectus enhances the article's discoverability by search engines and the exposure for the research.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
