Scheduling problems are found in a lot of application domains. Well known is the scheduling of production where manufacturing operations have to be assigned to limited resources like machines, but also other applications are important, e.g., the scheduling of airline crews, space missions, projects in different domains, clinical surgery, even timetabling and processor scheduling include schedul...

This paper promotes the automated creation of hybrid personal plans, comprising web services and real human activities, to be supported by the next generation of intelligent calendar applications. A prototype work is present-ed, utilizing both atomic web services and composite ones, the latter having been previously generated from a contingent web service composition module, aiming at in-creasi...

We consider an uncertain single-machine scheduling problem, in which the processing time of a job can take any real value on a given closed interval. The criterion is to minimize the total weighted flow time of the n jobs, where there is a weight associated with a job. We calculate a number of minimal dominant sets of the job permutations (a minimal dominant set contains at least one optimal pe...

Trip generation is the most time-consuming phase of the crew scheduling process. A large number of trips must be constructed while satisfying a complex set of regulations. In this paper, we present an efficient trip generation method that utilizes effectively a legality checking system in order to reduce the corresponding search space. Special pruning rules are defined using a high-level rule l...

Singapore Mass Rapid Transit (SMRT) operates two train lines with 83 kilometers of track and 48 stations. A total of 77 trains are in operation during peak hours and 41 during off-peak hours. In this article we report on an optimization based approach to develop a computerized train-operator scheduling system that has been implemented at SMRT. The approach involves a bipartite matching algorith...

Age of information (AoI) is a recently proposed metric for measuring information freshness. AoI measures the time that elapsed since the last received update was generated. We consider the problem of minimizing average and peak AoI in wireless networks under general interference constraints. When fresh information is always available for transmission, we show that a stationary scheduling policy...

Scheduling applications tasks across heterogeneous clusters is a growing problem, particularly when new upgraded components are added to a parallel computing system that may have originally been homogeneous. We describe how automatic and just-in-time source code generation techniques can be used to make the best parallel decomposition for whatever resource is available in a heterogeneous system...

We consider a job shop scheduling problem under uncertain processing times and fixed precedence and capacity constraints. Each of the random processing times can take any real value between given lower and upper bounds. The goal is to find a set of schedules which contains at least one optimal schedule (with mean flow time criterion) for any admissible realization of the random processing times...

This paper describes a constraint programming approach to solving a scheduling problem with earliness and tardiness cost using a problem specific search procedure. The presented algorithm is tested on a set of randomly generated instances of the job shop scheduling problem with earliness and tardiness costs. The experiments are executed also for three other algorithms, and the results are then ...

Airline scheduling is composed of fleet assignment, aircraft maintenance routing, and crew scheduling optimization subproblems. It is believed that the full optimization problem is computationally intractable, and hence the constituent subproblems are optimized sequentially so that the output of one is the input of the next. The sequential approach, however, provides an overall suboptimal solut...