Constraint parallel machine scheduling problem with time window

Chen Bihui
{"title":"Constraint parallel machine scheduling problem with time window","authors":"Chen Bihui","doi":"10.1109/ICAICA52286.2021.9497909","DOIUrl":null,"url":null,"abstract":"On the one hand, the occurrence of major natural disasters makes some methods proved to be effective in theory not well applicable to the actual situation. On the other hand, the lack of normative network structure, nationwide network operation, individuals or groups in practice in the process of consumer, commercial travel and other business although can query from one city to another city traffic situation. The basic assumptions of classical sorting problems are constantly optimized, and many modern sorting problems are worth studying. But as a result of database operation time is short, late traffic system construction, system only by point-to-point transportation situation gives a recommended travel plan. It is highly subjective and may lead to problems such as low time efficiency and uneconomy. In this paper, we design a 3/2-approximation algorithm to solve such as the railway, aviation and highway systems are independent.","PeriodicalId":121979,"journal":{"name":"2021 IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE International Conference on Artificial Intelligence and Computer Applications (ICAICA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICA52286.2021.9497909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

On the one hand, the occurrence of major natural disasters makes some methods proved to be effective in theory not well applicable to the actual situation. On the other hand, the lack of normative network structure, nationwide network operation, individuals or groups in practice in the process of consumer, commercial travel and other business although can query from one city to another city traffic situation. The basic assumptions of classical sorting problems are constantly optimized, and many modern sorting problems are worth studying. But as a result of database operation time is short, late traffic system construction, system only by point-to-point transportation situation gives a recommended travel plan. It is highly subjective and may lead to problems such as low time efficiency and uneconomy. In this paper, we design a 3/2-approximation algorithm to solve such as the railway, aviation and highway systems are independent.
带时间窗的约束并行机调度问题
一方面,重大自然灾害的发生使得一些在理论上被证明有效的方法不能很好地适用于实际情况。另一方面,缺乏规范的网络结构,全国范围的网络运营,个人或团体在实际消费过程中,商务旅行等业务虽然可以查询从一个城市到另一个城市的交通情况。经典排序问题的基本假设不断优化,许多现代排序问题值得研究。但由于数据库运行时间短,交通系统建设滞后,系统只能根据点对点交通情况给出推荐的出行方案。它具有很强的主观性,可能会导致时间效率低、不经济等问题。在本文中,我们设计了一个3/2近似算法来解决如铁路、航空和公路系统是独立的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信