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

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

This paper addresses a complex parallel machine scheduling problem with jobs divided into operations and grouped in families. Non-anticipatory family setup times are held at the beginning of each batch, defined by combination one setup-time sequence from unique family. Other aspects also considered problem, such as release dates for machines, operation’s sizes, machine’s eligibility capacity. W...