Buscar
Mostrando ítems 1-10 de 1803
Scheduling Grid Applications with Software Requirements
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2011)
The aim of task scheduling is to minimize the makespan of applications, exploiting the best possible way to use shared resources. Applications have requirements which call for customized environments for their execution. ...
A priori reformulations for joint rolling-horizon scheduling of materials processing and lot-sizing problem
(2013-06-10)
In many production processes, a key material is prepared and then transformed into different final products. The lot sizing decisions concern not only the production of final products, but also that of material preparation ...
Optimal algorithms for the batch scheduling problem in OBS networks
(Elsevier Science BvAmsterdamHolanda, 2012)
Lot sizing and furnace scheduling in small foundries
(2008-03-01)
A lot sizing and scheduling problem prevalent in small market-driven foundries is studied. There are two related decision levels: (1) the furnace scheduling of metal alloy production, and (2) moulding machine planning which ...
Robust Hybrid Mechanisms for Scheduling of Grid Tasks
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INCPISCATAWAY, 2012)
This paper proposes three new hybrid mechanisms for the scheduling of grid tasks, which integrate reactive and proactive approaches. They differ by the scheduler used to define the initial schedule of an application and ...
Mathematical model and solution approaches for integrated lot-sizing, scheduling and cutting stock problems
(Springer, 2020-09-04)
In this paper, we address a two-stage integrated lot-sizing, scheduling and cutting stock problem with sequence-dependent setup times and setup costs. In production stage one, a cutting machine is used to cut large objects ...
MULTIPLE ANT COLONY SYSTEM FOR A VRP WITH TIME WINDOWS AND SCHEDULED LOADING
(Universidad de Tarapacá., 2009)
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 ...
MEASUREMENT OF COLOUR DEVELOPMENT IN PINUS RADIATA SAPWOOD BOARDS DURING DRYING AT VARIOUS SCHEDULE
(Universidad del Bío-Bío, 2005)
A novel approach for distributed application scheduling based on prediction of communication events
(ELSEVIER SCIENCE BV, 2010)
The evolution of commodity computing lead to the possibility of efficient usage of interconnected machines to solve computationally-intensive tasks, which were previously solvable only by using expensive supercomputers. ...