最小化有托盘要求的流水车间的完工时间:计算复杂度

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":"最小化有托盘要求的流水车间的完工时间:计算复杂度","authors":"M. W. Wang, S. Sethi, C. Sriskandarajah, S. van de Velde","doi":"10.1080/03155986.1997.11732335","DOIUrl":null,"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.0000,"publicationDate":"1997-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"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\":null,\"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.0000,\"publicationDate\":\"1997-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scheduling eJournal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/03155986.1997.11732335\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scheduling eJournal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/03155986.1997.11732335","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 15

摘要

我们建立了最小化流程车间完工时间问题的计算复杂性，其中每个作业从第一次操作开始直到最后一次操作完成，整个时间都需要一个托盘。证明了当m >= 2且K >= 3，以及当m >= 3且K >= 2，其中m为系统中的机器数量，K为系统中的托盘数量时，问题在强意义上是np困难的。

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

查看原文本刊更多论文

Minimizing Makespan in Flowshops with Pallet Requirements: Computational Complexity

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.

求助全文

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

来源期刊

Scheduling eJournal

自引率

0.00%

发文量