带到期窗口的多处理器作业车间调度

2011 IEEE International Conference on Industrial Engineering and Engineering Management Pub Date : 2011-12-29 DOI:10.1109/IEEM.2011.6117901

Rong-Hwa Huang, Shun-Chi Yu

{"title":"带到期窗口的多处理器作业车间调度","authors":"Rong-Hwa Huang, Shun-Chi Yu","doi":"10.1109/IEEM.2011.6117901","DOIUrl":null,"url":null,"abstract":"Job shop is one of the most popular manufacturing environments in practice and is extensively discussed in literatures. Most of the literatures focus on one machine setup at each shop, which usually does not happen in practice for the purpose of workload balancing and make-span shortening. Therefore, this study aims to minimize total earliness and tardiness costs of a multi-processor job shop scheduling problem with due windows. Ant colony optimization (ACO) is deployed to solve the problem. Simulation data testing results show that ACO has similar solutions to integer programming in small scale problems, and robust, effective and time-efficient solutions in large scale problems.","PeriodicalId":427457,"journal":{"name":"2011 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Multi-processor job shop scheduling with due windows\",\"authors\":\"Rong-Hwa Huang, Shun-Chi Yu\",\"doi\":\"10.1109/IEEM.2011.6117901\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Job shop is one of the most popular manufacturing environments in practice and is extensively discussed in literatures. Most of the literatures focus on one machine setup at each shop, which usually does not happen in practice for the purpose of workload balancing and make-span shortening. Therefore, this study aims to minimize total earliness and tardiness costs of a multi-processor job shop scheduling problem with due windows. Ant colony optimization (ACO) is deployed to solve the problem. Simulation data testing results show that ACO has similar solutions to integer programming in small scale problems, and robust, effective and time-efficient solutions in large scale problems.\",\"PeriodicalId\":427457,\"journal\":{\"name\":\"2011 IEEE International Conference on Industrial Engineering and Engineering Management\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-12-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 IEEE International Conference on Industrial Engineering and Engineering Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2011.6117901\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE International Conference on Industrial Engineering and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2011.6117901","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

作业车间是实践中最流行的制造环境之一，在文献中被广泛讨论。大多数文献关注的是每个车间一台机器的设置，为了平衡工作负载和缩短制造周期，在实践中通常不会发生这种情况。因此，本研究的目的在于最小化具有到期窗口的多处理机作业车间调度问题的总早、迟成本。采用蚁群算法求解该问题。仿真数据测试结果表明，蚁群算法在小规模问题上具有与整数规划相似的解，在大规模问题上具有鲁棒性、有效性和时效性。

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

查看原文本刊更多论文

Multi-processor job shop scheduling with due windows

Job shop is one of the most popular manufacturing environments in practice and is extensively discussed in literatures. Most of the literatures focus on one machine setup at each shop, which usually does not happen in practice for the purpose of workload balancing and make-span shortening. Therefore, this study aims to minimize total earliness and tardiness costs of a multi-processor job shop scheduling problem with due windows. Ant colony optimization (ACO) is deployed to solve the problem. Simulation data testing results show that ACO has similar solutions to integer programming in small scale problems, and robust, effective and time-efficient solutions in large scale problems.

求助全文

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

来源期刊

2011 IEEE International Conference on Industrial Engineering and Engineering Management

自引率

0.00%

发文量