Single machine scheduling problem with controllable setup and jobs processing times and position-de
更新日期:2019-08-01     来源:西北师范大学学报(自然科学版)   作者:罗成新 (Luo Chengxin)  浏览次数:16
核心提示:《Single machine scheduling problem with controllable setup andjobs processing times and position-de》为作者:罗成新最新的研究成果,本论文的

《Single machine scheduling problem with controllable setup and jobs processing times and position-de》为作者:罗成新最新的研究成果,本论文的主要观点为This paper concerns with a single-machine scheduling problem in which each job has a setup before being processed, the setup time and the processing time of jobs are controllable by allocating a continuously nonrenewable resource, respectively。 We assume that each setup and processing time of jobs has a workload that is both job and position-dependent。 Two problems are investigated。 In the first problem, the total amount of resource for setup and processing times does not exceed an up bound, respectively。 The objective is to determine the setup sequence, the job sequence and the resource allocation scheme to minimize makespan; while in the second problem the total amount of resource are not limited, the aim is to determine the amount of resource used, the setup sequence, the job sequence and the resource allocation scheme to minimize a total cost of makespan and resource。 We show that the problems can be solved in polynomial time and present optimal algorithms。现欲投《西北师范大学学报(自然科学版)》,不知是否符合录用要求,望您批评与指正。