[9] studied an identical parallel-machine scheduling problem with a rate-modifying activity. They assumed that each machine may have at most one rate-modifying activity. They showed that the time complexity of the total completion time minimization problem is O(n2m+3). Hsu et al. [2] ...
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 ...
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-...
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 ...
This paper addresses the unrelated parallel machine scheduling problem with setup times, with an objective of minimizing the makespan. The machines are unrelated in the sense that the processing speed depends on the job being executed and not the machine. Each job will have different processing time...
This paper considers the problem of scheduling a set of jobs on unrelated parallel machines subject to several constraints which are non-zero arbitrary release dates, limited additional resources, and non-anticipatory sequence-dependent setup times. The objective function is to minimize the maximum comp...
Scheduling has an immense effect on various areas of human lives, be it though its application in manufacturing and production industry, transportation, wo