Buscar
Mostrando ítems 1-10 de 2501
Heuristic methods for the single machine scheduling problem with different ready times and a common due date
(TAYLOR & FRANCIS LTDABINGDON, 2012)
The single machine scheduling problem with a common due date and non-identical ready times for the jobs is examined in this work. Performance is measured by the minimization of the weighted sum of earliness and tardiness ...
Minimizing total tardiness in a stochastic single machine scheduling problem using approximate dynamic programming
(SPRINGER, 2010)
This paper addresses the non-preemptive single machine scheduling problem to minimize total tardiness. We are interested in the online version of this problem, where orders arrive at the system at random times. Jobs have ...
ILS heuristics for the single-machine scheduling problem with sequence-dependent family setup times to minimize total Tardiness
(Journal of Applied Mathematics, 2018)
The single machine earliness and tardiness scheduling problem: lower bounds and a branch-and-bound algorithm
(SOC BRASILEIRA MATEMATICA APLICADA & COMPUTACIONAL, 2010)
This paper addresses the single machine scheduling problem with a common due date aiming to minimize earliness and tardiness penalties. Due to its complexity, most of the previous studies in the literature deal with this ...
Analysis of electric torque in single machine-infinite bus system using phase shifters
(2008-12-01)
ResumoThe main idea of this work is based on the analysis of the electric torque through the acting of the PS in the power system, provided of a control for the compensation degree (PSC). A linear model of the single ...
Analysis of electric torque in single machine-infinite bus system using phase shifters
(2008-12-01)
ResumoThe main idea of this work is based on the analysis of the electric torque through the acting of the PS in the power system, provided of a control for the compensation degree (PSC). A linear model of the single ...
A genetic algorithm for scheduling on a single machine with set-up times and due dates
(Taylor & Francis LtdLondonInglaterra, 2000)
A heuristic for single machine scheduling with early and tardy costs
(Elsevier Science BvAmsterdamHolanda, 2001)