We present provably efficient parallel algorithms for sweep scheduling, which is a commonly used technique in Radiation Transport problems, and involves inverting an operator by iteratively sweeping across a mesh from multiple directions. Each sweep involves solving the operator locally at each cell. However, each direction induces a partial order in which this computation can proceed. On a dis...

This work addresses the short-term scheduling of one of the most critical stages in the semiconductor industry, the automated wet-etch station (AWS). An efficient MILPbased computer-aided tool is developed in order to achieve a proper synchronization between the activities of sequential chemical and water baths and limited automated wafer’s lot transfer devices. The major goal is to find the op...

critical path method (cpm) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. despite its popularity, cpm has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. the analytical competency and computing capability of cpm thus...

This paper presents a decision support tool for airlines schedule recovery during irregular operations. The tool provides airlines control centers with the capability to develop a proactive schedule recovery plan that integrates all flight resources. A rolling horizon modeling framework, which integrates a schedule simulation model and a resource assignment optimization model, is adopted for th...

This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...

A cogent method is presented for computing the expected cost of an appointment schedule where customers are statistically identical, the service time distribution has known mean and variance, and customer no-shows occur with time-dependent probability. The approach is computationally efficient and can be easily implemented to evaluate candidate schedules within a schedule optimization algorithm.

In construction management the definition of a robust schedule is often more important than finding a time and cost efficient schedule. In nearly every construction project the planned schedule must be continually adapted due to disruptions. Therefore, it is imperative that a robust schedule should be generated regarding the different project objectives. In the context of planning and schedulin...

Dynamic domains are domains quickly created, used and discarded. Today, there are no facilities available to support dynamic domains in most network management systems. This paper introduces two new language to deal with dynamic domains. The first language is used to define new domains through the selection of managed objects. The second language, on its turn, is used to visualize already creat...

A cake is a metaphor for a heterogeneous, divisible good, such as land. A perfect division of cake is efficient (also called Pareto-optimal), envyfree, and equitable. We give an example of a cake in which it is impossible to divide it among three players such that these three properties are satisfied, however many cuts are made. It turns out that two of the three properties can be satisfied by ...

Fair Division, unlike most research on fairness in the social sciences and mathematics, is devoted solely to the analysis of constructive procedures for actually dividing things up and resolving disputes, including...