Intelligent algorithms can empower the development of smart manufacturing, since they can
provide optimal solutions for detection, analysis, prediction and optimization. In recent ten …

Abstract The Non-Permutation Flow-Shop scheduling problem (NPFS) is a generalization of
the traditional Permutation Flow-Shop scheduling problem (PFS) that allows changes in the …

Optimizing the configuration of a complex production line is an NP-hard problem in various
machine settings. Solving real-life-size instances of this problem becomes a more common …

We introduce a new permutation representation for non-permutation schedules, and show
how the acceleration technique of Taillard can be extended to it. We propose three new …

We propose an extension to the flow shop scheduling problem named Heterogeneous Flow
Shop Scheduling Problem (Het-FSSP), where two simultaneous issues have to be resolved …

We propose a constructive and an iterated local search heuristic for minimizing the
makespan in the non-permutation flow shop scheduling problem. Both heuristics are based …

In many practical cases of flowshop environments and especially in flowline manufacturing
cells, some or all jobs may not require processing on all machines. Hence, this paper …

This paper focuses on minimising the maximum completion time for the two-stage
permutation flow shop scheduling problem with batch processing machines and …

针对井下煤层压裂过程中, 压裂裂缝扩展至煤岩交界面处, 受多种力学因素的综合影响,
扩展方向可能会发生偏转. 通过建立压裂裂缝遇煤岩交界面二维模型, 采用理论分析结合数值 …

An S-stage hybrid (or flexible) flow shop, with sequence-independent uniform set-up times,
parallel batching machines with compatible parallel batch families (like in casting or heat …