This paper investigates a flexible flow shop scheduling problem wherein there are some unrelated parallel machines with different technology levels in the first stage. Some of these machines are multifunctional that can do several processes on jobs. Therefore, the jobs assigned to these machines do ...
The classical flexible flow shop scheduling problem (FFSP) only considers machine flexibility. Thus far, the relevant literature has not studied FFSPs with worker flexibility, which is widely seen in practical manufacturing systems. Worker flexibility may greatly affect production efficiency and ...
这个领域最困难的问题之一是作业车间调度问题(Job-shop Scheduling Problem, JSP),该问题中,一组机器需处理一组工件,每个工件由一系列具有先后顺序约束的工序形成,每个工序只需要一台机器,机器一直可用,可以一次处理一个操作而不会中断。决策内容包括如何对机器上的工序进行排序,已优化给定的性能指标。JSP的典型性能指标...
In this study, a new mathematical model is presented to solve the flexible flow shop problem where transportation is reliable and there are constraints on intermediate buffers, budgets, and human res...
Although various approaches have been developed for scheduling under uncertainty, this problem is still difficult to tackle by any single approach, because of its inherent difficulties. This paper considers makespan minimisation of a flexible flow shop (FFS) scheduling problem with stochastic processing ...
This paper studies the flexible double shop scheduling problem (FDSSP) that considers simultaneously job shop and assembly shop. It brings about the problem of scheduling association of the related tasks. To this end, a reinforcement learning algorithm w
In this paper, group scheduling problem in no-wait flexible flowshop is considered by considering two stages with group sequence-dependent setup times and random breakdown of the machines. Genetic algorithm and simulated annealing based heuristics have been proposed to solve the problem. The primary ...
If at least one machine center includes more than one machine, the scheduling problem becomes a flexible flow-shop problem. Flexible flow shops are thus generalization of simple flow shops. In this paper, we propose three algorithms to solve flexible flow-shop problems of more than two machine ...
This work focuses on two different autonomous control methods applied to flexible flow shop problems with both of the extensions mentioned above. In order to evaluate these methods, various common scheduling heuristics and one genetic algorithm are taken as references. Problem instances are defined and...
This work deals with a scheduling problem of a real-world production process in the metal–working industry. The production process can be described as an offline stochastic flexible flow-shop problem with limited buffers. In a first step, we analyze a simplified model and develop a variable nei...