Disruption-Driven Resource Rescheduling in Software Development Processes

Xiao, Junchao; Osterweil, Leon J.; Wang, Qing; Li, Mingshu

doi:10.1007/978-3-642-14347-2_21

Cited by 5 publications

(6 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The work addressed in this paper uses the incremental resource scheduling method described in [29]. The approach combines the strengths of the robust incremental scheduling approach and the GA technology, with the exploitation of more complete and precise information about uncertainty that we derive from the analysis of particularly detailed and precise definitions of both the system being executed and the resources available for allocation.…”

Section: Incremental Resource Scheduling Methodsmentioning

confidence: 99%

“…The architecture of the incremental time-window rescheduling system that we have built is shown in Figure 1, which shows the following major components (as described in [29]): rescheduling should be done. Rescheduling is triggered when the rescheduling indicator determines that execution is about to proceed past the window over which the last rescheduling had been computed.…”

Section: Incremental Resource Scheduling Methodsmentioning

confidence: 99%

“…greater speed), and should be considered in subsequent work. The GA approach described in [29] was our scheduling algorithm.…”

Section: Resource Rescheduling By Using a Gamentioning

confidence: 99%

“…We used the binary representation of integers to help encode the rescheduling problem as a chromosome as described in [29]. Note that because the DFG nodes to be scheduled changes during process execution, new chromosomes must be built for each rescheduling.…”

Section: Encoding and Decodingmentioning

confidence: 99%

See 3 more Smart Citations

Dynamic scheduling of emergency department resources

Xiao

Osterweil

Wang

2010

Proceedings of the 1st ACM International Health Informatics Symposium

Self Cite

View full text Add to dashboard Cite

The processes carried out in a hospital emergency department can be thought of as structures of activities that require resources in order to execute. Costs are reduced when resource levels are kept low, but this can lead to competition for resources and poor system performance. Careful allocation can improve performance by enabling more efficient use of resources. This paper proposes that resource scheduling be done in a series of dynamic reschedulings that use precise, detailed information about emergency department processes and available department resources to improve the quality of scheduling results. Rescheduling is done over a small set of activities, and uses a genetic algorithm. Simulations are used to evaluate this approach, and results indicate that it can be effective.

show abstract

Section: Incremental Resource Scheduling Methodsmentioning

confidence: 99%

Section: Incremental Resource Scheduling Methodsmentioning

confidence: 99%

“…greater speed), and should be considered in subsequent work. The GA approach described in [29] was our scheduling algorithm.…”

Section: Resource Rescheduling By Using a Gamentioning

confidence: 99%

Section: Encoding and Decodingmentioning

confidence: 99%

See 2 more Smart Citations

Dynamic scheduling of emergency department resources

Xiao

Osterweil

Wang

2010

Proceedings of the 1st ACM International Health Informatics Symposium

Self Cite

View full text Add to dashboard Cite

show abstract

“…In this case, a specific tool imports entry information and exports results in a XML based file format. In addition, we found examples of integration with other approaches with the aim to study the solution effectiveness, such as in the work of Xiao and others [50].…”

Section: B Developmentmentioning

confidence: 95%

The Issues of Solving Staffing and Scheduling Problems in Software Development Projects

Peixoto

Mateus

Resende

2014

2014 IEEE 38th Annual Computer Software and Applications Conference

View full text Add to dashboard Cite

Search-Based Software Engineering (SBSE) applies search-based optimization techniques in order to solve complex Software Engineering problems. In the recent years there has been a dramatic increase in the number of SBSE applications in areas such as Software Test, Requirements Engineering, and Project Planning. Our focus is on the analysis of the literature in Project Planning, specifically the researches conducted in software project scheduling and resource allocation. SBSE project scheduling and resource allocation solutions basically use optimization algorithms. Considering the results of a previous Systematic Literature Review, in this work, we analyze the issues of adopting these optimization algorithms in what is considered typical settings found in software development organizations. We found few evidence signaling that the expectations of software development organizations are being attended.

show abstract

Search-Based Software Project Management

Ferrucci

Harman

Sarro

2014

Software Project Management in a Changing World

View full text Add to dashboard Cite

Abstract. Project management presents the manager with a complex set of related optimisation problems. Decisions made can more profoundly affect the outcome of a project than any other activity. In the chapter, we provide an overview of Search-Based Software Project Management, in which Search-Based Software Engineering (SBSE) is applied to problems in software project management. We show how SBSE has been used to attack the problems of staffing, scheduling, risk, and effort estimation. SBSE can help to solve the optimisation problems the manager faces, but it can also yield insight. SBSE therefore provides both decision making and decision support. We provide a comprehensive survey of Search-Based Software Project Management, and give directions for the development of this subfield of SBSE. IntroductionSoftware Project Management includes several activities critical for the success of a project (e.g., cost estimation, project planning, quality management). These activities often involve finding a suitable balance between competing and potentially conflicting goals. For example, planning a project schedule requires to minimise the project duration and the project cost, and to maximise the product quality. Many of these problems are essentially optimization questions characterised by competing goals/constraints and with a bewilderingly large set of possible choices. So finding good solutions can be hard.Search-Based Software Engineering seeks to reformulate software engineering problems as search-based optimisation problems and applies a variety of metaheuristics based on local and global search to solve them (such as Hill Climbing, Tabu Search, and Genetic Algorithms). These meta-heuristics search for a suitable solution in a typically large input space guided by a fitness function that expresses the goals and leads the exploration into potentially promising areas of the search space.Though the term Search-Based Software Engineering (SBSE) was coined by Harman and Jones in 2001 to cover the application of computational search and optimisation across the wide spectrum of software engineering activities (Harman and Jones 2001), there were already pockets of activity on several specific software engineering problems prior to the introduction of the term SBSE. One such topic was Search-Based Software Project Management, the topic of this chapter. In particular, there was work on search-based project scheduling and staffing by

show abstract

Disruption-Driven Resource Rescheduling in Software Development Processes

Cited by 5 publications

References 19 publications

Dynamic scheduling of emergency department resources

Dynamic scheduling of emergency department resources

The Issues of Solving Staffing and Scheduling Problems in Software Development Projects

Search-Based Software Project Management

Contact Info

Product

Resources

About