具有过去序列相关的设置时间和劣化作业的单机调度问题

2010 Third International Joint Conference on Computational Science and Optimization Pub Date : 2010-05-28 DOI:10.1109/CSO.2010.120

Yunqiang Yin, Z. Ruan, Hai Sun

{"title":"具有过去序列相关的设置时间和劣化作业的单机调度问题","authors":"Yunqiang Yin, Z. Ruan, Hai Sun","doi":"10.1109/CSO.2010.120","DOIUrl":null,"url":null,"abstract":"This paper considers a single-machine scheduling model with past-sequence-dependent setup times and deterioration jobs, where the actual processing time of a job is a function of the job’s scheduled position. It shows that the optimal schedules for the single-machine scheduling problems to minimize makespan and total completion time are both V-shaped with respect to job processing times.","PeriodicalId":427481,"journal":{"name":"2010 Third International Joint Conference on Computational Science and Optimization","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-05-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Single-Machine Scheduling Problems with Past-Sequence-Dependent Setup Times and Deterioration Jobs\",\"authors\":\"Yunqiang Yin, Z. Ruan, Hai Sun\",\"doi\":\"10.1109/CSO.2010.120\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper considers a single-machine scheduling model with past-sequence-dependent setup times and deterioration jobs, where the actual processing time of a job is a function of the job’s scheduled position. It shows that the optimal schedules for the single-machine scheduling problems to minimize makespan and total completion time are both V-shaped with respect to job processing times.\",\"PeriodicalId\":427481,\"journal\":{\"name\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-05-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 Third International Joint Conference on Computational Science and Optimization\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CSO.2010.120\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 Third International Joint Conference on Computational Science and Optimization","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSO.2010.120","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 2

摘要

本文考虑了具有过去序列依赖的作业的单机调度模型，其中作业的实际加工时间是作业调度位置的函数。结果表明，单机调度问题中最大完工时间和总完成时间的最优调度与作业处理时间均呈v型关系。

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

查看原文本刊更多论文

Single-Machine Scheduling Problems with Past-Sequence-Dependent Setup Times and Deterioration Jobs

This paper considers a single-machine scheduling model with past-sequence-dependent setup times and deterioration jobs, where the actual processing time of a job is a function of the job’s scheduled position. It shows that the optimal schedules for the single-machine scheduling problems to minimize makespan and total completion time are both V-shaped with respect to job processing times.

求助全文

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

来源期刊

2010 Third International Joint Conference on Computational Science and Optimization

自引率

0.00%

发文量