Unrelated parallel machineMulti-mode processing timeBatch deliveryJust-in-TimeTotal tardiness and total earlinessIn this study, the unrelated parallel machine scheduling problem where the processing time of jobs is controllable based on resource allocation is considered which the completed jobs are ...
In this paper, an unrelated parallel machine scheduling problem with CPTs and machine- and sequence-dependent setup times has been studied. To solve the problem, a mixed integer programming model has been first formulated to maximize the difference between the sum of realized state of processing of...
In the first phase, a mathematical model of a single machine scheduling problem, of which the objective is a weighted sum of the three objectives, is constructed. Such a model will be repeatedly solved by the CPLEX in the proposed Multi-Objective Simulated Annealing (MOSA) algorithm. In the ...
This paper considers the problem of scheduling jobs on unrelated parallel machines when machine vacations are specified. Two cases are considered, first, when the machine vacations are known apriori, and the second, when these constraints are not known apriori. Algorithms have been developed for ...
Unrelated parallel machinesSequence-dependent setupsTotal completion timeResourcesA novel scheduling problem that results from the addition of resource-assignable setups is presented in this paper. We consider an unrelated parallel machine problem with machine and job sequence-dependent setup times. The ...
In this paper we consider unrelated parallel machine scheduling problems that involve the minimization of regular total cost functions. We first present some properties of optimal solutions and then provide a lower bound. These mechanisms are tested on the well-known practical problem of minimizing ...
schedulingunrelated parallel machinesetup timedeteriorating jobIn this paper, we consider an unrelated parallel machine scheduling problem with setup time and deteriorating jobs simultaneously.The setup time is proportional to the length of the already processed jobs, that is , the setup time is past-...
The Unrelated Parallel Machine scheduling problem with Setups (UPMS) takes the following input data: 1) A set of jobs N={1,…,n}, indexed by j, k, ℓ. For modeling purposes it will be useful to enlarge the set N so that it includes a dummy job denoted by 0. This new set is...
This work addresses the Unrelated Parallel Machine Scheduling Problem where setup times are sequence-dependent and machine-dependent, the UPMSPST. The maximum completion time of the schedule, known as makespan, is considered as the objective to minimize. The UPMSPST is often found in industries and...
This work aims to deal with the distributed heterogeneous unrelated parallel machine scheduling problem (DHUPMSP) with minimizing total tardiness (TDD) and makespan. To solve this complex combinatorial optimization problem, this work proposed a knowledge and Pareto-based memetic algorithm (KPMA) which...