Unrelated parallel machine scheduling with job splitting. IIE Transactions 2004;36(4):359-72.R. Logendran and F. Subur, Unrelated parallel machine scheduling with job splitting, IIE Transactions, 36(4), 359-72, 2004.R. Logendran and F. Subur, “Unrelated parallel machine scheduling with ...
Andres-Romano, Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times, The International Journal of Advanced Manufacturing Technology, 57 (2011) 777-794.Scheduling unrelated parallel machines with resource-assignable sequence-dependent setup times. Ruiz, Rubén,Andrés-...
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-...
(1996) Scheduling of unrelated parallel machines when machine availability is specified. Production Planning and Control , 7 (4), 393–400.V. Suresh,Dipak Ghaudhuri.Scheduling of unrelated parallel machines when machine availability is specified[J]. Production Planning & Control .1996(4)...
(2003). Unrelated parallel machine scheduling with setup times and a total weighted tardiness objective. Robotics and Computer Integrated Manufacturing, 19:... DW Kim,DG Na,FF Chen - 《Robotics & Computer Integrated Manufacturing》 被引量: 188发表: 2003年 Scheduling unrelated parallel machines with...
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 ...
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...
This is exactly the unrelated parallel machine scheduling problem described earlier, if we consider the repair workers as the parallel machines, failures as jobs, and travels between plazas as setups. In this case, the setup times depend on the distances between plazas but not on who travels,...
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 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 ...