Scatter search for project scheduling with resource availability cost

Yamashita, Denise Sato; Armentano, Vinı́cius Amaral; Laguna, Manuel

doi:10.1016/j.ejor.2004.08.019

Cited by 79 publications

(38 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Yamashita et al [26] proposed a scatter search procedure together with multi-start heuristics to deal with larger problems of up to 120 jobs. Also, Neumann and Zimmermann [18] suggested a heuristic algorithm for a resource leveling problem that considers RIP as a special case.…”

Section: Literature Surveymentioning

confidence: 99%

Improvements of constraint programming and hybrid methods for scheduling of tests on vehicle prototypes

Limtanyakul

Schwiegelshohn

2012

Constraints

View full text Add to dashboard Cite

In the automotive industry, a manufacturer must perform several hundreds of tests on prototypes of a vehicle before starting its mass production. Tests must be allocated to suitable prototypes and ordered to satisfy temporal constraints and various kinds of test dependencies. The manufacturer aims to minimize the number of prototypes required. We present improvements of constraint programming (CP) and hybrid approaches to effectively solve random instances from an existing benchmark. CP mostly achieves better solutions than the previous heuristic technique and genetic algorithm. We also provide customized search schemes to enhance the performance of general search algorithms. The hybrid approach applies mixed integer linear programming (MILP) to solve the planning part and CP to find the complete schedule. We consider several logical principles such that the MILP model can accurately estimate the prototype demand, while its size particularly for large instances does not exceed memory capacity. Moreover, the robustness is alleviated when we allow CP to partially change the allocation obtained from the MILP model. The hybrid method can contribute to optimal solutions in some instances.

show abstract

Section: Literature Surveymentioning

confidence: 99%

Improvements of constraint programming and hybrid methods for scheduling of tests on vehicle prototypes

Limtanyakul

Schwiegelshohn

2012

Constraints

View full text Add to dashboard Cite

show abstract

“…Limitantes inferiores e superiores para o PCDR foram propostos por Drexl & Kimms (2001), obtidos através de relaxação Lagrangiana e métodos de geração de colunas. Recentemente, um método heurístico foi proposto para o PCDR por Yamashita et al (2006).…”

Section: Introductionunclassified

Um algoritmo exato para o problema de programação de projetos com custo de disponibilidade de recursos e múltiplos modos

Yamashita

Morábito

2007

Pesqui. Oper.

Self Cite

View full text Add to dashboard Cite

ResumoO objetivo deste artigo é propor um algoritmo exato para gerar curvas de tradeoff entre o custo e o prazo de um projeto, baseado no problema de custo de disponibilidade de recursos com múltiplos modos de execução. Duas versões do algoritmo são propostas, a primeira é uma adaptação de um algoritmo exato da literatura, no qual só existe um modo de executar as atividades, e a segunda versão incorpora estratégias para melhorar o desempenho do método, resultando numa redução significativa de tempo computacional. Convém salientar que o algoritmo proposto é viável computacionalmente apenas para resolver problemas de tamanho moderado. As duas versões do algoritmo foram testadas resolvendo-se diversos exemplos gerados pelo programa Progen da literatura. Curvas de tradeoff são apresentadas e analisadas, ilustrando como o método pode ser usado em situações onde o decisor é confrontado com a difícil tarefa de balancear custos e datas de entrega do projeto.Palavras-chave: programação de projetos; múltiplos modos de execução; custo de disponibilidade de recursos; algoritmo exato; tradeoff entre custos e data de entrega. AbstractIn this paper we propose an exact algorithm to generate tradeoff curves between cost and time of a project, based on the multi-mode resource availability cost problem. Two versions of the algorithm are proposed, the first is an adaptation of an exact algorithm proposed in the literature, where there is only a single mode to execute the activities, and the second incorporates strategies in order to improve the performance of the solution method, resulting in a significant decrease in the computational time. It is worth noting that the proposed algorithm is computationally viable to solve only problems of moderate size. Both versions of the algorithm were tested solving different instances generated by the software Progen. Tradeoff curves are presented and analyzed, illustrating how the method can be used in situations where the decision maker is confronted with the difficult task of balancing costs and deadlines of a project.

show abstract

“…Some of these scheduling objectives take the cost of resources into account. The so-called resource availability cost project (RACP) aims at minimising the total cost of the resource availability within a predefined project deadline, and references can be found in Demeulemeester [15], Drexl and Kimms [16], Hsu and Kim [17], Shadrokh and Kianfar [18], Yamashita et al [19], Drexl and Kimms [16], Gather et al [20], and Shahsavar et al [21]. The resource leveling project (RLP) aims at the construction of a precedence and resource feasible schedule within a predefined deadline with a resource use that is as level as possible within the project horizon.…”

Section: Baseline Schedulingmentioning

confidence: 99%

An Overview of Recent Research Results and Future Research Avenues Using Simulation Studies in Project Management

Vanhoucke

2013

ISRN Computational Mathematics

View full text Add to dashboard Cite

This paper gives an overview of three simulation studies in dynamic project scheduling integrating baseline scheduling with risk analysis and project control. This integration is known in the literature as dynamic scheduling. An integrated project control method is presented using a project control simulation approach that combines the three topics into a single decision support system. The method makes use of Monte Carlo simulations and connects schedule risk analysis (SRA) with earned value management (EVM). A corrective action mechanism is added to the simulation model to measure the efficiency of two alternative project control methods. At the end of the paper, a summary of recent and state-of-the-art results is given, and directions for future research based on a new research study are presented.

show abstract

Scatter search for project scheduling with resource availability cost

Cited by 79 publications

References 19 publications

Improvements of constraint programming and hybrid methods for scheduling of tests on vehicle prototypes

Improvements of constraint programming and hybrid methods for scheduling of tests on vehicle prototypes

Um algoritmo exato para o problema de programação de projetos com custo de disponibilidade de recursos e múltiplos modos

An Overview of Recent Research Results and Future Research Avenues Using Simulation Studies in Project Management

Contact Info

Product

Resources

About