A polarized adaptive schedule generation scheme for the resource-constrained project scheduling problem

Abstract

This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is incorporated into a novel genetic algorithm that never degenerates, resulting in an effective self-adaptive procedure. The key point of this genetic algorithm is the embedding of the polarizer parameter as a gene in the genomes used. Through this embedding, the procedure learns via monitoring its own performance and incorporates this knowledge in conducting the search process. The computational experiments indicate that the procedure can produce optimal solutions for a large percentage of benchmark instances. Abstract. This paper presents a hybrid schedule generation scheme for solving the resource-constrained project scheduling problem. The scheme, which is called the Polarized Adaptive Scheduling Scheme (PASS), can operate in a spectrum between two poles, namely the parallel and serial schedule generation schemes. A polarizer parameter in the range between zero and one indicates how similarly the PASS behaves like each of its two poles. The presented hybrid is incorporated into a novel genetic algorithm that never degenerates, resulting in an effective self-adaptive procedure. The key point of this genetic algorithm is the embedding of the polarizer parameter as a gene in the genomes used. Through this embedding, the procedure learns via monitoring its own performance and incorporates this knowledge in conducting the search process. The computational experiments indicate that the procedure can produce optimal solutions for a large percentage of benchmark instances.

A path relinking-based scatter search for the resource-constrained project scheduling problem

“…For J60, Ranjbar (2008) produced a better average deviation than the proposed SS for 50000 schedules, with a better computational time. Debels and Vanhoucke (2007) and Zamani (2012) obtained a worse average deviation compared to the proposed SS for 50000 schedules, but with better computational times. Valls et al (2004) obtained a slightly better average deviation with a slightly faster computation time.…”

“…produced better results than the proposed SS for J120 and 50000 schedules in terms of average deviation and computation time, while Valls (2004),Ranjbar (2008) andZamani (2012) produced competitive results very fast. From this analysis, it can be concluded that none of these heuristics globally perform better than the proposed SS in terms of both computation time and solution quality for all the instance sets.…”

A Consensus‐Reaching Approach to the Evaluation of Product Design Alternatives with Multiple Preference Structures

“…Hsiao et al extracted the appearance characteristics of products based on the morphological analysis method and generated the alternative set of product appearance design through the combination of appearance components for subsequent evaluation [ 31 ]. Zamani et al proposed a hybrid schedule generation scheme to the resource-constrained project scheduling problem, called the Polarized Adaptive Scheduling Scheme, which can operate in the spectrum between two poles, that is, to generate schemes through parallel and serial schedule [ 32 ]. In addition, there were innovative scheme generation methods based on the theory of innovative problem solving (TRIZ) [ 33 ], product design generation methods based on case-based decision theory [ 34 ], etc.…”

An innovative four-layer heuristic for scheduling multi-mode projects under multiple resource constrains

“…Extending the parameterized schedule generation scheme and using an improvement procedure, the algorithm makes use of two separate levels and in several generations enhances a pool of solutions. Parameterized and polarized adaptive schedule generation schemes [55] are hybrids of serial and parallel schedule generation schemes.…”