业务服务调度

J. Dorn
{"title":"业务服务调度","authors":"J. Dorn","doi":"10.4018/jal.2010100104","DOIUrl":null,"url":null,"abstract":"The management and predictive planning of the processes to create business services is more difficult than the planning of production processes, because services cannot be produced in stock and customers are involved in their creation. In this paper, the author proposes a method for service scheduling and optimization based on an ontology to describe business services and related concepts. The author schedules operations required to create a service. With each service process and its operations, soft and hard constraints on the execution of operations and the required resources are posted. These constraints are derived from service level agreements. A legal plan must then satisfy all hard constraints. All soft constraints are matter of optimization. Using a tabu search, a near-optimal solution of the service scheduling problem is achieved.","PeriodicalId":443888,"journal":{"name":"Int. J. Appl. Logist.","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Business Service Scheduling\",\"authors\":\"J. Dorn\",\"doi\":\"10.4018/jal.2010100104\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The management and predictive planning of the processes to create business services is more difficult than the planning of production processes, because services cannot be produced in stock and customers are involved in their creation. In this paper, the author proposes a method for service scheduling and optimization based on an ontology to describe business services and related concepts. The author schedules operations required to create a service. With each service process and its operations, soft and hard constraints on the execution of operations and the required resources are posted. These constraints are derived from service level agreements. A legal plan must then satisfy all hard constraints. All soft constraints are matter of optimization. Using a tabu search, a near-optimal solution of the service scheduling problem is achieved.\",\"PeriodicalId\":443888,\"journal\":{\"name\":\"Int. J. Appl. Logist.\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Int. J. Appl. Logist.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4018/jal.2010100104\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. J. Appl. Logist.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4018/jal.2010100104","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

创建业务服务的过程的管理和预测计划比生产过程的计划更困难,因为服务不能以库存的形式生产,而且客户也参与了服务的创建。本文提出了一种基于本体描述业务服务及其相关概念的服务调度与优化方法。作者安排创建服务所需的操作。对于每个服务流程及其操作,发布了操作执行的软约束和硬约束以及所需的资源。这些约束来源于服务水平协议。一个合法的计划必须满足所有硬约束。所有软约束都是优化问题。通过禁忌搜索,获得了服务调度问题的近似最优解。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Business Service Scheduling
The management and predictive planning of the processes to create business services is more difficult than the planning of production processes, because services cannot be produced in stock and customers are involved in their creation. In this paper, the author proposes a method for service scheduling and optimization based on an ontology to describe business services and related concepts. The author schedules operations required to create a service. With each service process and its operations, soft and hard constraints on the execution of operations and the required resources are posted. These constraints are derived from service level agreements. A legal plan must then satisfy all hard constraints. All soft constraints are matter of optimization. Using a tabu search, a near-optimal solution of the service scheduling problem is achieved.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信