因此flow shop也被称为流水作业或顺序作业 job shop: 如果每个作业需要在每个处理机上加工,每个作业有自己的加工顺序,称之为异顺序作业。 open shop: 如果每个作业需要在每个处理机上加工,每个作业可按任意顺序加工,称之为自由顺序作业或开放作业。 flow-shop特征 1.各工件均需在所有机器(集)上加工; 2.每个工件...
柔性作业车间调度（flexible job-shop scheduling）、开放车间调度（open-shop scheduling）等多种类型。
1.job每个工件不需要经过所有机器（集），可以跳过某些工序，而 flow工件需要经过所有工件 ；2.job中可...
Two-machine shop scheduling: Compromise between flexibility and makespan value We resolve the complexity status of the relevant problems for the two-machine flow shop, job shop and open shop. A number of approximation algorithms ... C Esswein,JC Billaut,VA Strusevich - 《European Journal of Ope...
Koulamas, "Flow shop and open shop scheduling with a critical machine and two operations per job," European Journal of Operational Research, vol. 127, no. 1, pp. 120-125, 2000.Kyparisis G. J., Koulamas, C., Flow shop and open shop scheduling with a critical machine and two ...
exact algorithms and approximation algorithms in single machine, parallel machine, flow shop, open shop, job shop scheduling environment with different criteria... M Ying,C Chu,C Zuo - 《Computers & Industrial Engineering》 被引量: 440发表: 2010年 Scheduling batches with simultaneous job processing...
For the 10-job instance, the number of candidates increases. This uncommon behaviour of the optimal solution and, consequently, the complexity of the problem studied here, remain open questions, and are challenging topics for future research. 展开 关键词: scheduling proportionate flow shop no-wait...
It is shown that the problem of scheduling a two-processor n-job open shop nonpreemptively in order to minimize mean flow time is NP-complete even if input length is measured by the sum of the task lengths. The proof is similar in approach to that used by Garey, Johnson and Sethi to ...
This paper studies two models of two-stage processing with flowshop at the first stage followed by open shop at the second stage. The first model involves multiple machines at the first stage and two machines at the second stage, and the other involves multiple machines at both stages. In ...
Firstly, to make DE suitable for solving flow-shop scheduling problem, a largest-order-value (LOV) rule is used to convert the continuous values of individuals in DE to job permutations. Secondly, a speed-up evaluation method is developed according to the property of the NFSSP with SDSTs ...