نتایج جستجو برای: batch scheduling
تعداد نتایج: 96946 فیلتر نتایج به سال:
Job scheduling and resource management plays an essential role in high-performance computing. Supercomputing resources are usually managed by a batch system, which is responsible for the effective mapping of jobs onto resources (i.e., compute nodes). From the system perspective, a batch system must ensure high system utilization and throughput, while from the user perspective it must ensure fas...
This paper deals with semi-online scheduling on two parallel batch processing machines with jobs’ nondecreasing processing times. Our objective is to minimize the makespan. A batch processing machine can handle up to B jobs simultaneously. We study unbounded model which means that B is sufficiently large. The jobs that are processed together construct a batch, and all jobs in a batch start and ...
This study addresses the scheduling of supply chain with interrelated factories containing suppliers and manufacturers. These elements of the chain are positioned in series and thus the efficient design of the link among them would insure good performance of the whole. In this paper, jobs transportation among factories and also delivery to the customer can be performed by batch of jobs. The cap...
An overview of developments in the scheduling of multiproduct/multipurpose batch and continuous processes is presented. Existing approaches are classified based on the time representation and important characteristics of chemical processes that pose challenges to the scheduling problem are discussed. In contrast to the discrete-time approaches, various continuous-time models have been proposed ...
This paper presents an integrated approach for scheduling in distributed computing with strategies as sets of job supporting schedules generated by a critical works method. The strategies are implemented using a combination of job-flow and application-level techniques of scheduling within virtual organizations of Grid. Applications are regarded as compound jobs with a complex structure containi...
0167-8191/$ see front matter 2011 Elsevier B.V doi:10.1016/j.parco.2010.12.004 ⇑ Corresponding author. Tel.: +351 22 508 18 88. E-mail addresses: [email protected] (J.G. Barbosa This paper addresses the problem of minimizing the scheduling length (make-span) of a batch of jobs with different arrival times. A job is described by a direct acyclic graph (DAG) of parallel tasks. The paper proposes ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید