摘要原文 The flowshop scheduling problems with n jobs processed on two or three machines, and with two jobs processed on k machines are addressed where jobs have random and bounded processing times. The probability distributions of random processing times are unknown, and only the lower and upper...
We study a complex industrial scheduling problem arising from steel manufacturing with time-critical flowshop structure. Our core problem has a flowshop structure with multiple modes and recipes, sequence dependent setup times, strict precedence constraints between certain jobs, and inventory considerations...
多机多阶段流水车间(Flowshop)提前/拖期调度问题的目标是使工件的提前/拖期惩罚成本最小,这是一个NP完全问题
流水车间调度（flow-shop scheduling）、作业车间调度（job-shop scheduling）、柔性作业车间调度（flexible ...
In the past two decades, DE has been hybridized with other intelligent algorithms and applied to numerous flow shop scheduling problems. For example, Han, Gong, and Sun [38] proposed a discrete Artificial Bee Colony (ABC) algorithm incorporating DE for the flow shop scheduling problem with ...
This paper studies a new generalization of the regular permutation flowshop scheduling problem (PFSP) referred to as the distributed permutation flowshop scheduling problem or DPFSP. Under this generalization, we assume that there are a total of F identical factories or shops, each one with m mac...
A self-adaptive differential evolution for the permutation flow shop scheduling problem the crossover and selection operator of DE are modified.For permutation flow shop problems(PFSP) with the makespan criterion,the largest-order-value rule ... X Xu,Z Xiang,W Wang 被引量: 6发表: 2010年 Hybri...
1) flow-shop scheduling problem 流水作业排序问题 1. The complexity and heuristic algorithm for theflow-shop scheduling problemwith a single server,are studied. 研究了带服务器的流水作业排序问题的复杂性和启发式算法。 2) flowing water 流水
1) flow shop scheduling problem 流水车间调度问题 1. Application of heuristic max-min ant system with mutation operator to flow shop scheduling problem; 带变异算子的启发式最大最小蚂蚁系统求解流水车间调度问题 更多例句>> 2) permutation flow shop scheduling problem 置换流水车间调度问题 1. Hybrid...
摘要: The objective is to minimize makespan for a special case of flow shop problems subject to the constraint that no in-process waiting is allowed. Several new results are proposed.关键词:Scheduling Problems Machine shops Constraints Applications ...