Abstract This paper addresses the unrelated parallel machine scheduling problem with sequence and dependent setup times eligibility constraints. The objective is to minimize maximum completion time (makespan). Instances of more than 500 jobs 50 machines are not uncommon in industry. Such large instances become increasingly challenging provide high-quality solutions within limited amount computa...

In the classical problem of scheduling on unrelated parallel machines, a set of jobs has to be assigned to a set of machines. The jobs have a processing time depending on the machine and the goal is to minimize the makespan, that is the maximum machine load. It is well known that this problem is NP-hard and does not allow polynomial time approximation algorithms with approximation guarantees sm...

We study the problem of scheduling a set of J jobs on M machines with stochastic job processing times when no preemptions are allowed and the weighted sum of expected completion time objective. Our model allows for “unrelated” machines: the distributions of processing times may vary across both jobs and machines. We study static routing policies, which assign (or “route”) each job to a particul...

We study the problem of online job-scheduling on parallel machines with di erent network topologies. An online scheduling algorithm schedules a collection of parallel jobs with known resource requirements but unknown running times on a parallel machine. We give an O(plog logN)-competitive algorithm for online scheduling on a two-dimensional mesh of N processors and we prove a matching lower bou...

<p style='text-indent:20px;'>In today's competitive world, scheduling problems are one of the most important and vital issues. In this study, a bi-objective unrelated parallel machine problem with worker allocation, sequence dependent setup times, precedence constraints, eligibility is presented. The objective functions to minimize costs tardiness hiring workers. order formulate proposed ...

Each of n jobs is to be processed without interruption on one of m unrelated parallel machines. The objective is to minimize the maximum completion time. A heuristic method is presented, the first stage of which uses linear programming to form a partial schedule leaving at most m 1 jobs unscheduled: the second stage schedules these m1 jobs using an enumerative method. For m 2 3, it is shown tha...

This paper addresses a scheduling problem with unrelated parallel machines, sequence dependent setups and due dates. The problem is based on a real case and the objective is to minimise the sum of the makespan and the weighted delays. A mixed integer linear programming model is proposed and since the model considers realistic constraints, a metaheuristic based on GRASP is used as a solution met...

Setup operations on machines usually need of tooling and/or personnel to be carried out. Therefore, the length of the setup might not only depend on the machine and job sequence, but also on the number of resources assigned. This situation is common in real problems arising in several industries where setup operations in production lines are frequent. These operations are indeed setups whose le...