Results 101 to 110 of about 62,265 (211)

Railway scheduling reduces the expected project makespan. [PDF]

The Critical Chain Scheduling and Buffer Management (CC/BM) methodology, proposed by Goldratt (1997), introduced the concepts of feeding buffers, project buffers and resource buffers as well as the roadrunner mentality.
Demeulemeester, Erik, Tian, Wendi
core  

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags [PDF]

The standard one-machine scheduling problem consists in scheduling a set of jobs in one machine which can handle only one job at a time, minimizing the maximum lateness.
Helena Ramalhinho-Lourenço
core  

Project scheduling under undertainty – survey and research potentials. [PDF]

The vast majority of the research efforts in project scheduling assume complete information about the scheduling problem to be solved and a static deterministic environment within which the pre-computed baseline schedule will be executed. However, in the
Herroelen, Willy, Leus, Roel
core  

Local search performance guarantees for restricted related parallel machine scheduling

We consider the problem of minimizing the makespan on restricted related parallel machines. In restricted machine scheduling each job is only allowed to be scheduled on a subset of machines. We study the worst-case behavior of local search algorithms. In
Recalde Diego, Rutten Cyriel, Vredeveld Tjark, Schuurman Petra   +3 more
core  

Resource-constrained project scheduling. [PDF]

: Resource-constrained project scheduling involves the scheduling of project activities subject to precedence and resource constraints in order to meet the objective(s) in the best possible way. The area covers a wide variety of problem types.
Herroelen, Willy, Demeulemeester, Erik
core  

EPRSA: interference resource scheduling algorithms for air-ground communication networks. [PDF]

Sci Rep
Wu W, Wei Z, You H, Li X, Zhan J, Zhang Z.   +5 more
europepmc   +1 more source

Study and evaluation of CPU scheduling algorithms. [PDF]

Heliyon
González-Rodríguez M, Otero-Cerdeira L, González-Rufino E, Rodríguez-Martínez FJ.   +3 more
europepmc   +1 more source

When greediness fails: Examples from stochastic scheduling

The purpose of this paper is to present examples which show that deterministic and stochastic scheduling problems often have a surprisingly different behavior.
Uetz,Marc
core  

Approximation Results for Preemptive Stochastic Online Scheduling

We present first constant performance guarantees for preemptive stochastic scheduling to minimize the sum of weighted completion times. For scheduling jobs with release dates on identical parallel machines we derive policies with a guaranteed performance
Megow, Nicole, Vredeveld, Tjark
core  

Comparison of Methods of Pump Scheduling in Water Supply Systems

, 2001
In the domestic water supply industry, the reduction of pumping costs is a continuing objective. With the efficient scheduling of pumping operations, it is considered that 10% of the annual expenditure on energy and related costs may be saved.
Darbyshire, K, Waterworth, G
core