نتایج جستجو برای: unrelated parallel machine scheduling
تعداد نتایج: 566782 فیلتر نتایج به سال:
This paper breaks new ground by modelling lot sizing and scheduling in a flexible flow line (FFL) simultaneously instead of separately. This problem, called the ‘General Lot sizing and Scheduling Problem in a Flexible Flow Line’ (GLSP-FFL), optimizes the lot sizing and scheduling of multiple products at multiple stages, each stage having multiple machines in parallel. The objective is to satisf...
In network scheduling a set of jobs must be scheduled on unrelated parallel processors or machines which are connected by a network. Initially, each job is located on some machine in the network and cannot be started on another machine until suucient time elapses to allow the job to be transmitted there. This setting has applications, e. g., in distributed multi-processor computing environments...
We consider the problem of how to run a workload of multiple parallel jobs on a single parallel machine. Jobs are assumed to be data-parallel with large degrees of parallelism, and the machine is assumed to have an MIMD architecture. We identify a spectrum of scheduling policies between the two extremes of time-slicing, in which jobs take turns to use the whole machine, and space-slicing, in wh...
this paper gives a new application of dea to evaluate the scheduling solutions of parallel processing. it evaluates the scheduling solutions of parallel processing using the non-convex dea model, fdh model. by introducing each solution of parallel processing scheduling as a dmu with some relevant inputs and outputs this paper shows that how the most efficient schedule(s) can be identified.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید