Mathematical Problems in Engineering

Mathematical Problems in Engineering / 2019 / Article

Research Article | Open Access

Volume 2019 |Article ID 9459375 | 16 pages | https://doi.org/10.1155/2019/9459375

A Memetic Algorithm for Multiskill Resource-Constrained Project Scheduling Problem under Linear Deterioration

Academic Editor: Giovanni Berselli
Received07 May 2019
Accepted20 Jun 2019
Published04 Jul 2019

Abstract

This paper proposes a general variable neighborhood search-based memetic algorithm (GVNS-MA) for solving the multiskill resource-constrained project scheduling problem under linear deterioration. Integrating a solution recombination operator and a local optimization procedure, the proposed GVNS-MA is assessed on two sets of instances and achieves highly competitive results. One set of benchmark instances is commonly used in the literature where the capability of the proposed algorithm to find high quality solutions is demonstrated, compared with the state-of-the-art algorithms in the literature. The other set revises the former through incorporating the linear deterioration effect. Two key components of the proposed algorithm are investigated to confirm their critical role to the success of the proposed method.

1. Introduction

Scheduling is a form of decision-making that plays an essential role in manufacturing and service industries. A function that assigns tasks to resources to complete the project can be formulated as an informal definition of the scheduling problem. However, such simplification is not enough to cover all real-world applications with a variety of complex environments. Take the task duration; for example, the processing time of any task is fixed and constant in classical scheduling theory and system [1] while a hypothesis that the actual duration of the task is a linearly nondecreasing function of its starting time is put forward by Gupta and Gupta [2] in contrast to the cases found in traditional literature. From then on, many approaches concerning various scheduling types, accompanying with the phenomenon denominated as deterioration effect [3], constantly spring up.

Scheduling with deterioration is very common. For instance, in traditional manufacturing industries like the furniture, some tasks need to be processed by a carpenter and the carpenter may lower his machining speed gradually due to fatigue. In this case, the later a task is handled, the longer the time it needs to complete. For another example, in steel rolling mills, ingots need to be heated to required temperature before rolling. Heating time relies on the ingots’ current temperature, which depends upon the time it has been waiting to be heated. It is because the ingot cools down consequently requiring more heating time in the period of waiting. Similar cases often occur in manufacturing, financial management, steel production, medicine treatment, and so on. Scheduling deteriorating jobs was first considered by Browne and Yechiali [4] who assumed that task processing times are nondecreasing, start time dependent linear functions. Since then, researchers have devoted considerable efforts to this area and lots of remarkable papers have been published. Alidaee and Womer [5], as well as Cheng et al. [6] made the comprehensive overviews of existing scheduling problems with various deteriorating mechanisms.

In addition to changes in the definition of duration time in terms of research hotpot in the field of scheduling, project scheduling problem (PSP) provided a set of precedence-constrained tasks to be scheduled aiming at minimizing a given objective. Furthermore, tasks need to compete for scarce resources additionally in the resource-constrained project scheduling problem (RCPSP), which make it possible through a better adaption to apply in production planning, project management, or manufacturing, etc. Ultimately more adaptable multiskill resource-constrained project scheduling problem (MS-RCPSP) gives each resource a set of capabilities and each resource can bid for being assigned tasks.

Scheduling with deterioration and MS-RCPSP are two research hotspots of scheduling area and these two subfields are not absolutely separate. In terms of most tasks of actual MS-RCPSP, deterioration effects existed, for the reason of fatigued (humans or machines). However, there is no research concentrated on the integration of MS-RCPSP and deterioration.

In this paper, we pick the deterioration mechanism as linear deterioration. As for the researched MS-RCPSP with linear deterioration, which is dubbed MS-RCPSPLD, the differences compared to the scheduling problems with linear deterioration in the reported literature can be explained here. Foremost, the resource, or the machine in the usually researched scheduling problem with deterioration, mostly is restricted to be single-mode, which means that it owns only one capability, and can execute just a kind of task.

Moreover, as the RCPSP is proven to be NP-hard [7], there is no optimal solution that could be computed in polynomial time. And this paper also demonstrates that the MS-RCPSP and the MS-RCPSPLD are NP-hard because they are more general problems compared with the single-mode RCPSP. Hence, methods that find feasible solutions, which may not achieve global optimal but can obtained in acceptable time, are built by researchers. In such cases soft computing methods are used, mostly heuristics and metaheuristics.

Within the metaheuristics group of methodologies, it is noticed that memetic algorithm (MA), as a quite simple approach, gives promising results in the fields of both computer science and operational research [8]. MA represents one of the recent growing areas of research in evolutionary computation and is introduced by Moscato [9], inspired by both Darwinian principles of natural evolution and Dawkins’ notion of a meme. With MA, the traits of Universal Darwinism are more appropriately captured, in particular dealing with areas of evolutionary algorithms that marry other deterministic refinement techniques for solving optimization problems [10]. As a general framework, MA provides the search with desirable trade-off between intensification and diversification through the combined use of a crossover operator to generate new promising solutions and a local optimization procedure to locally improve the generated solutions [11, 12].

In next stages, to make MA more efficient, it needs to be supported by other metaheuristics, e.g., general variable neighborhood search (GVNS) proposed by Hansen et al. [13]. GVNS is a simple and effective metaheuristic for combinatorial optimization, yield through systematic change of neighborhoods within a refinement local search. It can avoid becoming mired in local optima and develop the search direction to an excellent solution ultimately by means of exploring new regions throughout the whole solution space. The GVNS has attracted attentions and shows remarkable performance compared to other basic variable neighborhood search (VNS) variants. Up to now, various optimization problems have taken the GVNS to pursue better solutions, such as the single-machine total weighted tardiness problem with sequence dependent setup times [14], the one-commodity pickup-and-delivery traveling salesman problem [15], and the vehicle routing problem [16].

As far as we know, there is no published work on solving the MS-RCPSP by the GVNS-MA. By natural extension, it makes sense to solve the MS-RCPSPLD with the GVNS-MA. The main goal of this paper is to get an insight to the problem integrating the MS-RCPSP with linear deterioration. How GVNS can be effectively hybridized with MA to solve MS-RCPSP and MS-RCPSPLD is examined in the GVNS-MA. The proposed approach is demonstrated to show its effectiveness in comparison to other state-of-the-art methods.

The remaining part of this paper is organized as follows. In Section 2, a short summary of existing publications is presented. Section 3 gives the description of the problem under consideration. In Section 4, the proposed GVNS-MA is elaborated. Section 5 shows performed experiments and their results before concluding the paper in Section 6 finally.

2.1. Deterioration Effect

There are many practical situations that any delay or waiting in starting time of a task may cause to increase its processing time and two main deterioration mechanisms are discussed.

Besides usual linear deterioration mechanism discussed in this paper, situations in which task’s processing times are represented by step functions characterized by a sharp change in processing time at the deadline points [1722] also are fairly common. Sundararaghvan and Kunnathur [23] firstly considered the corresponding single-machine scheduling problem for minimizing the sum of the weighted completion times while Mosheiov [17] provided some simple heuristics for these NP-hard problems to minimize the makespan. Next, Jeng and Lin [24] introduced a branch and bound algorithm for the single-machine problem with the same goal. The problem was extended by Cheng et al. [19] to the case with parallel machines, where a variable neighborhood search algorithm (VNS) was proposed.

As for the linear deterioration mechanism, Mosheiov [25] considered the case that processing times increase at a common rate and job weights are proportional to their normal processing time. He demonstrated that the optimal schedule is -shaped if the optimal objective is to minimize the total weighted completion time on a single machine. Moreover, simple linear deterioration where jobs have a fixed job-dependent growth rate but no basic processing time was further considered [17]. Ji and Cheng [26] discussed corresponding methods refer to the parallel-machine scheduling and gave a fully polynomial-time approximation scheme, whereas a single-machine scheduling problem with linear deterioration was studied by Jafari and Moslehi [27]; Wu et al. [28]; Wang and Wang [29], with respective goals of minimizing the number of tardy jobs and earliness penalties as well as total weighted completion time. More studies and discussions about linear deteriorating scheduling problems were shown in Bachman and Janiak [30]; Oron [31]; Wang and Wang [29]; Wu et al. [28].

2.2. MS-RCPSP

For the sake of its practicality, RCPSP has received more and more attentions [32]. U. and Kusiak [33]; Babiceanu et al. [34], and Coban [35] deal with the RCPSP in a dynamic, real time way. To obtain particular schedules at some point, metaheuristics are the most used techniques for solving RCPSP, including Tabu search [36, 37], Simulated Annealing [38, 39], or Genetic Algorithm [40]. Swarm Intelligence metaheuristics [41] are also effective for solving related issues. For example, Particle Swarm Optimization [42], Bee Colony Optimization [43], or the popular Ant Colony Optimization [44, 45]. Although classical RCPSP is deeply investigated and numerous methods could be easily compared using PSPLIB instances, it is not same for MS-RCPSP. There are not too many researches paying attention to MS-RCPSP.

Myszkowski et al. [46] defined new problem MS-RCPSP and benchmark to compare the effectiveness of examined approaches. Next, a hybrid ant colony optimization approach (HAC) [47], which links classical heuristic priority and the worst solutions stored by ants to update pheromone value, was proposed. To research this problem more thoroughly, a greedy randomized adaptive search procedure (GRASP) [48], a hybrid differential evolution and greedy algorithm [49], and a Co-Evolutionary algorithm [50] are developed to improve the quality of solutions. Before this period, Alanzi et al. [51] proposed a lower bound using a linear programming scheme for the RCPSP to solve the new extended MS-RCPSP model while Santos and Tereso [52] developed a filtered beam as a bonus for early completion into account. Zheng et al. [53] presented a teaching-learning-based optimization algorithm with a task-resource list-based encoding scheme combining the task list and the resource list and a left-shift decoding scheme where the balance between global exploration and local exploitation to achieve satisfactory performances was mainly stressed. Dai et al. [54] did the related work on the integration of MS-RCPSP and proposed step structures as well as two mutation operators.

3. Problem Statement

To define two considered MS-RCPSP and MS-RCPSPLD, as well as make them clear, the problem description and a mixed integer programming model can be described as follows. Let be a task-on-node network consisting of a set of nodes denoting task , and a set of edges representing the precedence relationships between a pair of tasks . Specifically, each pair means the task precedes . In other words, task cannot start until task finished. The duration of each task in MS-RCPSP is a prior known and constant while the value of duration in MS-RCPSPLD, turning out to hinge on the basic processing time and deteriorating rate , can be calculated by the function , where shall be the earliest available time of assigned resource , . To perform any task , the specific skill also is required. To make the tasks completed, a set of of renewable resources, which unassigned tasks can compete for when resources are idle, will be provided. Resources differ in mastered skills and let denote the skills covered by resource . Naturally, a subset of also is available to incorporate all tasks that can be processed by resource (). In same way, a subset of resources , including all resources which can be utilized to handle task , is obtained. Moreover, each resource can perform at most one task at a time and a task can be executed by at most one resource simultaneously. The objective is to minimize the makespan (the completion time of all tasks).

Based on the above description, we formulate the problem as a 0-1 integer programming model. Firstly, the binary variables receive value 1 if task is assigned to resource , and 0 otherwise. As for the binary variables are set to 1 if task is scheduled to precede task , 0 otherwise. Then, MS-RCPSP and MS-RCPSPLD can be formulated by objective function (1) subject to constraints (2) to (9).

In the above mode, objective function (1) denotes the optimal direction of MS-RCPSP and MS-RCPSPLD. Equation (2) defines the finishing time of any task. Constraint (3) restricts exactly one resource to a specific task among all available resources. Constraint (4) respects the skill constraints between resources and tasks. Constraint (5) highlights the precedence relationship between a pair of nodes : in other words, task can start only after is finished. Constraint (6) shows logical relationships between the assignment variables and sequencing variables. That is, when resource is simultaneously assigned to task and task , the sequence between two tasks must be determined: either precedes or precedes . Constraint (7) is the big- formulation to enforce the relationship between the sequencing variable and the continuous starting time variable. Constraint (8) calculates the makespan of project, while Constraint (9) regulars the domains of the variables.

4. GVNS-Based Memetic Algorithm

In this section, we describe in detail the general solution methodology and the supporting procedures in the following subsections.

4.1. Search Space and Evaluation Function

For a given problem, the GVNS-MA searches a space composed of all possible assignments respecting skill constraints in any order of tasks, including both legal and illegal configurations. The size of the search space is bounded by .

Based on preceding notations and depictions, to evaluate the quality of a candidate solution , we adopt an evaluation function which is defined as induced by : where is a large positive constant such that as . The first part of (10) represents the completion time of the last unfinished task, and the last part is an augmented penalty function where denotes the degree violation to precedence relationships. If holds for any , it demonstrates the solution is feasible, corresponding to a legal configuration, and its evaluation function will all depend on the first part, equal to the completion time of the schedule. When a problem instance admits no solution able to satisfy , , the search space of GVNS-MA is empty and no feasible solution can be found. Given two solutions and , is better than if . This statement implies an assumption that a better solution has fewer precedence constraint violations.

4.2. Methodology and General Procedure

Let denote a population of candidate configurations. Let represent the best solution attainable so far and the worst solution in (in terms of the evaluation function in Section 4.1), respectively. Let be a set of solution pairs initially composed of all possible pairs in . Next, the proposed GVNS-MA can be described as depicted in Algorithm 1.

Input: Problem instance I, the size of population
(), the depth of GVNS
Output: the best configuration found during the
search
Population_initialization() /∗Sec-
tion 4.3∗/
whiledo
Isolate a solution pair ran-
domly
crossOver /∗Section 4.4∗/
GVNS_Operator /∗Section 4.5∗/
ifthen
UpdatePopulation /∗Sec-
tion 4.6∗/
end if
end while
Return arg min

GVNS-MA first builds an initial population including candidate configurations by the procedures in Section 4.3. Then, the algorithm enters into a while loop which constitutes the main part of the GVNS-MA. On each new generation, the subsequent operations are executed. In the first place, a configuration pair is taken at random and deleted from PairSet. Next, GVNS-MA builds, with a crossover operator (see Section 4.4), a new configuration (the offspring). After that, the offspring is used as a starting point to further improve by the GVNS_operator (see Section 4.5). Finally, if the improved offspring is better than the worst solution in , it is used to update the population and PairSet. The detailed update operations are described in Section 4.6. The while loop continues until PairSet becomes empty. At the end of the while loop, the algorithm terminates and returns the best configuration found during the search. Note that the depth of GVNS represents a maximum number between two iterations without improvement, regarded as the stopping criterion of the GVNS_operator.

4.3. Population Initialization

In order to build the initial population (in Algorithm 2), the construction operator to generate a new solution is executed times. From the scratch, a new configuration is constructed as follows. The operator starts from assigning each task with a random resource satisfying skill constraint. Subsequently all tasks assigned to same resource are sequenced randomly at the end of previous task-to-resource phase. Then, for each generated solution, the GVNS_operator with the evaluation function (see Section 4.1) is used to optimize it to a local optimum and the obtained best configurations are selected to form the initial population. The detailed procedures are described in Algorithm 2.

Input: The set of tasks; the set
of renewable resources; skill constraints;
precedence relationships and the size of population ()
Output: The best configurations
for  popdo
Set RA
whiledo
Choose randomly from ; remove from ;
randomly isolate — the set covering all re-
sources can perform and record this assignment
as
end while
fordo
Generate a random task sequence for candidate
tasks assigned to
end for
Calculate the objective value ,TQ with the evalu-
ation function (see Section 4.1)
GVNS_operator,TQ /∗Section 4.5∗/
end for
Sort the configurations in an ascending sort of evalua-
tion function values and return the first solutions as the
initial population.
4.4. The Crossover Operator

Within a memetic algorithm, the crossover operator is another essential ingredient whose main goal is to bring the search process to new promising search regions to diversify the search. In this paper, the offspring of two parent configurations , shows as . To inherit the advantages of parent solutions, the tasks assigned to same resource in , are given priority to keep the task-to-resource assignment unchanged. As for the remain unassigned tasks and , they will be determined by same methods in Section 4.3. Analogously, we apply the GVNS_operator (see Section 4.5) to the offspring to finally gain the candidate for further population updating. The principle of this operator is detailed in the procedure crossover (Algorithm 3).

Input: Two parent solutions , ,
; Problem instance I
Output: The offspring
Set RA contains tasks remaining to be assigned
resource to and represents the size of .
fordo
ifthen
RARA
end if
end for
fornum  do
Assign randomly resource to
end for
Obtain and refine the offspring in the
same way as Algorithm 2/∗Section 4.3∗/
4.5. GVNS_Operator

This section discusses the local optimization phase of GVNS_MA, a key part of memetic algorithm. Its function ensures an intensified search to locate high quality local optima from any starting point. Here we design a generable variable neighborhood search (GVNS) heuristic as the local refinement procedure which shows good performance compared to other variable neighborhood search variants in terms of local search capability.

Given three neighborhood structures and an initial solution (), our GVNS_operator does the refinement as follows. Attention, the quality of any solution is evaluated as depicted in Section 4.1. To start with, the sequential order SO, which determines the applying sequence of these neighborhood structures is at random generated. For example, assuming that the sequence SO equals , the search begins from and ends at at the given iteration. For each neighborhood structure, a new local optima is obtained by applying the corresponding local search procedures to the incumbent solution , set at at the beginning of GVNS procedure. If is better than , is updated with the new solution , accepted as a descent to continue the local search for current neighborhood; otherwise the search turns to the next neighborhood structure in SO. One iteration terminates until the last neighborhood structure in SO is explored and then the search goes on with the next iteration until the stopping criteria is met; i.e., the best solution has not improved for consecutive iterations. The general sketch of GVNS operator is described in Algorithm 4, and the neighborhoods employed as well as the technique to calculate objective value rapidly are depicted in the following subsections.

Input: Initial solution ; a set of neighborhood structures
;
Output: The current best solution found during GVNS
process
Calculate the objective value according to the eval-
uation function in Section 4.1
/∗ is the current solution ∗/
/∗ is the best solution found so far∗/
/∗ counts the consecutive iterations where is not
improved ∗/
repeat
Generate a random sequence (SO) to apply three
neighborhood structures
Apply the relevant mechanism (Section 4.5.1) in pre-
determined order specified by SO, update if a better
configuration is attained
ifthen
reset the counter
else
end if
until
return
4.5.1. Move and Neighborhood

Three neighborhoods are adopted in GVNS_MA. The neighborhood is defined by the swap move operator which swaps two tasks processed by same resource and keeps previous task-to-resource assignment unchanged. As such given a solution , the swap neighborhood of is composed of all possible configurations that can be applied with the swap move to . The neighborhood is designed on the base of reversion which reverses all the tasks incorporated into two designated random tasks of one resource. As for the neighborhood , it is designed by the alter move operator which alters assigned resource from the original to another resource, equipped with demanded skill for one selected randomly task, with a random position in the task sequence of given resource. To efficiently assess the quality of any neighborhood solution, we devise a rapid evaluation technique for neighborhood solutions which is committed greatly to the computational efficiency of the GVNS-MA.

4.5.2. Rapid Evaluation Mechanism

Our rapid evaluation technique to neighborhood solutions realizes through effectively calculating the move value () which identifies the change in the evaluation function (see Section 4.1) of each possible move applicable to the incumbent solution . It functions in the reduction of computational cost to evaluate any attainable neighborhood solution, inspired by the situation where the starting and finishing times of most tasks will not be changed when neighborhood solutions are generated.

For and generated by swap and reversion move, the set of tasks with changed starting and ending times only incorporate the elements ranking next to the isolated first task in the sequence of given resource. Without consideration of deterioration, only the elements located in the position between two picked tasks are influenced. As for achieved by alter move, all the tasks lined up behind the designated task in the sequence of its initial assigned resource and the new distributed one are included. Attention, for three moves we recalculate the relevant parameters of above-mentioned tasks and the rest are ignored. In addition, the impact that the new solutions is defying the precedence relationships to varying degrees will be respected in terms of in evaluation function (see Section 4.1).

4.6. Updating population and PairSet

As illustrated in Algorithm 1, the population and the PairSet are updated when an excellent offspring is obtained through the crossover operator and improved further by GVNS_operator. First of all, if it is better than the worst solution in , for any improved offspring solution , the worst configuration is replaced by the offspring solution . When the population is updated, the PairSet should be updated accordingly: all pairs containing solution are deleted from set PariSet and all pairs generated by combining solution with others in are incorporated into PairSet.

5. Computational Experiments and Results

This section plans to assess the proposed method GVNS-MA through having comparisons with the state-of-the-art methods in the literature. For the lack of known benchmark data for handing MS-RCPSPLD, we firstly apply the proposed GVNS-MA to solve the MS-RCPSP on exist benchmark instances in favor of argument its effectiveness. Then, on this basis the GVNS-MA will be examined on the modified problem set.

5.1. Benchmark Instances

For the purpose of assessing GVNS-MA fully and comprehensively, computational experiments will be conducted on two sets of instances, where the first set is composed of 30 benchmark instances irrespective of deterioration and its available in Myszkowski et al. [46], which are artificially created in a base of real world, obtained from the Volvo IT Department in Wroclaw. The full information of each instance, including tasks durations, resource capabilities, or precedence between tasks, has been given. As for the other set, it consists of 45 instances generated with some modifications on first set to consider the linear deterioration. The detail will be described in Section 5.4.

5.2. Parameter Settings and Experiment Protocol

Our GVNS-MA was programmed in MATLAB R2015b and all the reported computational experiments presented below were executed on a personal computer equipped with an Intel Core i3 processor (3.10 GHz CPU and 2GB RAM) in the environment of Windows 7 OS. To eliminate the randomness as much as possible, twenty replications for each instance are carried out.

Table 1 shows the descriptions and settings of the parameters adopted in GVNS-MA, determined by preliminary experiments. Our memetic algorithm rests upon only three parameters: the population size , the depth of general variable neighborhood search , and the price for a violation to precedence constraint . For and , we follow Lai and Hao [55] and set , while the parameter is set at for the first experimental group and for the second.


Parameters SectionDescriptionValues

Section 4.2population size for GVNS-MA10
Section 4.5depth of GVNS50 000
Section 4.1penalty value for a violation,
to precedence constraint

5.3. Experimental Results without Deterioration

Our first experimental group aims to evaluate the performance of our GVNS-MA on the set of 30 known instances with at most 200 tasks and 40 renewable resources. Without regard to deterioration, it means that the GVNS-MA will set the deteriorating rates of all tasks at when it deals with the relevant computations. Table 2 records the computational results solved by the GVNS-MA with the goal of duration optimization, as well as the results achieved by other reference algorithms in the literature.


instances DEGRGRASPGVNS-MA

100-10-26-15236236250237242.6191.78-0.42
100-10-47-9256256263253256.8124.901.17
100-10-48-15247247255245250.9175.050.81
100-10-64-9250250254247257.1165.361.20
100-10-64-15248248256246250.6173.170.81
100-20-22-15134134134133137.6149.530.75
100-20-46-15164164170160163.2137.702.44
100-20-47-9138138180132139.4128.704.35
100-20-65-15213240213193198.0103.179.39
100-20-65-9134134134134140.0138.930.00
100-5-22-15484484503483484.0131.640.21
100-5-46-15529529552528533.1189.480.19
100-5-48-9491491509489490.5134.450.41
100-5-64-15483483501480482.3146.270.62
100-5-64-9475475494474475.2162.610.21
200-10-128-15462462491479499.0746.32-3.68
200-10-50-15488488522488500.6895.290.00
200-10-50-9489489506487493.2793.340.41
200-10-84-9517517526509514.0719.201.55
200-10-85-15479479486477481.8561.760.42
200-20-145-15245245262252271.0660.08-2.86
200-20-54-15270270304291303.4847.46-7.78
200-20-55-9257262257257263.0639.970.00
200-20-97-15336336347334338.2724.570.60
200-20-97-9253253253253258.1716.200.00
200-40-133-15159159163157165.0772.821.26
200-40-45-15164164164159163.6565.583.05
200-40-45-9144168144144152.0626.530.00
200-40-90-9145160145145149.4654.240.00
200-40-91-15153153153153157.6624.010.00
#8626
#303030
#0.50

Notice that the instance name (columns 1) contains its full description. Take the instance named 100-10-26-15 as example, the number represents the number of tasks included and denotes the quantity of renewable resources provided. As for the number and , it illustrates the amount of precedence relationships and the number of different introduced skills. Column of Table 2 indicates the previous minimum objective values () in the literature which are compiled from the best solutions yield by two recent and best performing algorithms, namely, GRASP [48] and DEGR [49]. Columns 3 to 4 give the best results obtained by DEGR and GRASP. The corresponding results of the GVNS-MA are given in columns to , including the minimum objective value () over 20 independent runs, the average objective value (), and the average computing time in seconds (Time(s)) to reach . The row Best indicates a total number of instances where the specific method achieves optimal among three algorithms. The best one is indicated in italic. In addition, to verify whether there exists an essential difference between the best results of GVNS-MA and other reference algorithms, the relative percentage deviation (RPD) is defined by the equation where a positive value of means an improvement of result achieved by GVNS-MA while the negative number represents a worse solution.

Table 2 discloses that the outcomes from our GVNS-MA are noteworthy compared to the state-of-the-art results in the literature. GVNS-MA improves the previous best known results for 19 instances and matches for 7 cases. Compared with the 8 out of 30 cases solved by DEGR and 6 best solutions achieved by GRASP, these data clearly indicate the superiority of GVNS-MA compared to the previous excellent methods. Additionally, it can be observed that the improvement achieved by GVNS-MA is up to , for instance 100-20-65-15, accompanying that the average equals to .

5.4. Experimental Results with Linear Deterioration

The previous comparisons and discussions in Section 5.3 demonstrate the advantages of GVNS-MA in solving the related issues of MS-RCPSP. In this section, the aforementioned dataset with some modifications is used to assess the capability of GVNS-MA to solve the MS-RCPSPLD. The procedures of generating the testing instances and analysis of the results are described below. To make the benchmark instances meet the considered linear deterioration precisely, the deterioration rate () for task is generated randomly from three intervals , and , similar to Cheng et al. [19], to shed light on the influence of the different value range of deterioration rate on its effectiveness.

Since the extra included deterioration rate, we provide two additional heuristics for the initial population generation of GVNS-MA. Both the two methods affect the phase of generating , determining the sequence of tasks assigned to resource . The first heuristic considers the sequence in descending order of deterioration rate () while the other rests upon an ascending order of ratio () of the basic processing time and deterioration rate. The methods adopting the former and latter heuristic to population initialization are dubbed GVNS- and GVNS-, respectively.

Here, instances with 100 tasks from Myszkowski et al. [46] are isolated to attain the researched objects which fit with the unique nature of the MS-RCPSPLD more. To account for the three intervals from which the deterioration rate is drawn, 3 extended cases are needed to solve for each instance. For convenience, these instances are denoted by adding a suffix for identification to different intervals. For example, 100-10-26-15_1 represents the original case 100-10-26-15 is modified by adding the deterioration rates produced in to the durations of tasks. In total, there are instances randomly generated.

Due to zero known results in literature for same dataset, the improved tabu search (ITS) proposed by Dai et al. [54], who discussed the MS-RCPSP under step deterioration, and a path relinking algorithm (PR) [55], based on the population path relinking framework, are programmed as reference algorithms.

Table 3 reports the computational results achieved by the ITS, PR, GVNS-MA, GVNS-, and GVNS- on the set of 45 benchmark instances. denotes the minimum objective value and is computed as the average objective value of 20 runs.


instances ITSPRGVNS-MAGVNS-GVNS-

100-10-26-15_1655.72659.81389.99636.46649.26687.1632.74639.23309.26619.67637.97306.98626.32636.29294.22
100-10-26-15_26013.966184.16286.076089.716254.36792.835871.456139.34374.965805.576154.74238.795727.946151.56348.26
100-10-26-15_31728.561841.75312.361646.961755.13597.761602.831693.6222.251662.211712.4175.411638.981722.28346.1
100-10-47-9_1700.8720.53403.04697.44712.321001.8694.45700.98206.66676.45691.57314.99696.73703.9363.14
100-10-47-9_27003.527392.87391.127034.397211.52705.636722.217151.38241.796723.046959206.146935.537023.69251.14
100-10-47-9_31882.061952.06481.681835.81908.63934.631741.621843.89300.081773.231839.58193.831737.081833.68414.32
100-10-48-15_1658.68691.41399.15670.93689.08887.91648.51655.26349.16632.53665.95226.86647.98661.02266.62
100-10-48-15_26387.476598.09420.436213.576587.47911.616186.76516.09411.615904.326254.62270.976185.076346.32336.55
100-10-48-15_31709.991742.32296.591718.641780.61733.951594.971668.87233.951614.831663.66321.691635.011702.73270.56
100-10-64-9_1705.27757.25377.03710.49769.27730.24687.22709.29312.87688.4712.15260.24678.94696.82277.56
100-10-64-9_27058.067447.75394.157040.327381.41627.946637.297111.14301.396842.17191.53228.066967.277368.33399.18
100-10-64-9_31938.442062.06311.532006.422044.031089.181893.241944.5354.151808.422008.42310.41938.441999.96318.71
100-10-64-15_1701.19714.97346.26710.75727.96835.43693.46700.22390.97669.1691.12212.49700.42707.96171.16
100-10-64-15_26909.647447.75389.986725.787282.3616.846606.146850.85224.916282.36829.57317.846263.316664.18237.6
100-10-64-15_31938.442185.06318.711942.472042.35713.181806.921860.08253.361871.491925.56454.381855.851909.57252.96
100-20-22-15_1190.89193.55296.31193.6197.39551.76188.83191.18222.2185.72189.8214.38187.8189.65247.42
100-20-22-15_2461.58477.31368.54460.32467.14679.26453.71460.08284.55452.18466.27289.26458.33463.3231.24
100-20-22-15_3263.28279.81285.28272.12269.73697.29259.7264.19281.2255.63259.18175.31255.75262.54213.52
100-20-46-15_1262.43267.3334.24262.14266.31603.54258.62263.29411.99255.11258.96121.53254.76260.06174.66
100-20-46-15_2606.47662.44344.08593.67635.96718.78579.61616.5172.16565.42594.2266.96546.5592.85223.13
100-20-46-15_3324.21349.09375.23335.39341.79776.34316.95329.09164.33316.51332.63291.16328.41333.49279.1
100-20-47-9_1190.07197.59290.27191.63196.85577.63188.64191.2283.11187.47192.69273.2184.55188.92307.31
100-20-47-9_2505.91534.81371.19478.39514..841021.73480.3493.19354.9462.78487.64354.18449.66478.93242.41
100-20-47-9_3308.02318.27457.26306.31313.65699.58294.37303.52578.46277.12294.58297.37283.99287.99275.59
100-20-65-15_1901.34924.46264.13898.65905.43679.57888.01900.95175.05868.26895.18150.52873.05893.38284.3
100-20-65-15_22538.992606.76287.182501.262532.67587.632447.622503.16409.972434.492475.1176.592423.532449.44257.35
100-20-65-15_31105.6711158.86274.911098.741136.85534.181052.151092.24251.381085.951112.43159.111048.291067.76141.26
100-20-65-9_1191.13197.83412.48189.57195.48795.61183.69188.98305.61186.97191.46189.6186.94192.65309.79
100-20-65-9_2462.42477.68654.69459.34474.43581.12449.57462.29176.8447.19459.85223.24455.93465.91306.06
100-20-65-9_3280.18287.76489.43275.12281.08685.32271.9277.21242.79265.87276.91310.1264.55278.45247.3
100-5-22-15_15009.885142.85289.785102.855050.98845.264865.864993.18435.294943.645009.88184.444985.675102.85223.35
100-5-22-15_211934401227080431.9411923001210150615.3711186101199248243.2211849401219514206.6411384901226780266.56
100-5-22-15_366394.770081.8569.1266155.379262.7799.7660632.265262.7106.3959250.962793.04261.9864385.665975.26172.67
100-5-46-15_16757.397497.63367.976527.937014.571378.626350.36796.63507.586369.036879.41298.886491.646719.82362.02
100-5-46-15_214046801453430585.95144352914709701085.9512984301370870265.6413159401360830235.3613322101399014241.76
100-5-46-15_379566.487031.3506.8779777.138635.67689.1174017.879651.28179.2475586.677860.62168.0975256.880128187.63
100-5-48-9_15637.875868.32312.145666.27783.86848.075520.65604.07241.55520.65636.64250.185542.995665.7249.52
100-5-48-9_212842301315720361.4512898111364650712.8612223501285020279.5811638601259332281.2212330101268572346.59
100-5-48-9_368429.969245.3453.356678571727.92939.3865727.967622456.166042.667091.7412.866482266721.38284.46
100-5-64-15_15819.166273.74556.615765.896181.671024.155544.265792.34351.675465.435903.52296.785694.25801.75566.19
100-5-64-15_212094401261510312.96119083012576431235.3311314501183014405.9511184301151812463.0510472501158556333.7
100-5-64-15_364226.770960.2349.8863465.168888.9894.0361285.766578.58379.8562677.166061.44459.1162475.367499.62616.23
100-5-64-9_15502.315775.24373.655544.815667,47986.935281.775404.36339.35307.485438.95483.965159.845367.47299.32
100-5-64-9_212143401271610405.53118347912367501199.2711140601155584415.2311640101201126402.8711216501159384272.86
100-5-64-9_361035.664876.5363.9561515.0263232.3874.4860458.662103.78313.6359451.461715.02305.4359519.162322.3277.49
#0000151417161415
#45454545454545454545

First, Table 3 discloses that the solutions obtained by GVNS-MA, GVNS-, and GVNS- are better than the ITS and PR for any instance from the perspective of both quality of schedule and runtime. To some extent these results demonstrated the differences between linear deterioration and step deterioration and the superiority of memetic algorithm framework. Second, these three methods, differing in the sort order of tasks in initialize phase, behave similarly where GVNS-MA obtains the best 15 out of 45 instances, 17 for GVNS-, and 14 for in terms of . Specifically, GVNS-MA and GVNS- attain the optimal simultaneously for the instance 100-5-48-9-1. From a view point of and run time, three methods also have a balanced performance. Third, as far as three different intervals to generate deterioration rate are concerned, the phenomenon did not happen that the relevant algorithms display strikingly different behavior. In other words, the performance of the proposed algorithm is not sensitive to the setting of deterioration rate.

5.5. Analysis and Discussions

In this section, we study two essential ingredients of the proposed GVNS-MA to get an insight to its performance. One is the rapid evaluation mechanism; the other is the role of the memetic framework.

5.5.1. Importance of Rapid Evaluation Mechanism

GVNS-MA with rapid evaluation mechanism only calculates the relevant parameters of some particular tasks rather than all when the procedure computes the objective value of a neighborhood solution. To highlight the key role of the rapid evaluation mechanism, two sets of comparison experiments are carried out on generated dataset with two algorithms, GVNS-MA and GVNS-, including same ingredients with GVNS-MA except for the computation of objective value. When GVNS- figures up the value of a neighborhood solution, it computes all relevant parameters again.

Table 4 records the experimental results carried out on the dataset [46] without consideration of deterioration, whereas Table 5 shows the comparisons of GVNS-MA and GVNS- about the set of 15 instances generated in Section 5.4 on account of the indiscrimination in three intervals. Column and record the best attained by two algorithms. Column and indicate the minimum time cost to a final feasible schedule with one run of procedure. Note that the best objective value cannot be guaranteed as the output of shortest runtime. As for the parameters in column and , they represent the mean runtime. Finally, two parameters and are used to disclose the runtime deviation of two methods, defined by equationsand respectively. The positive value of and means that GVNS- has better performance and negative value tells GVNS-MA is prior to GVNS- in terms of time cost. And the rows Better and Worse, respectively, show the number of instances for which the corresponding results of the associated algorithm are better and worse than the other.


instances GVNS-MAGVNS-

100-10-26-15237134.58191.78237155.41240.93-15.48-25.63
100-10-47-9253107.90124.90253112.59155.26-4.35-24.31
100-10-48-15245148.01175.05245174.61215.94-17.97-23.36
100-10-64-9247142.61165.36247162.58216.63-14.00-31.01
100-10-64-15246104.49173.17246121.29222.18-16.08-28.30
100-20-22-15133129.46149.53133145.47176.29-12.37-17.90
100-20-46-15160106.16137.70160121.39175.66-14.35-27.57
100-20-47-9132114.82128.70132142.51174.44-24.12-35.54
100-20-65-1519397.82103.17193113.01129.22-15.53-25.25
100-20-65-9134112.29138.93134126.16159.56-12.35-14.85
100-5-22-15483105.73131.64483120.40167.90-13.87-27.54
100-5-46-15528160.97189.48528182.98221.45-13.67-16.87
100-5-48-9489114.20134.45489134.52146.37-17.79-8.87
100-5-64-15480122.67146.27480164.45202.54-34.06-38.47
100-5-64-9474124.63162.61474154.10206.64-23.65-27.08
200-10-128-15479657.93746.32479801.41902.58-21.86-20.94
200-10-50-15488835.5895.29488913.44984.38-9.33-9.95
200-10-50-9487744.07793.34487820.27818.20-10.24-3.13
200-10-84-9509668.63719.20509725.68862.85-8.53-19.97
200-10-85-15477500.61561.76477561.76688.83-12.22-22.62
200-20-145-15252534.14660.08252590.08715.30-10.478.37
200-20-54-15291745.02847.46291785.80967.01-5.47-14.11
200-20-55-9257577.67639.97257622.39713.94-7.74-11.56
200-20-97-15334592.01724.57334666.73749.14-12.62-3.39
200-20-97-9253565.37716.20253683.70809.50-20.9313.03
200-40-133-15157682.28772.82157720.41844.72-5.59-9.30
200-40-45-15159476.09565.58159511.30615.16-7.40-8.77
200-40-45-9144571.43626.53144615.48700.62-7.71-11.83
200-40-90-9145616.23654.24145683.97738.17–10.99-12.83
200-40-91-15153588.02624.01153664.87760.05-13.07-21.80
#302802
#023028
#30303030
#-13.79-18.80


instances GVNS-MAGVNS-

100-10-26-15_1632.74146.08274.99635.08163.91309.99-12.21-12.73
100-10-47-9_1694.45206.66349.51696.66197.36364.154.50-4.19
100-10-48-15_1648.51193.34286.55649.11174.83244.179.5714.79
100-10-64-9_1687.22222.47312.41678.09191.71348.7813.83-11.64
100-10-64-15_1693.46192.91309.49673.75190.47297.091.264.01
100-20-22-15_1188.83161.71256.15187.22146.31225.349.5212.03
100-20-46-15_1258.62154.94240.39256.60142.55228.868.004.80
100-20-47-9_1188.64222.79258.72182.12252.05293.80-13.13-13.56
100-20-65-15_1888.01172.61207.43870.85220.43187.68-27.709.52
100-20-65-9_1183.69237.32354.53188.66264.17333.25-11.316.00
100-5-22-15_14865.86184.44270.234866.02224.41295.76-21.67-9.45
100-5-46-15_16350.3264.37457.836720.42270.03488.58-2.14-6.72
100-5-48-9_15520.60154.46264.235520.60189.28311.00-22.54-17.70
100-5-64-15_15544.26338.39413.585555.52322.48461.024.70-11.47
100-5-64-9_15281.77222.77323.465287.14200.70350.719.91-8.42
#7986
#8679
#15151515
#-3.29-2.98

The results summarized in Table 4 disclose that the GVNS-MA has an overwhelming advantage over GVNS- in terms of the computation time to solve MS-RCPSP, leaving out the deterioration effect. Indeed, the shortest runtime of the GVNS-MA method is better than the shortest runtime of GVNS- for 30 out of 30 representative instances, and the average runtime is better for 28 out of 30 instances. Meanwhile, the average value of equals -13.79%, accompanying with a high of -18.80 percent in .

However, focusing on Table 5, the results of two approaches are neck and neck, and GVNS-MA lost its early superiority in MS-RCPSP. In terms of shortest runtime, GVNS-MA successes for 7 out of 15 tested instances while GVNS- reaches optimal for the remain. As for average runtime, GVNS-MA performs better for 9 out of 15 examples and GVNS- achieves reversion in others 6 instances. With these data it will be hard to judge the true benefits of one approach versus the other.

To figure out the reason of this phenomenon, we should come back to the inner rationale of rapid evaluation mechanism. When GVNS-MA computes the completion time of a neighborhood solution, it only recalculates the tasks’ related parameters influenced by the particular move. In MS-RCPSP, a move including swap, reverse, and alter will affect just a small number of tasks. But for MS-RCPSPLD instances, any move can cumulatively effect on a large proportion of tasks because of the existing deterioration. Consequently, the runtime saved in computing some unchanged parameters may not make up for the time spent on isolating the changed tasks.

These experimental results confirm that although the rapid evaluation mechanism is not so critical for MS-RCPSPLD, it is still quite useful to quickly solve MS-RCPSP instances and constitutes a significant element of the proposed GVNS-MA.

5.5.2. Influence of the Memetic Framework

As shown in Lei et al. [16]; Mladenovićabcd [15], the GVNS approach has shown great performance in a widespread academic application. So it is meaningful to research whether our GVNS-MA has a significant advantage over the originally efficient GVNS algorithm. For this reason, a comparative test between GVNS and GVNS-MA has been carried out. For this experiment, we used the known dataset [46], with 20 times running for each instance. Same with GVNS-MA, the stopping criteria of GVNS is met when the maximum number between two iterations without improvement reaches . The experimental results of two methods are recorded in Table 6 where , and the other symbols have same meanings as those of Table 2. As for the ad in the equation, they denote the objective value of the best schedule solved by the particular algorithm and the best value attainable until now, respectively. The parameter DEV can visually detect the gap between the current algorithm and the best.


instances GVNS-MAGVNS

100-10-26-152370.002609.70
100-10-47-92530.002550.79
100-10-48-152450.002554.08
100-10-64-92470.002574.05
100-10-64-152460.002480.81
100-20-22-151330.001426.77
100-20-46-151600.001610.63
100-20-47-91320.001341.52
100-20-65-151930.002056.22
100-20-65-91340.001425.97
100-5-22-154830.004860.62
100-5-46-155280.005809.85
100-5-48-94890.004930.82
100-5-64-154800.004942.92
100-5-64-94740.004770.63
200-10-128-154790.005014.59
200-10-50-154880.005165.74
200-10-50-94870.005094.52
200-10-84-95092.214980.00
200-10-85-154770.004943.56
200-20-145-152520.0028513.10
200-20-54-152910.003034.12
200-20-55-92570.002673.89
200-20-97-153340.003473.89
200-20-97-92530.0028211.46
200-40-133-151570.0018115.29
200-40-45-151590.001643.14
200-40-45-91440.0017622.22
200-40-90-91450.0017319.31
200-40-91-151530.001604.58
#291
#00
#129
#3030
#0.075.83

Obviously, Table 6 demonstrates that the GVNS-MA significantly outperforms the GVNS algorithm in general. First, compared with the GVNS algorithm, the GVNS-MA obtains better and worse results in terms of the minimum objective value on 29 and 1 instances, respectively. Second, it can be seen that the obtained average Devs are 0.07% and 5.83%, respectively, for the GVNS-MA and GVNS, implying that there exists a huge difference between two methods. Third, the runtimes of PR are obviously longer than GVNS-MA with worse solutions. These outcomes indicate that the memetic part of the proposed GVNS-MA is very appropriate for solving the related issue of MS-RCPSP.

6. Conclusions

The proposed general variable neighborhood search-based memetic algorithm (GVNS-MA) for solving the MS-RCPSP and MS-RCPSPLD incorporates an effective neighborhood search procedure and a random crossover operator while applying an original scheme for parent selection. We tested the proposed GVNS-MA on 30 benchmark instances commonly used in the literature and 45 newly generated instances. The computational results of the state-of-the-art algorithms in the literature demonstrate that our algorithm is highly effective for solving MS-RCPSP. Specifically, it improves or matches the previous best known results for all tested instances. As for MS-RCPSPLD, GVNS-MA has a better performance than ITS for any instance in terms of the quality of solution and a considerable shorter runtime compared to PR.

The investigations of some essential ingredients of the proposed algorithm shed light on the behavior of the GVNS-MA. First, the rapid evaluation mechanism is particularly suitable to solve MS-RCPSP instances. Second, the population evolution based memetic framework is significantly contributed to the algorithm’s performance.

Here we discussed the linear deterioration of the multiskill tasks. It would be interesting to investigate such a scheduling problem in other deterioration mechanisms to meet various actual production conditions.

Data Availability

The data used to support the findings of this study are available from the corresponding author upon request.

Conflicts of Interest

The authors declare that there are no conflicts of interest regarding the publication of this paper.

Acknowledgments

This work was partially supported by the National Natural Science Foundation of China (no. 51675450) and Sichuan Science and Technology Program (nos. 2019YFG0300; no. 2019YFG0285).

References

  1. M. L. Pinedo, Scheduling: Theory, Algorithms, and Systems, Springer, 2012. View at: Publisher Site | MathSciNet
  2. J. N. D. Gupta and S. K. Gupta, “Single facility scheduling with nonlinear processing times,” Computers & Industrial Engineering, vol. 14, no. 4, pp. 387–393, 1988. View at: Publisher Site | Google Scholar
  3. S. Gawiejnowicz, Time-Dependent Scheduling, Springer, 2008. View at: MathSciNet
  4. S. Browne and U. Yechiali, “Scheduling deteriorating jobs on a single processor,” Operations Research, vol. 38, no. 3, pp. 495–498, 1990. View at: Publisher Site | Google Scholar
  5. B. Alidaee and N. K. Womer, “Scheduling with time dependent processing times: review and extensions,” Journal of the Operational Research Society, vol. 50, no. 7, pp. 711–720, 1999. View at: Publisher Site | Google Scholar
  6. T. C. E. Cheng, Q. Ding, and B. M. T. Lin, “A concise survey of scheduling with time-dependent processing times,” European Journal of Operational Research, vol. 152, no. 1, pp. 1–13, 2004. View at: Publisher Site | Google Scholar | MathSciNet
  7. J. Blazewicz, J. K. Lenstra, and A. H. Rinnooy Kan, “Scheduling subject to resource constraints: classification and complexity,” Discrete Applied Mathematics, vol. 5, no. 1, pp. 11–24, 1983. View at: Publisher Site | Google Scholar | MathSciNet
  8. W. E. Hart, J. E. Smith, and N. Krasnogor, “Recent advances in memetic algorithms,” Studies in Fuzziness & Soft Computing, vol. 166, 2005. View at: Google Scholar
  9. P. Moscato, “On evolution, search, optimization, genetic algorithms and martial arts: Towards memetic algorithms,” Caltech Concurrent Computation Program, 1989. View at: Google Scholar
  10. X. Chen, Y.-S. Ong, M.-H. Lim, and K. C. Tan, “A multi-facet survey on memetic computation,” IEEE Transactions on Evolutionary Computation, vol. 15, no. 5, pp. 591–607, 2011. View at: Publisher Site | Google Scholar
  11. J. Layegh, F. Jolai, and M. S. Amalnik, “A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration,” Advances in Engineering Software, vol. 40, no. 10, pp. 1074–1077, 2009. View at: Publisher Site | Google Scholar
  12. P. Galinier, Z. Boujbel, and M. Coutinho Fernandes, “An efficient memetic algorithm for the graph partitioning problem,” Annals of Operations Research, vol. 191, no. 1, pp. 1–22, 2011. View at: Publisher Site | Google Scholar | MathSciNet
  13. P. Hansen, N. Mladenovic, J. Brimberg, and J. A. M. Perez, “Variable neighborhood search,” European Journal of Operational Research, vol. 24, pp. 593–595, 1997. View at: Google Scholar
  14. G. Kirlik and C. Oguz, “A variable neighborhood search for minimizing total weighted tardiness with sequence dependent setup times on a single machine,” Computers & Operations Research, vol. 39, no. 7, pp. 1506–1520, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  15. N. Mladenovićabcd, “A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem,” European Journal of Operational Research, vol. 220, no. 1, pp. 270–285, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  16. H. Lei, G. Laporte, and B. Guo, “A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times,” TOP, vol. 20, no. 1, pp. 99–118, 2012. View at: Publisher Site | Google Scholar | MathSciNet
  17. G. Mosheiov, “Scheduling jobs with step-deterioration; Minimizing makespan on a single- and multi-machine,” Computers & Industrial Engineering, vol. 28, no. 4, pp. 869–879, 1995. View at: Publisher Site | Google Scholar
  18. T. E. Cheng, Q. Ding, M. Y. Kovalyov, A. Bachman, and A. Janiak, “Scheduling jobs with piecewise linear decreasing processing times,” Naval Research Logistics, vol. 50, no. 6, pp. 531–554, 2003. View at: Publisher Site | Google Scholar
  19. W. Cheng, P. Guo, Z. Zhang, M. Zeng, and J. Liang, “Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs,” Mathematical Problems in Engineering, vol. 2012, Article ID 928312, 20 pages, 2012. View at: Publisher Site | Google Scholar
  20. P. Guo, W. Cheng, and Y. Wang, “Scheduling step-deteriorating jobs to minimise the total weighted tardiness on a single machine,” International Journal of Systems Science: Operations & Logistics, vol. 0, pp. 1–16, 2015. View at: Google Scholar
  21. P. Guo, W. Cheng, and Y. Wang, “A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs,” Journal of Industrial and Management Optimization, vol. 10, no. 4, pp. 1071–1090, 2014. View at: Publisher Site | Google Scholar | MathSciNet
  22. C. He, C. Wu, and W. Lee, “Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs,” Journal of the Operational Research Society, vol. 60, no. 12, pp. 1759–1766, 2009. View at: Publisher Site | Google Scholar
  23. P. S. Sundararaghavan and A. S. Kunnathur, “Single machine scheduling with start time dependent processing times: some solvable cases,” European Journal of Operational Research, vol. 78, no. 3, pp. 394–403, 1994. View at: Publisher Site | Google Scholar
  24. A. A. Jeng and B. M. Lin, “Makespan minimization in single-machine scheduling with step-deterioration of processing times,” Journal of the Operational Research Society, vol. 55, no. 3, pp. 247–256, 2004. View at: Publisher Site | Google Scholar
  25. G. Mosheiov, “V-shaped policies for scheduling deteriorating jobs,” Operations Research, vol. 39, no. 6, pp. 979–991, 1991. View at: Publisher Site | Google Scholar | MathSciNet
  26. M. Ji and T. C. E. Cheng, “Parallel-machine scheduling with simple linear deterioration to minimize total completion time,” European Journal of Operational Research, vol. 188, no. 2, pp. 342–347, 2008. View at: Publisher Site | Google Scholar | MathSciNet
  27. A. Jafari and G. Moslehi, “Scheduling linear deteriorating jobs to minimize the number of tardy jobs,” Journal of Global Optimization, vol. 54, no. 2, pp. 389–404, 2012. View at: Publisher Site | Google Scholar
  28. C.-C. Wu, W.-C. Lee, and Y.-R. Shiau, “Minimizing the total weighted completion time on a single machine under linear deterioration,” The International Journal of Advanced Manufacturing Technology, vol. 33, no. 11-12, pp. 1237–1243, 2007. View at: Publisher Site | Google Scholar
  29. D. Wang and J.-B. Wang, “Single-machine scheduling with simple linear deterioration to minimize earliness penalties,” The International Journal of Advanced Manufacturing Technology, vol. 46, no. 1–4, pp. 285–290, 2010. View at: Publisher Site | Google Scholar
  30. A. Bachman and A. Janiak, “Minimizing maximum lateness under linear deterioration,” European Journal of Operational Research, vol. 126, no. 3, pp. 557–566, 2000. View at: Publisher Site | Google Scholar | MathSciNet
  31. D. Oron, “Single machine scheduling with simple linear deterioration to minimize total absolute deviation of completion times,” Computers & Operations Research, vol. 35, no. 6, pp. 2071–2078, 2008. View at: Publisher Site | Google Scholar | MathSciNet
  32. P. Brucker, A. Drexl, R. Möhring, K. Neumann, and E. Pesch, “Resource-constrained project scheduling: notation, classification, models, and methods,” European Journal of Operational Research, vol. 112, no. 1, pp. 3–41, 1999. View at: Publisher Site | Google Scholar
  33. U. Belhe and A. Kusiak, “Dynamic scheduling of design activities with resource constraints,” IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans, vol. 27, pp. 105–111, 2002. View at: Google Scholar
  34. R. F. Babiceanu, F. F. Chen, and R. H. Sturges, “Real-time holonic scheduling of material handling operations in a dynamic manufacturing environment,” Robotics and Computer-Integrated Manufacturing, vol. 21, no. 4-5, pp. 328–337, 2005. View at: Publisher Site | Google Scholar
  35. R. Coban, “A context layered locally recurrent neural network for dynamic system identification,” Engineering Applications of Artificial Intelligence, vol. 26, no. 1, pp. 241–250, 2013. View at: Publisher Site | Google Scholar
  36. Z. Akeshtech and F. Mardukhi, “An imperialist competitive algorithm for resource constrained project scheduling with activities flotation,” International Journal of Computer Science and Network Security, vol. 17, pp. 125–134, 2017. View at: Google Scholar
  37. J. Poppenborg and S. Knust, “A flow-based tabu search algorithm for the RCPSP with transfer times,” OR Spectrum, vol. 38, no. 2, pp. 305–334, 2016. View at: Publisher Site | Google Scholar | MathSciNet
  38. A. Laurent, L. Deroussi, N. Grangeon, and S. Norre, “A new extension of the RCPSP in a multi-site context: Mathematical model and metaheuristics,” Computers & Industrial Engineering, vol. 112, pp. 634–644, 2017. View at: Publisher Site | Google Scholar
  39. H. Farughi, A. Amiri, and F. Abdi, “Project scheduling with simultaneous optimization, time, net present value, and project flexibility for multimode activities with constrained renewable resources,” International Journal of Engineering, Transactions B: Applications, vol. 31, no. 5, pp. 780–791, 2018. View at: Google Scholar
  40. M. Đumić, D. Šišejković, R. Čorić, and D. Jakobović, “Evolving priority rules for resource constrained project scheduling problem with genetic programming,” Future Generation Computer Systems, vol. 86, pp. 211–221, 2018. View at: Publisher Site | Google Scholar
  41. R. Coban and C. Burhanettin, An Expert Trajectory Design for Control of Nuclear Research Reactors, Pergamon Press, Inc, 2009.
  42. R. Coban and I. O. Aksu, “Neuro-controller design by using the multifeedback layer neural network and the particle swarm optimization,” Tehnički Vjesnik-Technicla Gazette, vol. 25, no. 2, pp. 437–444, 2018. View at: Google Scholar
  43. B. Ata and R. Coban, “Artificial bee colony algorithm based linear quadratic optimal controller design for a nonlinear inverted pendulum,” International Journal of Intelligent Systems & Applications in Engineering, vol. 3, 2015. View at: Google Scholar
  44. A. Gonzalez-Pardo, J. Del Ser, and D. Camacho, “Comparative study of pheromone control heuristics in ACO algorithms for solving RCPSP problems,” Applied Soft Computing, vol. 60, pp. 241–255, 2017. View at: Publisher Site | Google Scholar
  45. Q. Chen, K. Lin, and C. C. Wei, “Application of aco algorithm and different scheduling rules in multi-objective resource-constrained project scheduling problem?modification and comparison with different scheduling rules,” Computer Engineering and Applications, vol. 53, pp. 249–254, 2017. View at: Google Scholar
  46. P. B. Myszkowski, M. E. Skowroński, and K. Sikora, “A new benchmark dataset for Multi-Skill resource-constrained project scheduling problem,” in Proceedings of the Federated Conference on Computer Science and Information Systems (FedCSIS '15), pp. 129–138, September 2015. View at: Google Scholar
  47. P. B. Myszkowski, M. E. Skowroński, Ł. P. Olech, and K. Oślizło, “Hybrid ant colony optimization in solving multi-skill resource-constrained project scheduling problem,” Soft Computing, vol. 19, no. 12, pp. 3599–3619, 2015. View at: Publisher Site | Google Scholar
  48. P. B. Myszkowski and J. J. Siemieński, “GRASP applied to multi–skill resource–constrained project scheduling problem,” in Computational Collective Intelligence, pp. 402–411, 2016. View at: Publisher Site | Google Scholar
  49. P. B. Myszkowski, Ł. P. Olech, M. Laszczyk, and M. E. Skowroński, “Hybrid differential evolution and greedy algorithm (DEGR) for solving multi-skill resource-constrained project scheduling problem,” Applied Soft Computing, vol. 62, pp. 1–14, 2018. View at: Publisher Site | Google Scholar
  50. P. B. Myszkowski, M. Laszczyk, and D. Kalinowski, “Co-evolutionary algorithm solving multi-skill resource-constrained project scheduling problem,” in Proceedings of the Federated Conference on Computer Science and Information Systems, pp. 75–82, 2017. View at: Google Scholar
  51. F. S. Alanzi, K. Alzame, and A. Allahverdi, “Weighted multi-skill resources project scheduling,” Communications & Network, vol. 03, pp. 1125–1130, 2010. View at: Google Scholar
  52. M. A. Santos and A. P. Tereso, “On the multi-mode, multi-skill resource constrained project scheduling problem - a software application,” Advances in Intelligent and Soft Computing, vol. 96, pp. 239–248, 2011. View at: Publisher Site | Google Scholar
  53. H.-Y. Zheng, L. Wang, and X.-L. Zheng, “Teaching–learning-based optimization algorithm for multi-skill resource constrained project scheduling problem,” Soft Computing, vol. 21, no. 6, pp. 1537–1548, 2017. View at: Publisher Site | Google Scholar
  54. H. Dai, W. Cheng, and P. Guo, “An improved tabu search for multi-skill resource-constrained project scheduling problems under step-deterioration,” Arabian Journal for Science and Engineering, vol. 43, no. 6, pp. 3279–3290, 2018. View at: Publisher Site | Google Scholar
  55. X. Lai and J. K. Hao, A Tabu Search Based Memetic Algorithm for The Max-Mean Dispersion Problem, Elsevier Science Ltd., 2016.

Copyright © 2019 Huafeng Dai and Wenming Cheng. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


More related articles

521 Views | 252 Downloads | 0 Citations
 PDF  Download Citation  Citation
 Download other formatsMore
 Order printed copiesOrder

Related articles

We are committed to sharing findings related to COVID-19 as quickly and safely as possible. Any author submitting a COVID-19 paper should notify us at help@hindawi.com to ensure their research is fast-tracked and made available on a preprint server as soon as possible. We will be providing unlimited waivers of publication charges for accepted articles related to COVID-19. Sign up here as a reviewer to help fast-track new submissions.