Focus of attention in an activity-based scheduler

Earlier research in job shop scheduling has demonstrated the advantages of opportunistically combining order-based and resource-based scheduling techniques. An even more flexible approach is investigated where each activity is considered a decision point by itself. Heuristics to opportunistically select the next decision point on which to focus attention (i.e., variable ordering heuristics) and the next decision to be tried at this point (i.e., value ordering heuristics) are described that probabilistically account for both activity precedence and resource requirement interactions. Preliminary experimental results indicate that the variable ordering heuristic greatly increases search efficiency. While least constraining value ordering heuristics have been advocated in the literature, the experimental results suggest that other value ordering heuristics combined with our variable-ordering heuristic can produce much better schedules without significantly increasing search

Resource assignment in short life technology intensive (SLTI) new product development (NPD)

Enterprises managing multiple concurrent New Product Development (NPD) projects face significant challenges assigning staff to projects in order to achieve launch schedules that maximize financial returns. The challenge is increased with the class of Short Life Technology Intensive (SLTI) products characterized by technical complexity, short development cycles and short revenue life cycles. Technical complexity drives the need to assign staffing resources of various technical disciplines and skill levels. SLTI products are rapidly developed and launched into stationary market windows where the revenue life cycle is short and decreasing with any time-to-market delay. The SLTI-NPD project management decision is to assign staff of varying technical discipline and skill level to minimize the revenue loss due to product launch delays across multiple projects. This dissertation considers an NPD organization responsible for multiple concurrent SLTI projects each characterized by a set of tasks having technical discipline requirements, task duration estimates and logical precedence relationships. Each project has a known potential launch date and potential revenue life cycle. The organization has a group of technical professionals characterized by a range of skill levels in a known set of technical disciplines. The SLTI-NPD resource assignment problem is solved using a multi-step process referred to as the Resource Assignment and Multi-Project Scheduling (RAMPS) decision support tool. Robust scheduling techniques are integrated to develop schedules that consider variation in task and project duration estimates. A valuation function provides a time-value linkage between schedules and the product revenue life cycle for each product. Productivity metrics are developed as the basis for prioritizing projects for resources assignment. The RAMPS tool implements assignment and scheduling algorithms in two phases; (i) a constructive approach that employs priority rule heuristics to derive feasible assignments and schedules and (ii) an improvement heuristic that considers productivity gains that can be achieved by interchanging resources of differing skill levels and corresponding work rates. An experimental analysis is conducted using the RAMPS tool and simulated project and resource data sets. Results show significant productivity and efficiency gains that can be achieved through effective project and resource prioritization and by including consideration of skill level in the assignment of technical resources

Markov Decision Processes with Applications in Wireless Sensor Networks: A Survey

Wireless sensor networks (WSNs) consist of autonomous and resource-limited devices. The devices cooperate to monitor one or more physical phenomena within an area of interest. WSNs operate as stochastic systems because of randomness in the monitored environments. For long service time and low maintenance cost, WSNs require adaptive and robust methods to address data exchange, topology formulation, resource and power optimization, sensing coverage and object detection, and security challenges. In these problems, sensor nodes are to make optimized decisions from a set of accessible strategies to achieve design goals. This survey reviews numerous applications of the Markov decision process (MDP) framework, a powerful decision-making tool to develop adaptive algorithms and protocols for WSNs. Furthermore, various solution methods are discussed and compared to serve as a guide for using MDPs in WSNs

Planning Coverage of Points of Interest via Multiple Imaging Surveillance Assets: A Multi-Model Approach

For the United States to maintain information superiority, it is necessary to have a means of allocating intelligence-gathering assets to collect information on particular points of interest. In today\u27s geopolitical environment, however, the number of points of interest is growing rapidly, whereas the number of available assets is not. To aid in maintaining information superiority, this research explores the use of a Multi-Modal Goal Programming Resource Constrained Project Scheduling approach for allocating imaging surveillance assets (land, air, sea, and space) to a set of points of interest for a given time period. The multiple objectives of this formulation are to minimize the number of points of interest not covered at any time during the required period, minimize the deviation from the minimum image resolution of each point of interest, and minimize the time between successive imaging assets imaging each point of interest

Optimizing a multiple objective surgical case scheduling problem.

The scheduling of the operating theater on a daily base is a complicated task and is mainly based on the experience of the human planner. This, however, does not mean that this task can be seen as unimportant since the schedule of individual surgeries influences a medical department as a whole. Based on practical suggestions of the planner and on real-life constraints, we will formulate a multiple objective optimization model in order to facilitate this decision process. We will show that this optimization problem is NP-hard and hence hard to solve. Both exact and heuristic algorithms, based on integer programming and on implicit enumeration (branch-and-bound), will be introduced. These solution approaches will be thoroughly tested on a realistic test set using data of the surgical day-care center at the university hospital Gasthuisberg in Leuven (Belgium). Finally, results will be analyzed and conclusions will be formulated.Algorithms; Belgium; Branch-and-bound; Constraint; Data; Decision; Experience; Healthcare; Heuristic; Integer; Integer programming; Model; Optimization; Order; Processes; Real life; Scheduling; University;

Distributed project scheduling at NASA: Requirements for manual protocols and computer-based support

The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of Space Shuttle mission planning

Protocols for distributive scheduling

The increasing complexity of space operations and the inclusion of interorganizational and international groups in the planning and control of space missions lead to requirements for greater communication, coordination, and cooperation among mission schedulers. These schedulers must jointly allocate scarce shared resources among the various operational and mission oriented activities while adhering to all constraints. This scheduling environment is complicated by such factors as the presence of varying perspectives and conflicting objectives among the schedulers, the need for different schedulers to work in parallel, and limited communication among schedulers. Smooth interaction among schedulers requires the use of protocols that govern such issues as resource sharing, authority to update the schedule, and communication of updates. This paper addresses the development and characteristics of such protocols and their use in a distributed scheduling environment that incorporates computer-aided scheduling tools. An example problem is drawn from the domain of space shuttle mission planning

Modeling and Solving Project Portfolio and Contractor Selection Problem Based on Project Scheduling under Uncertainty

AbstractIn this paper a new formulation of the project portfolio selection problem based on the project schedules in uncertain circumstances have been proposed. The project portfolio selection models usually disregard the project scheduling, whereas is an element of the project selection process. We investigate a project portfolio selection problem based on the schedule of the projects, so that the minimum expected profit would be met in the shortest possible time period. Also due to uncertain nature of durations of the activities, this duration considered as the semi-trapezoidal fuzzy numbers. Finally, a fuzzy linear programming model is developed for the problem, where the results indicated the validity of the presented model

State-based scheduling: An architecture for telescope observation scheduling

The applicability of constraint-based scheduling, a methodology previously developed and validated in the domain of factory scheduling, is extended to problem domains that require attendance to a wider range of state-dependent constraints. The problem of constructing and maintaining a short-term observation schedule for the Hubble Space Telescope (HST), which typifies this type of domain is the focus of interest. The nature of the constraints encountered in the HST domain is examined, system requirements are discussed with respect to utilization of a constraint-based scheduling methodology in such domains, and a general framework for state-based scheduling is presented