具有加权完成时间的并行机环境下的订单接受与调度

IF 16.4 1区化学 Q1 CHEMISTRY, MULTIDISCIPLINARY

Accounts of Chemical Research Pub Date : 2018-08-01 DOI:10.1504/EJIE.2018.10014670

Venkata Prasad Palakiti, Usha Mohan, V. Ganesan

{"title":"具有加权完成时间的并行机环境下的订单接受与调度","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":"{\"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}","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

摘要

本文研究了具有收益、处理时间和权值特征的订单接收与调度问题。针对以收益减去调度成本为目标的调度问题，提出了一个混合整数线性规划模型。该问题是NP困难的，并提出了一种分支定界(B%B)算法来解决该问题。提出了B%B算法的扩展，用于求解非常大的问题实例，以获得e-最优解。通过计算实验，对B%B算法和扩展B%B算法的性能进行了评价，并与用CPLEX求解器求解MILP问题公式得到的解进行了比较。[2017年6月15日收到;2018年2月2日修订;接受2018年3月10日]

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Order acceptance and scheduling in a parallel machine environment with weighted completion time

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 化学-化学综合

CiteScore

31.40

自引率

1.10%

发文量

312

审稿时长

2 months

期刊介绍： 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.