{"title":"不相关的并行机调度同时与速率修改活动和早期和延迟处罚","authors":"Dar-Li Yang, Hsin-Tao Lee, Suh-Jenq Yang","doi":"10.1080/10170669.2012.691430","DOIUrl":null,"url":null,"abstract":"In this paper, we consider a scheduling problem simultaneously with rate-modifying activities and earliness and tardiness penalties on an unrelated parallel-machine setting. We assume that each machine has at most one rate-modifying activity to improve its production efficiency during the scheduling horizon and all the jobs have a common due-date. The objective is to determine jointly the optimal positions of rate-modifying activities, the optimal common due-date of all jobs, and the optimal schedule to minimize the sum of earliness and tardiness costs. We show that the problem can be optimally solved in polynomial time.","PeriodicalId":369256,"journal":{"name":"Journal of The Chinese Institute of Industrial Engineers","volume":"86 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":"{\"title\":\"Unrelated parallel-machine scheduling simultaneously with rate-modifying activities and earliness and tardiness penalties\",\"authors\":\"Dar-Li Yang, Hsin-Tao Lee, Suh-Jenq Yang\",\"doi\":\"10.1080/10170669.2012.691430\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we consider a scheduling problem simultaneously with rate-modifying activities and earliness and tardiness penalties on an unrelated parallel-machine setting. We assume that each machine has at most one rate-modifying activity to improve its production efficiency during the scheduling horizon and all the jobs have a common due-date. The objective is to determine jointly the optimal positions of rate-modifying activities, the optimal common due-date of all jobs, and the optimal schedule to minimize the sum of earliness and tardiness costs. We show that the problem can be optimally solved in polynomial time.\",\"PeriodicalId\":369256,\"journal\":{\"name\":\"Journal of The Chinese Institute of Industrial Engineers\",\"volume\":\"86 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"11\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of The Chinese Institute of Industrial Engineers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1080/10170669.2012.691430\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of The Chinese Institute of Industrial Engineers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/10170669.2012.691430","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Unrelated parallel-machine scheduling simultaneously with rate-modifying activities and earliness and tardiness penalties
In this paper, we consider a scheduling problem simultaneously with rate-modifying activities and earliness and tardiness penalties on an unrelated parallel-machine setting. We assume that each machine has at most one rate-modifying activity to improve its production efficiency during the scheduling horizon and all the jobs have a common due-date. The objective is to determine jointly the optimal positions of rate-modifying activities, the optimal common due-date of all jobs, and the optimal schedule to minimize the sum of earliness and tardiness costs. We show that the problem can be optimally solved in polynomial time.