SchedulingUnrelated parallel machinesSequence-dependent setup timesAuxiliary resourcesComplexityInteger linear programmingIn this paper, a scheduling problem on non-identical parallel machines with auxiliary resources and sequence-dependent and machine-dependent setup times is studied. This problem can be found ...
Each machine cannot process more than one job at the same time. Furthermore, preemption of jobs is not allowed and when a job begins its processing, it cannot be stopped until its completion. The previous problem is known as parallel machine scheduling and is divided into three different ...
unrelated 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-sequence-...
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 ...
Scheduling Aging effect Maintenance activity Assignment problem a b s t r a c t This paper explores the problems of unrelated parallel-machine scheduling with aging effects and deteriorating maintenance activities. The jobs are non-resumable. Each machine has at most one maintenance activity which is...
We consider unrelated parallel machine scheduling problems with the objective to minimize the schedule makespan. In addition to its machine-dependence, the processing time of any job is also dependent on the usage of a scarce renewable resource. An amount of $k$ units of that resource, e.g. ...
(1996) `Scheduling of unrelated parallel machines when machine availability is specified', Production Planning and Control, Vol. 7, No. 4, pp.393-400.Scheduling of unrelated parallel machines when machine availability is specified[J] . V. Suresh,Dipak Ghaudhuri.Production Planning & Control . ...
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 ...
This paper addresses the problem of scheduling jobs on unrelated parallel machines with eligibility constraints, where job-processing times are controllable through the allocation of a nonrenewable common resource, and can be modeled by a linear resource consumption function. The objective is to assign...
In the present work, we focused our attention on the unrelated parallel machine scheduling problem (UPM). The aim of this work is to show how to solve scheduling problems with additional constraints on current quantum annealers as an illustration of the potential of QA to solve large ...