A hybrid estimation of distribution algorithm(EDA)with iterated greedy(IG) search(EDA-IG) is proposed for solving the unrelated parallel machine scheduling problem with sequence-dependent setup times(UPMSP-SDST). For ...A hybrid estimation of distribution algorithm(EDA)with iterated greedy(IG) search(EDA-IG) is proposed for solving the unrelated parallel machine scheduling problem with sequence-dependent setup times(UPMSP-SDST). For makespan criterion, some properties about neighborhood search operators to avoid invalid search are derived. A probability model based on neighbor relations of jobs is built in the EDA-based exploration phase to generate new solutions by sampling the promising search region. Two types of deconstruction and reconstruction as well as an IG search are designed in the IG-based exploitation phase.Computational complexity of the algorithm is analyzed, and the effect of parameters is investigated by using the Taguchi method of design-of-experiment. Numerical tests on 1640 benchmark instances are carried out. The results and comparisons demonstrate the effectiveness of the EDA-IG. Especially, the bestknown solutions of 531 instances are updated. In addition, the effectiveness of the properties is also demonstrated by numerical comparisons.展开更多
Scheduling problem is a well-known combinatorial optimization problem.An effective improved estimation of distribution algorithm(IEDA) was proposed for minimizing the makespan of the unrelated parallel machine schedul...Scheduling problem is a well-known combinatorial optimization problem.An effective improved estimation of distribution algorithm(IEDA) was proposed for minimizing the makespan of the unrelated parallel machine scheduling problem(UPMSP).Mathematical description was given for the UPMSP.The IEDA which was combined with variable neighborhood search(IEDA_VNS) was proposed to solve the UPMSP in order to improve local search ability.A new encoding method was designed for representing the feasible solutions of the UPMSP.More knowledge of the UPMSP were taken consideration in IEDA_ VNS for probability matrix which was based the processing time matrix.The simulation results show that the proposed IEDA_VNS can solve the problem effectively.展开更多
In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting)...In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting) time, total absolute differences in completion (waiting) times respectively. If the number of machines is fixed, these problems can be solved in time respectively, where m is the number of machines and n is the number of jobs.展开更多
基金supported by the National Science Fund for Distinguished Young Scholars of China(61525304)
文摘A hybrid estimation of distribution algorithm(EDA)with iterated greedy(IG) search(EDA-IG) is proposed for solving the unrelated parallel machine scheduling problem with sequence-dependent setup times(UPMSP-SDST). For makespan criterion, some properties about neighborhood search operators to avoid invalid search are derived. A probability model based on neighbor relations of jobs is built in the EDA-based exploration phase to generate new solutions by sampling the promising search region. Two types of deconstruction and reconstruction as well as an IG search are designed in the IG-based exploitation phase.Computational complexity of the algorithm is analyzed, and the effect of parameters is investigated by using the Taguchi method of design-of-experiment. Numerical tests on 1640 benchmark instances are carried out. The results and comparisons demonstrate the effectiveness of the EDA-IG. Especially, the bestknown solutions of 531 instances are updated. In addition, the effectiveness of the properties is also demonstrated by numerical comparisons.
基金National Natural Science Foundations of China(Nos.61573144,61174040)
文摘Scheduling problem is a well-known combinatorial optimization problem.An effective improved estimation of distribution algorithm(IEDA) was proposed for minimizing the makespan of the unrelated parallel machine scheduling problem(UPMSP).Mathematical description was given for the UPMSP.The IEDA which was combined with variable neighborhood search(IEDA_VNS) was proposed to solve the UPMSP in order to improve local search ability.A new encoding method was designed for representing the feasible solutions of the UPMSP.More knowledge of the UPMSP were taken consideration in IEDA_ VNS for probability matrix which was based the processing time matrix.The simulation results show that the proposed IEDA_VNS can solve the problem effectively.
文摘In this paper, we consider scheduling problems with general truncated job-dependent learning effect on unrelated parallel-machine. The objective functions are to minimize total machine load, total completion (waiting) time, total absolute differences in completion (waiting) times respectively. If the number of machines is fixed, these problems can be solved in time respectively, where m is the number of machines and n is the number of jobs.