News
Until recently, the majority of models used to find an optimal sequence for the standard flow-shop problem were based on a single objective, typically makespan. In many applications, the practitioner ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results