发布求助
文献互助 智能选刊 最新文献

Scheduling eJournal最新文献

筛选
英文 中文
A Pyramidal Evolutionary Algorithm with Different Inter-Agent Partnering Strategies for Scheduling Problems 调度问题中不同agent间伙伴策略的金字塔进化算法
Scheduling eJournal Pub Date : 2001-01-01 DOI: 10.2139/ssrn.2832055
U. Aickelin
{"title":"A Pyramidal Evolutionary Algorithm with Different Inter-Agent Partnering Strategies for Scheduling Problems","authors":"U. Aickelin","doi":"10.2139/ssrn.2832055","DOIUrl":"https://doi.org/10.2139/ssrn.2832055","url":null,"abstract":"This paper combines the idea of a hierarchical distributed genetic algorithm with different interagent partnering strategies. Cascading clusters of sub-populations are built from bottom up, with higher-level sub-populations optimising larger parts of the problem. Hence higher-level subpopulations search a larger search space with a lower resolution whilst lower-level subpopulations search a smaller search space with a higher resolution. The effects of different partner selection schemes amongst the agents on solution quality are examined for two multiplechoice optimisation problems. It is shown that partnering strategies that exploit problemspecific knowledge are superior and can counter inappropriate (sub-) fitness measurements.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115951358","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Minimizing Makespan in Flowshops with Pallet Requirements: Computational Complexity 最小化有托盘要求的流水车间的完工时间:计算复杂度
Scheduling eJournal Pub Date : 1997-11-01 DOI: 10.1080/03155986.1997.11732335
M. W. Wang, S. Sethi, C. Sriskandarajah, S. van de Velde
{"title":"Minimizing Makespan in Flowshops with Pallet Requirements: Computational Complexity","authors":"M. W. Wang, S. Sethi, C. Sriskandarajah, S. van de Velde","doi":"10.1080/03155986.1997.11732335","DOIUrl":"https://doi.org/10.1080/03155986.1997.11732335","url":null,"abstract":"We establish the computational complexity of the problem of minimizing makespan in a flowshop, where each jobs requires a pallet the entire time, from the start of its first operation until the completion of the last operation. We prove that the problem is NP-hard in the strong sense for m > =2 and K >= 3, and for m > =3 and K >= 2, where m is the number of machines and K is the number of pallets in the system.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126851320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Multiple Finite Production Rate Dynamic Lot Size Inventory Models 多有限生产率动态批量库存模型
Scheduling eJournal Pub Date : 1979-08-01 DOI: 10.1287/opre.29.5.931
S. Sethi, S. Chand
{"title":"Multiple Finite Production Rate Dynamic Lot Size Inventory Models","authors":"S. Sethi, S. Chand","doi":"10.1287/opre.29.5.931","DOIUrl":"https://doi.org/10.1287/opre.29.5.931","url":null,"abstract":"This paper investigates the dynamic inventory model for the case when production in a period is restricted to a finite set of specified values. The model allows the production rate to be any value in the set {0, P, 2P, ', mP}, where m is a nonnegative integer. It is assumed that the setup cost is paid only once for a production block and the holding cost is monotonically or linearly increasing. Efficient planning horizon procedures have been developed for this model.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1979-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116888990","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Order Acceptance and Scheduling in a Single-Machine Environment: Exact and Heuristic Algorithms 单机器环境下的订单接受和调度:精确和启发式算法
Scheduling eJournal Pub Date : 1900-01-01 DOI: 10.2139/ssrn.1472957
F. T. Nobibon, Jade Herbots, R. Leus
{"title":"Order Acceptance and Scheduling in a Single-Machine Environment: Exact and Heuristic Algorithms","authors":"F. T. Nobibon, Jade Herbots, R. Leus","doi":"10.2139/ssrn.1472957","DOIUrl":"https://doi.org/10.2139/ssrn.1472957","url":null,"abstract":"In this paper, we develop exact and heuristic algorithms for the order acceptance and scheduling problem in a single-machine environment. We consider the case where a pool consisting of firm planned orders as well as potential orders is available from which an over-demanded company can select. The capacity available for processing the accepted orders is limited and orders are characterized by known processing times, delivery dates, revenues and the weight representing a penalty per unit-time delay beyond the delivery date promised to the customer. We prove the non-approximability of the problem and give two linear formulations that we solve with CPLEX. We devise two exact branch-and-bound procedures able to solve problem instances of practical dimensions. For the solution of large instances, we propose six heuristics. We provide a comparison and comments on the efficiency and quality of the results obtained using both the exact and heuristic algorithms, including the solution of the linear formulations using CPLEX.","PeriodicalId":374055,"journal":{"name":"Scheduling eJournal","volume":"175 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122139867","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信