News
A variable neighbourhood search for hybrid flow-shop scheduling problem with rework and set-up times
This paper deals with hybrid flow-shop scheduling problem with rework. In this problem, jobs are inspected at the last stage, and poorly processed jobs were returned and processed again. Thus, a job ...
This paper considers the no-wait scheduling of n jobs in a two-machine flow shop, where some jobs require processing on the first machine only. The objective is to minimize the maximum completion time ...
A recent study published in Engineering presents a significant advancement in manufacturing scheduling. Researchers Xueyan Sun, Weiming Shen, Jiaxin Fan, and their colleagues from Huazhong University ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results