Abstract
This paper studies the order acceptance and scheduling problem on unrelated parallel machines with machine eligibility constraints. Two objectives are considered to maximize total net profit and minimize the makespan, and the mathematical model of this problem is formulated as multiobjective mixed integer linear programming. Some properties with respect to the objectives are analysed, and then a classic list scheduling (LS) rule named the first available machine rule is extended, and three new LS rules are presented, which focus on the maximization of the net profit, the minimization of the makespan, and the tradeoff between the two objectives, respectively. Furthermore, a listschedulingbased multiobjective parthenogenetic algorithm (LSMPGA) is presented with parthenogenetic operators and Paretoranking and selection method. Computational experiments on randomly generated instances are carried out to assess the effectiveness and efficiency of the four LS rules under the framework of LSMPGA and discuss their application environments. Results demonstrate that the performance of the LSMPGA developed for tradeoff is superior to the other three algorithms.
1. Introduction
In recent decades, the topic of order acceptance and scheduling (OAS) has attract considerable attention from scheduling researchers and production managers who practice it. The key issue of OAS is to make a joint decision of which orders are accepted (order acceptance decision) and how to schedule them (scheduling decision). Therefore, OAS is essentially different from traditional scheduling problem in which all jobs must be accepted, because the latter is just a special case of it. In OAS, a job has two options, to be accepted or rejected; thus the solution space can be up to times of that of traditional scheduling problem, where is the number of orders.
Unrelated parallel machine environment is a common workshop where processing times of orders are machine dependent. In traditional OAS on unrelated parallel machines, it is usually assumed that orders are able to be processed on any machines. However, in reality, especially in the assemble lines with multivariety production, one machine is only eligible to process specified orders, which is called the machine eligibility constraint. Recently, some scholars have considered this constraint in the unrelated parallel machine scheduling models (see [1–3]). Moreover, in the assemble line with machine eligibility constraints, processing technologies used in machines are different; thus production costs of one order on different machines are often different and do not depend on the processing times. That is, an order on an eligible machine may have short processing time but high production cost, due to the skilled but not advanced processing technology. Therefore, order assignments on machines affect not only the productivity but also the profit.
This paper studies OAS on unrelated parallel machines with machine eligibility constraints (referred to as OASME). Two objectives are considered. One is to maximize the total net profit with respect to the revenue, tardiness cost, and production cost. The other is to minimize the makespan, which is a classic scheduling criterion with respect to the productivity. Note that the two objectives are conflicting. The makespan is the completion time of the last finished orders; thus the solution with minimum makespan usually does not have the minimum total tardiness, let alone the minimum total tardiness cost (namely, total weighted tardiness). Moreover, because production cost is independent of the processing time, the minimum makespan does not imply minimal total production cost. Therefore, minimizing the makespan does not mean minimizing the total net profit, and vice versa.
As shown in Section 3.1, OASME is NPhard; thus this paper presents four list scheduling (LS) rules and then develops a listschedulingbased multiobjective parthenogenetic algorithm (LSMPGA). The contributions of this paper are in the following areas: (a) for the OASME, analyse some properties with respect to the objective of total net profit; (b) extend a classic LS rule with the consideration of the net profit, and present three new LS rules according to problem characteristics; (c) propose a LSbased algorithm (named LSMPGA) with parthenogenetic operators and Paretoranking and selection method; (d) suggest application environments of the four LS rules under the framework of LSMPGA through computational studies. The rest of this paper is organized as follows. Section 2 reviews the related works. Section 3 models the problem OASME and analyses some properties. Section 4 proposes four LS rules and Section 5 presents the LSMPGA. Experimental research in Section 6 inspects performance of these LS rules under the framework of LSMPGA. Finally, Section 7 concludes the paper.
2. Literature Review
This paper considers an OAS problem on unrelated parallel machines with binary objectives. In the following, we will review the works related to the OAS on parallel machines and multiobjective unrelated parallel machine scheduling algorithms.
By now, extensive studies on OAS have been conducted in the production scheduling literature, and Slotnick [4] provided a comprehensive literature review on it. For parallel machine environment, there are some new studies presented after the review [4]. Wang et al. [5] studied the problem with two identical parallel machines and developed two heuristics and an exact algorithm based on optimal properties and the Lagrangian relaxation technique. Emami et al. [6] considered nonidentical parallel machine environment in which the revenue from an accepted order and processing times are uncertain and developed a Lagrangian relaxation algorithm. Moreover, a series of related papers treat OAS from the perspective of order rejection, and a comprehensive survey was made by Shabtay et al. [7]. For the unrelated parallel machine scheduling with rejection, the new studies after the survey [7] are reviewed as follows. Hsu and Chang [8] studied the problem with deteriorating jobs to minimize of the sum of total rejection cost and a scheduling criterion and proved that if the scheduling criterion is either total load or total completion time, the problem is solvable in polynomial time. Lin et al. [9] presented a deterministic 3approximation algorithm and a randomized 3approximation algorithm for two unrelated parallel machine scheduling problem with rejection. Jiang and Tan [10] presented a heuristic with worstcase ratio of 2 for an unrelated parallel machine scheduling with rejection and nonsimultaneous machine available time to minimize the sum of the makespan and total rejection cost. Above studies, including literature on unrelated parallel machines in the two survey papers, mostly employed the a priori optimization approach to sum objectives as an aggregated function, which cannot provide Paretooptimal solutions for tradeoff. Moreover, to the best of our knowledge, the machine eligibility constraint and timeindependent production cost in our problem have not been considered in OAS previously in the literature.
Our problem is an extension of multiobjective unrelated parallel machine scheduling problem. Paretobased metaheuristic is an effective approach for the multiobjective scheduling problem [11]. For the unrelated parallel machine environment, Lin et al. [12] proposed two heuristics and a Paretobased genetic algorithm for unrelated parallel machine scheduling problem to minimize the makespan, total weighted completion time, and total weighted tardiness. Lin and Ying [13] presented a multiobjective multipoint simulated annealing (MOMSA) algorithm and Lin et al. [14] proposed a Tabuenhanced iterated Pareto greedy algorithm for the same problem. Afzalirad and Rezaeian [15] studied the unrelated parallel machine scheduling problem with sequencedependent setup times, release times, machine eligibility, and precedence constraints to minimize mean weighted flow time and mean weighted tardiness and improved two classic Paretobased algorithms, NSGAII and MOACO. Above literature indicates that Paretobased metaheuristic is an effect approach for multiobjective scheduling problem on unrelated parallel machines.
3. Problem Modelling and Analysis
3.1. Problem Model
OASME can be formally described as follows. Given a set of nonpreemptive orders and a set of unrelated parallel machines, this problem is to decide which orders should be accepted and how to schedule them. Each accepted order must be processed on one machine, and rejected orders are not allowed to be processed. Each machine can process at most one order at a time. Moreover, each order can only be processed on specific machines (machine eligibility constraints), and processing times and production costs of an order on the eligible machines are different from each other. Two objectives are considered. One is to maximize the total net profit, which is equal to revenues minus the sum of production costs and tardiness costs of accepted orders. The other is to minimize the makespan.
For convenience, following notations are introduced.
(a) Indexes and Sets : order index; : the number of orders; : the order with index . : machine index; : the number of machines; : the machine with index . : the set of machines which are eligible to process . .
(b) Problem Parameters , : production cost and processing time of on , respectively. , , : revenue, due date, and unit tardiness cost of , respectively. : a very large positive number.
(c) Decision Variables : binary variable for order acceptance decision. If , is accepted, otherwise, rejected. : binary variable representing whether is the th processed order on () or not (). : nonnegative continuous variable representing the completion time of .
(d) Objective Parameters , : the net profit and tardiness of , respectively. , : total net profit and the makespan, respectively.
Mathematical model for the OASME can be formulated as a multiobjective mixed integer linear programming (MILP) as follows.
Objective (1) is to maximize the sum of net profits (revenue minus tardiness cost and production cost) of all accepted orders. Objective (2) is to minimize the makespan.
Constraints (3) restrict the relationship between variables and . If is rejected , it cannot be scheduled on any machine; otherwise, namely, is accepted , it must be processed on one and only one position of a machine. Constraints (4) present a position arrangement rule that if one position of a machine is free (), its succeeding positions are no longer assigned to any orders as well (). Constraints (5) indicate that each machine can process at most one order at a time. Constraints (3), (4), and (5) work together to restrict a feasible order sequence on a machine. Constraints (6) make sure that the completion time of any accepted order is no less than its processing time. Constraints (7) and (8) define the tardiness, and Constraints (9) define the makespan. Constraints (10) are machine eligibility constraints where an order is not allowed to be processed on an ineligible machine. Constraints (11) are binary constraints for and .
Scheduling decision in OASME has a special case. While , OASME is equivalent to the identical parallel machine scheduling with machine eligibility constraints. Liao and Sheen [16] indicate that the latter problem to minimize the makespan is NPhard; thus OASME is NPhard as well.
3.2. Objective Analysis
For the objective of total net profit, Theorem 1 holds.
Theorem 1. If there is at least one accepted order with a negative net profit, the solution is certainly not optimal.
Proof. Denote this solution by and its total net profit and the makespan by and , respectively. Let the set include all the orders with negative net profits in . By rejecting the orders in , we can get a solution named with two objectives and .
First, consider the total net profits of and . For the orders in , their net profits in (which are equal to zero) are greater than those in (which are negative). For the accepted orders which are not in , their tardiness in must not be greater than those in ; thus their net profits in are not smaller than those in . Therefore, .
Second, consider the makespan of and . Rejecting an order will not increase the completion time of other accepted orders; thus .
Since and , the solution is dominated by ; thus is certainly not optimal.
Based on Theorem 1, we can get following corollaries.
Corollary 2. The solution in which all orders are rejected is an extreme optimal solution with and .
Corollary 3. If an order satisfies , then in any optimal solution, it must be rejected; otherwise, if , and is accepted in an optimal solution, then there must exist an optimal solution in which is rejected.
For those orders that will surely be rejected in optimal solutions, they can be rejected in advance; therefore, according to Corollary 3, the following rule is set for preliminary rejection decision.
Rule 1. If , then reject .
Moreover, from Theorem 1 and Corollary 3, we can get the following theorem that gives the upper and lower bounds of the total net profits in optimal solutions. This theorem provides the basis for the design of the scheduling rule named IFH in Section 4.5 (see Section 4.5.1).
Theorem 4. Denote the total net profit in an optimal solution as ; then
Proof. For an order satisfying , ideal condition of its net profit is to schedule to the machine with the minimal production cost, and this assignment will not cause tardiness, namely, . According to Theorem 1, the worst condition is to reject ; then the net profit is 0, namely, . Therefore, if , then ; otherwise, according to Corollary 3, ; thus ; then Theorem 4 holds.
4. List Scheduling Rules
4.1. Motivation and Algorithm Overview
As aforementioned, OASME is a joint decision of order acceptance and order scheduling. In the problem model in Section 3.1, the variables correspond to the order acceptance decision, and the variables and correspond to the order assignment subdecision and completion time subdecision of scheduling decision, respectively. According to Constraints (5) and (6), while and are determined, completion times can be calculated by (13). Therefore, the key to solve OASME is how to find the optimal values of variables and .
OASME is a NPhard multiobjective combinatorial optimization problem, where it is practically impossible to find an optimal solution in polynomial time. For this kind of problem, constructive heuristics and metaheuristics are effective in producing good solutions in a short time. For parallel machine scheduling problem, list scheduling (LS) is a classic constructive heuristic which provides an assignment rule to schedule orders one by one in a specific order list [17]. In this section, we introduce the order acceptance decision to a classic LS rule in Section 4.2 and present three new LS rules in Sections 4.3–4.5, which can make the order acceptance decision and order assignment decision simultaneously.
Unlike the traditional LS rules which are only for scheduling problem, these LS rules for OASME make one of the following decisions for an order :
Reject ; then the variables and are all assigned as 0.
Accept , assign it to a machine , and insert it at the end of the order sequence on . Suppose is the th order scheduled to ; then , , and where , and where .
Hereinafter, the above two decisions are briefly described as “reject ” and “schedule to ” in the LS rules. The calculation of the variables , , and corresponding to each decision has been described in detail herein, therefore not further described in the subsections.
For ease of algorithm description, some notations are defined. : available time of , which is equal to the total processing time of scheduled orders on ; , : the net profit and completion time of while it is scheduled to , respectively; : the makespan of scheduled jobs ; : the makespan of partial schedule in which is scheduled to .
4.2. Extended FAM (EFAM)
One of the most popular LS rules is the first available machine (FAM) rule, which schedules the next job of the list on a machine which is available first [17]. We develop an extended FAM (EFAM) for OASME, in which order rejection decision is complemented and machine eligibility constraint is considered.
According to Theorem 1, while scheduling , EFAM first creates a candidate set of machines (). contains the eligible machines which produce positive net profit for (14). EFAM then defines Rule 2 to reject or select a machine for it.
Rule 2. If , then reject ; otherwise, schedule to where .
In EFAM, for one order, creating the candidate set and selecting the first available machine both take . There are orders; thus the complexity of EFAM is .
4.3. Highest Profit First (HPF)
This subsection presents a LS rule named highest profit first (HPF) rule, which prefers solutions with high net profit. HPF first finds a machine satisfying (15) and then calls Rule 3.
Rule 3. If , then reject ; otherwise, schedule to .
HPF finds for an order in ; thus its time complexity is .
4.4. Smallest Makespan First (SMF)
Besides total net profit, OASME has the other objective, the makespan. This subsection presents a smallest makespan first (SMF) rule. SMF schedule to the machine with the minimal completion time of if is accepted, and the difficulty to develop SMF is how to determine whether to accept . Here the criterion of EFAM is adopted, namely, if none of the machines can make a positive net profit for the considered order; then reject this order. Therefore, In SMF, the candidate set is first created by (14); then Rule 6 is employed. Time complexity of SMF is .
Rule 4. If , then reject ; otherwise, schedule to , where
4.5. IntegratedFunctionBased Rule (IFH)
Above LS rules either extend an existing heuristic, or only focus on one objective, which do not take into account the balance of two objectives. This subsection presents a LS rule to tradeoff total net profit and the makespan, which is formalized as Rule 5.
Rule 5. If , then reject ; otherwise, schedule to , whereIn (17), and are the functions reflecting the influence of assigning an order on the net profit and the makespan, and and are the weights of and , respectively. and should satisfy two requirements: (a) Minimizing and represents the same effect trend of optimization; (b) and should be on the same order of magnitude. The following gives the ideas to design these functions.
4.5.1. Function with respect to the Net Profit
For the net profit of (), according to Theorem 4, Proposition 5 holds.
Proposition 5. , where .
Therefore, is defined by (18), in which , and a small corresponds to a high net profit of .
4.5.2. Function with respect to the Makespan
For the makespan of partial schedule (), Proposition 6 holds.
Proposition 6. .
Proof. If is rejected, then . If is accepted and scheduled to , then , and the worst condition is to schedule to the machine with the latest available time and the longest processing time, that is, . Therefore, Proposition 6 holds.
Therefore, (19) defines which belongs to . Clearly, small represents a small makespan of .
4.5.3. Time Complexity of IFH
In IFH, for each order , to calculate and , and should be found at first, which takes . Therefore, finding for takes , and time complexity of IFH is .
5. Multiobjective Parthenogenetic Algorithm
List scheduling supposes that the order list has been already specified; thus the difficulty of using this method is how to determine a good order list. Genetic algorithm (GA) is a popular approach to produce nearoptimal solutions with flexible encoding scheme and genetic operators, and parthenogenetic algorithm (PGA) is an improved GA which is suitable for combinatorial optimization [18]; thus this paper employs PGA with LS rules to produce order lists and then generate solutions for OASME. This algorithm is named LSbased multiobjective PGA (LSMPGA), and its key points are elaborated in the following subsections.
5.1. Chromosome Encoding and Initialization
A chromosome in LSMPGA corresponds to an order list; that is, it contains genes which are all different, and otherwise this chromosome is invalid.
In population initialization process, LSMPGA randomly generates chromosomes (order lists) to maintain diversity, where is the population size.
5.2. Parthenogenetic Operators
A chromosome in LSMPGA is a permutation in which all genes should be different. Traditional GA has two genetic operators as crossover and mutation, which both have a difficulty in maintaining validity of a permutation chromosome. Parthenogenetic algorithm (PGA) is an improved GA proposed by Li and Tong [19], in which each chromosome has only one parent [20]. In PGA, gene recombination operators are presented as a parthenogenesis approach instead of crossover, and it can guarantee the validity of the offspring for the chromosomes encoded as permutation. There are three types of gene recombination operators: gene shift operator, gene exchange operator, and gene inverse operators, which are employed in LSMPGA.
(a) Gene shift operator evolves chromosomes by an insertion process with probability . It inserts the gene in position into position , where .
(b) Gene exchange operator implements a swap process with probability . This operator swaps the genes in positions and , where .
(c) Gene inverse operator is a reversion process with probability . This operator reverses sequence of genes between position and , where .
Figure 1 illustrates examples of these operators, in which a parent evolves offspring chromosomes by these operators with and .
(a) Gene shift operator
(b) Gene exchange operator
(c) Gene inverse operator
One issue of parthenogenetic operation is how to compose these genetic operators. Insertion and swap are two of the most widely used neighbourhood structures in scheduling [21, 22]; thus, to keep a pure insertion or swap operation, gene shift operator and gene exchange operator are totally executed at most once in one genetic operation. Furthermore, to maintain the diversity, if neither gene shift operator nor gene exchange operator is executed, gene inverse operator must be applied. These considerations are formalized into following parthenogenetic rules, where a, b, and are random numbers within the range of .
Rule 6. If , then call gene shift operator( ).
Rule 7. If , then call gene exchange operator( ).
Rule 8. If , then call geneinverseoperator( ).
5.3. ParetoRanking and Selection
OASME is a multiobjective optimization, and Paretooptimal solutions are practical when considering reallife problems since the final solution of the decisionmaker is always a tradeoff. There have been many effective multiobjective GAs to approximate the true Pareto points, and a classic one is the fast nondominated sorting genetic algorithm (NSGAII) proposed by Deb et al. [23]. NSGAII does not need external archive to store discovered nondominated solutions and has high efficiency and low space complexity [24]; thus its ranking and selection approach is applied to LSMPGA.
5.4. Procedure of LSMPGA
LSMPGA is terminated when the generation reaches the specified maximal generation . Main procedure of LSMPGA is shown in Procedure 1.

The advantage of LSMPGA can be explained based on three points. The first is the simple chromosome encoding scheme with only genes due to the utility of LS rule. Second, LSMPGA employs parthenogenetic operators to effectively avoid reproducing invalid offspring. Last, LSMPGA can provide a variety of nondominated solutions by Paretoranking and selection method.
6. Computational Experiments
This section conducts an experimental study to evaluate the performance of proposed LS rules under the framework of LSMPGA (referred to as EFAMMPGA, HPFMPGA, SMFMPGA, and IFHMPGA, respectively). Algorithms in this section are all coded in C# language and implemented on a computer with Intel Core i56300U/CPU 2.40 GHz 2.50 GHz and RAM 8.00 GB.
6.1. Comparison Algorithm and Parameter Settings
As mentioned in Section 5.3, NSGAII is a classic and effective multiobjective GA [24]; thus we use it as a benchmark algorithm throughout this section. In NSGAII, the encoding scheme and genetic operators are problemrelated, which are described in detail as follows.
(a) Encoding Scheme. OASME is a joint decision problem; thus a chromosome in NSGAII contains genes, which are divided into two subsets to make the order acceptance and order scheduling decisions simultaneously. Subset corresponds to an order list, where gene is the index of th scheduled order. Subset determines the accepted orders and their processing machines. Based on the idea proposed by Shabtay et al. [7], if , then reject order ; otherwise, schedule order to machine .
(b) Genetic Operators. The two subsets in a chromosome are restricted by different constraints; thus NSGAII employs different genetic operators for them. Subset is a permutation which requires values of all genes to be different; then the onepoint crossover and swap mutation are adopted [1]. Subset is encoded by mutually independent positive integers, and it is evolved by the traditional crossover and mutation operators.
By extensive preliminary experimentations, parameters of LSMPGAs are set as and . Set and for IFHMPGA. The crossover and mutation probabilities in NSGAII are 0.9 and 1/, respectively [23]. In all the LSMPGAs and NSGAII, the maximal generation , and the size of population if ; otherwise, set .
A number of test instances are generated with the following parameter setting. Let represent a discrete uniform distribution with a range from to . Processing time is generated from , where . Revenue, production cost, unit tardiness cost, and due date are generated from , , , and , respectively.
Problem sizes of test instances are set as and ; and ; and . According to the problem size, this set of experiments are divided into 28 groups, and 50 instances are generated randomly for each group. So there are instances in total.
To measure the quality of obtained Pareto front, we adopt the metrics and presented by Deb et al. [23].
Metric measures the extent of convergence to reference Pareto front (20). In (20), is the number of obtained Pareto front by algorithm , and is the Euclidean distance between member in and its nearest member in . Small means a good convergence.
Metric measures the maintenance of diversity (21). In (21), and are the Euclidean distances between the extreme solutions of and the boundary solutions of , is the Euclidean distance between consecutive solutions of , and is the average of all . Algorithm with better diversity has a smaller .
These metrics both contain a reference Pareto front set , which normally consists of the true Pareto front. However, true Pareto front is unknown for our problem because of its NPhardness. To find a that is approximate the true Pareto front, we analyse the respective bound of the two objectives as follows. For OASME, if accepted orders are confirmed, the upper bound of the net profit can be calculated by (22) according to Theorem 4 and the lower bound of the makespan by (23) [25]. The two bounds can form a point in the solution space as , hereinafter referred as to the boundpoint of an order acceptance solution.
Obviously, boundpoints of all order acceptance solutions can construct an outer boundary line of the true Pareto front. However, it is hard to exhaustively list all order acceptance solutions in polynomial time, because for an OASME with orders, the number of order acceptance solutions is 2^{n}, which is an exponential function of the problem size. In order to obtain a reference Pareto front set in a reasonable time, we present a boundbased approach as follows. First, extract the nondominated solutions from all solutions found by the four LSMPGAs and NSGAII; then, calculate the boundpoints of these nondominated solutions; at last, add the boundpoints which are not dominated by the other boundpoints to . Essentially, the boundbased approach produces a consisting of nondominated boundpoints for the solutions found by the four LSMPGAs and NSGAII.
6.2. Numerical Results and Analysis
Means (Avg.) and standard deviations (Std.) of the two metrics and for 28 test groups are listed in Tables 1 and 2, respectively.
Results in Table 1 reveal that, in terms of the average value of , IFHMPGA is the best, followed by SMFMPGA, and the four LSMPGAs are all significantly better than NSGAII. It indicates the effectiveness of the framework of LSMPGA. Moreover, the values of obtained by IFHMPGA, SMFMPGA, and EFAMMPGA are small. The minimal values obtained by IFHMPGA, SMFMPGA and EFAMMPGA are 0.91%, 0.63% and 0.73%, respectively. It implies the good convergence of the three algorithms which can produce the solutions that are close to the boundpoints.
It can be observed from Table 1 that, with the increase of , the values of by all the algorithms increase obviously, while the growth of those by IFHMPGA is the slowest. In addition, for the instances with small , such as those with and , and , and , and and , values of obtained by SMFMPGA are much better (lower) than those of other LSMPGAs. For the instances with large , values of obtained by IFHMPGA are significantly better than those of other algorithms.
Experimental results in Table 2 show that the best (smallest) values of are often obtained by HPFMPGA, followed by IFHMPGA. HPFMPGA produced the best values of for the instances with large number of orders (), and IFHMPGA for those with small . There is no significant difference between EFAMMPGA and SMFMGPA, which are both worse than the above two algorithms but better than NSGAII on average. Average objective values of the boundary solutions with maximal net profit obtained by the five algorithms are further collected in Table 3, and solution distributions of two randomly generated instances are shown in Figure 2. The following characteristics of these algorithms are observed from these data.
(a) Solutions for an instance with
(b) Solutions for an instance with
(a) The minimal makespan is often obtained by SMFMPGA (Figure 2), and the maximal total net profit is often obtained by HPFMPGA (Table 3 and Figure 2). (b) Through statistics of Table 3, deviations of total net profit obtained by EFAM/SMF/HPFMPGA/NSGAII to those by HPFMPGA are 2.78%, 2.70%, 1.10%, and 4.10%, respectively, and deviations of the makespan are 37.98%, 39.04%, 31.79%, and 9.87%, respectively. It implies that boundary solutions of HPFMPGA usually have better net profit than those of other algorithms but with much larger makespan. (c) In Figure 2 and Table 3, most of the nondominated solutions and boundary solutions produced by NSGAII are dominated by the four LSMPGAs, again demonstrating that the proposed LSMPGA framework and LS rules are effective.
To measure the algorithm efficiency, Table 4 collects the average CPU times for all instances and for the instances with three problem sizes , , and . Note that the population size for the problem size is twice that for and ; thus these algorithms take much longer time to solve the former instances. Results indicate that, in terms of computational time, TGA, SMFMPGA, HPFMOGA, and EFAMMPGA are very similar and very short, while IFHMPGA is the longest one. However, for the instances with the largest problem size , the least efficient algorithm IFHMPGA with and can be terminated in 16 s, which means that the average computational time of one generation is just 0.064 s. It indicates that all these algorithms can produce solutions in a reasonable time.
6.3. Application Environments of These Algorithms
The above experimental results indicate that the performance of LSMPGAs is much better than that of NSGAII. According to these results, the application environments of the four LSMPGA algorithms are suggested as follows.
(a) If a decisionmaker prefers the objective of total net profit, HPFMPGA is a good choice. However, HPFMPGA has two significant drawbacks: its convergence is the worst and the obtained makespan is much larger than those of other algorithms.
(b) If a decisionmaker prefers the objective of the makespan, they can adopt SMFMPGA or EFAMMPGA. In particular, SMFMPGA can achieve the best convergence for the instances with small number of machines. The drawback of the two algorithms is the difficulty to produce a solution with high total net profit.
(c) If a decisionmaker would like to find some tradeoff solutions, especially for the instances with large number of machines, IFHMPGA is the best. In terms of convergence, IFHMPGA is able to produce the lowest value of for most of instances, especially for those with large . In terms of the maintenance of diversity, the value of is just behind HPFMPGA. Therefore, the overall performance of IFHMPGA is superior to the other rules.
7. Conclusions
This paper studied the order acceptance and scheduling problem on unrelated parallel machines with machine eligibility constraints (OASME), which is a NPhard problem. Two objectives are considered as total net profit and the makespan. This paper analyses some properties of the objectives and presents four list scheduling rules named EFAM, HPF, SMF, and IFH. EFAM extends the classic first available machine (FAM) rule. HPF and SMF are the heuristics mainly designed for one objective as total net profit and the makespan, respectively. IFH presents an integrated function to balance the two objectives. Time complexities of these rules are all . Based on the list scheduling method, we develop a multiobjective parthenogenetic algorithm (LSMPGA) with parthenogenetic operators and Paretoranking and selection method. Computational experiments compared the performances of the four LS rules under the framework of LSMPGA, analysed their strengths and shortcomings and suggested their application environments.
Conflicts of Interest
The authors declare that there are no conflicts of interest regarding the publication of this paper.
Acknowledgments
This work was supported by the Humanity and Social Science Youth Foundation of Ministry of Education of China (no. 17YJC630143), the National Natural Science Foundation of China (nos. 71701016 and 71471015), the Beijing Natural Science Foundation (no. 9174038), and the Fundamental Research Funds for the Central Universities (no. FRFBD16006A).