This research deals with a hybrid flow shop scheduling problem with parallel batching, machine eligibility, unrelated parallel machine, and different release dates to minimize the sum of the total weighted earliness and tardiness (ET) penalties. In parallel batching situation, it is supposed that number of machine in some stages are able to perform a certain number of jobs simultaneously. First...

Abstract In this paper, we study an important real-life scheduling problem that can be formulated as unrelated parallel machine with sequence-dependent setup times, due dates, and eligibility constraints. The objective is to minimise total tardiness makespan. We adapt extend a mathematical model find optimal solutions for small instances. Additionally, propose several variants of simulated anne...

This study deals with an unrelated parallel machine scheduling problem additional resources (UPMR). That is one of the important sub-problems in scheduling. UPMR consists a set jobs on machines. In addition to that, number or more are needed. very and its importance comes from wealth applications; they applicable engineering scientific situations manufacturing systems such as industrial robots,...

The unrelated parallel machine scheduling problem aims to assign jobs independent machines with sequence-dependent setup times so that the makespan is minimized. When many practical considerations are introduced, solving resulting challenging, especially when problems of realistic sizes interest. In this study, in addition conventional objective minimizing makespan, we further consider burn-in ...

In this paper, a scheduling problem on non-identical parallel machines with auxiliary resources and sequence-dependent machine-dependent setup times is studied. This can be found in various manufacturing contexts, particular workshops of wafer facilities. Three different criteria are defined analyzed: The number products completed before the end given time horizon, weighted sum completion resou...

The parallel machine scheduling problem has been a popular topic for many years due to its theoretical and practical importance. This paper addresses the robust makespan optimization on unrelated with sequence-dependent setup times, where processing times are uncertain, only knowledge is time intervals they take values from. We propose model min-max regret criterion formulate this problem. To s...