In this paper, a new hybrid algorithm based on multi-objective genetic algorithm (MOGA)
using simulated annealing (SA) is proposed for scheduling unrelated parallel machines with …

Traditional scheduling problems with the batch processing machines (BPM) assume that
machines are continuously available, and no time is needed for their preventive …

In this article, equipment overhaul is considered in a multi-stage flow shop scheduling
problem. In this problem, the equipments are disassembled in the first stage, overhaul and …

Modern Manufacturing, known as Industrial Internet or Industry 4.0, is more than ever
determined by customer-specific products, that are to be manufactured and delivered in …

In this paper, we address the weighted multi-objective re-entrant flow-shop scheduling
problem considering release dates in order to minimize makespan, total completion time …

The purpose of this paper is to consider the problem of scheduling a set of start time-
dependent jobs in a two-machine flow shop, in which the actual processing times of jobs …

The classic flow shop problem assumes that jobs make only single passes through the
processing machines and that the processing times are not affected by the length of the …

In this paper, we study the re-entrant no-wait flexible flowshop scheduling problem with
makespan minimization objective and then consider two parallel machines for each stage …