求解时滞置换流水调度问题总加权延迟准则的分支定界算法

Q3 Decision Sciences Yugoslav Journal of Operations Research Pub Date : 2021-01-01 DOI:10.2298/yjor210615023a

F. Almathkour, Omar Belgacem, Said Toumi, B. Jarboui

{"title":"求解时滞置换流水调度问题总加权延迟准则的分支定界算法","authors":"F. Almathkour, Omar Belgacem, Said Toumi, B. Jarboui","doi":"10.2298/yjor210615023a","DOIUrl":null,"url":null,"abstract":"This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.","PeriodicalId":52438,"journal":{"name":"Yugoslav Journal of Operations Research","volume":"2014 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2021-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags\",\"authors\":\"F. Almathkour, Omar Belgacem, Said Toumi, B. Jarboui\",\"doi\":\"10.2298/yjor210615023a\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.\",\"PeriodicalId\":52438,\"journal\":{\"name\":\"Yugoslav Journal of Operations Research\",\"volume\":\"2014 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Yugoslav Journal of Operations Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.2298/yjor210615023a\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Decision Sciences\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Yugoslav Journal of Operations Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.2298/yjor210615023a","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Decision Sciences","Score":null,"Total":0}

引用次数: 1

摘要

本文利用分支定界算法研究了具有时间滞后约束的置换流水车间调度问题，以最小化总加权延迟准则。提出了流水车间调度问题的一个新的下界。计算实验表明，该算法在质量和时间要求方面提供了较好的解决方案。

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

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

Branch and bound algorithm for solving the total weighted tardiness criterion for the permutation flowshop scheduling problem with time lags

This paper deals with the permutation flowshop scheduling problem with time lags constraints to minimize the total weighted tardiness criterion by using the Branch and Bound algorithm. A new lower bound was developed for the flowshop scheduling problem. The computational experiments indicate that the proposed algorithm provides good solution in terms of quality and time requirements.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊