Two machine mixed shop scheduling problem with controllable machine speeds
Two machine mixed shop scheduling problem with controllable machine speeds
复制标题
DOI：
10.1016/0166-218x(87)90005-9
复制
发表时间：
1987-05
期刊：
影响因子：
--
通讯作者：
H. Ishii;T. Masuda;T. Nishida
中科院分区：
文献类型：
--
作者：
H. Ishii;T. Masuda;T. Nishida
本文考虑了一个排序问题，其目标是确定一个最优的机器速度对和一个最优的时间表。有两台机器A，Bandn作业，每一个都由两个操作组成。一个操作在机器A上进行，另一个在机器B上进行。该作业集由两个不相交的子集FandO组成。F是一组流水作业，O是一组开放式作业。也就是说，对于F中的每个作业，A上的处理必须在B上的处理之前完成。另一方面，没有指定每个作业的处理顺序，因此可以在任一机器上开始每个作业的处理。每台机器最多处理一个作业，并且每个作业最多在一台机器上同时处理。在机器速度可控的条件下，使最大完工时间和机器速度的费用之和最小化，在机器速度不是固定的而是可变的意义下，该问题是两台机器混合车间调度问题[6]的推广。对于该问题，本文给出了一个多项式时间阶的求解方法。
This paper considers a scheduling problem in which the objective is to determine an optimal machine speed pair and an optimal schedule. There are two machinesA, Bandnjobs each of which consists of two operations. One operation is to be processed on machineAand the other on machineB. The job set consisits of two disjoint subsetsFandO. Fis a set of flow shop type jobs, whileOis a set of open shop type jobs. That is, for each jobiinF, processing onAmust be completed before processing onB. On the other hand, processing order of each jobiinOis not specified and so processing of each job can be started on either machine. Each machine processes at most one job and each job is processed on at most one machine, simultaneously. Further it is assumed that the speed of each machine is controllable.In the situation, the total sum of costs associated with the maximum completion time and machine speeds is to be minimized.The problem is a generalization of two machine mixed shop scheduling problem [6] in a sense that machine speeds are not fixed but variables. For the problem, this paper provides a polynomial time order solution procedure.