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...

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 ...

We present a bi-objective parallel machine scheduling problem with and job sequence dependent setup times, the additional consideration of resources needed during setups. The availability such is limited. This models many practical situations where times imply, for example, cleaning and/or reconfiguration productive equipment. These setups are performed by personnel, who course limited in numbe...

We consider an extension of classic parallel machine scheduling where a set of jobs is scheduled on identical parallel machines and an undirected conflict graph is part of the input. Each node in the graph represents a job and an edge implies that its two jobs are conflicting, meaning that they cannot be scheduled on the same machine. The goal is to find an assignment of the jobs to the machine...

Given a parallel program to be executed on a heterogeneous computing system, the overall execution time of the program is determined by a schedule. In this paper, we analyze the worst-case performance of the list scheduling algorithm for scheduling tasks of a parallel program in a mixed-machine heterogeneous computing system such that the total execution time of the program is minimized. We pro...