The Experts below are selected from a list of 80046 Experts worldwide ranked by ideXlab platform
Chengbin Chu - One of the best experts on this subject based on the ideXlab platform.
-
Service-oriented robust Parallel Machine scheduling
International Journal of Production Research, 2019Co-Authors: Ming Liu, Xin Liu, Feng Chu, Feifeng Zheng, Chengbin ChuAbstract:Stochastic scheduling optimisation is a hot and challenging research topic with wide applications. Most existing works on stochastic Parallel Machine scheduling address uncertain processing time, and assume that its probability distribution is known or can be correctly estimated. This paper investigates a stochastic Parallel Machine scheduling problem, and assumes that only the mean and covariance matrix of the processing times are known, due to the lack of historical data. The objective is to maximise the service level, which measures the probability of all jobs jointly completed before or at their due dates. For the problem, a new distributionally robust formulation is proposed, and two model-based approaches are developed: (1) a sample average approximation method is adapted, (2) a hierarchical approach based on mixed integer second-order cone programming (MI-SOCP) formulation is designed. To evaluate and compare the performance of the two approaches, randomly generated instances are tested. Computational results show that our proposed MI-SOCP-based hierarchical approach can obtain higher solution quality with less computational effect.
-
Parallel Machine scheduling to minimize total tardiness
International Journal of Production Economics, 2002Co-Authors: Farouk Yalaoui, Chengbin ChuAbstract:This paper addresses, using an exact method, the identical Parallel Machine scheduling problem to minimize total tardiness. In this problem, a set of jobs has to be scheduled, without preemption, on identical Parallel Machines. Each Machine is able to treat only one job at a time. In order to prune the search tree, dominance properties are proved and lower and upper bounding schemes are proposed. A branch and bound (BAB) algorithm is developed taking into account these theoretical properties, lower and upper bounds. This BAB algorithm has been tested on a large set of randomly generated medium-sized problems. Computational results demonstrate the effectiveness of our approach over existing methods in the literature.
Darli Yang - One of the best experts on this subject based on the ideXlab platform.
-
unrelated Parallel Machine scheduling with rate modifying activities to minimize the total completion time
Information Sciences, 2011Co-Authors: T.c.e. Cheng, Darli YangAbstract:Zhao et al. (2009) [24] study the m identical Parallel-Machine scheduling problem with rate-modifying activities to minimize the total completion time. They show that the problem can be solved in O(n^2^m^+^3) time. In this study we extend the scheduling environment to the unrelated Parallel-Machine setting and present a more efficient algorithm to solve the extended problem. For the cases where the rate-modifying rate is (i) larger than 0 and not larger than 1, and (ii) larger than 0, we show that the problem can be solved in O(n^m^+^3) and O(n^2^m^+^2) time, respectively.
T.c.e. Cheng - One of the best experts on this subject based on the ideXlab platform.
-
multitasking Parallel Machine scheduling with Machine dependent slack due window assignment
International Journal of Production Research, 2019Co-Authors: Wenya Zhang, T.c.e. Cheng, Lijuan Liao, Yuanyuan TanAbstract:We consider the problem of Parallel-Machine scheduling with Machine-dependent slack (SLK) due-window assignment in the multitasking environment, which exists in various application domains such as ...
-
unrelated Parallel Machine scheduling with rate modifying activities to minimize the total completion time
Information Sciences, 2011Co-Authors: T.c.e. Cheng, Darli YangAbstract:Zhao et al. (2009) [24] study the m identical Parallel-Machine scheduling problem with rate-modifying activities to minimize the total completion time. They show that the problem can be solved in O(n^2^m^+^3) time. In this study we extend the scheduling environment to the unrelated Parallel-Machine setting and present a more efficient algorithm to solve the extended problem. For the cases where the rate-modifying rate is (i) larger than 0 and not larger than 1, and (ii) larger than 0, we show that the problem can be solved in O(n^m^+^3) and O(n^2^m^+^2) time, respectively.
Ruben Ruiz - One of the best experts on this subject based on the ideXlab platform.
-
iterated greedy local search methods for unrelated Parallel Machine scheduling
European Journal of Operational Research, 2010Co-Authors: Luis Fanjulpeyro, Ruben RuizAbstract:This work deals with the Parallel Machine scheduling problem which consists in the assignment of n jobs on m Parallel Machines. The most general variant of this problem is when the processing time depends on the Machine to which each job is assigned to. This case is known as the unrelated Parallel Machine problem. Similarly to most of the literature, this paper deals with the minimization of the maximum completion time of the jobs, commonly referred to as makespan (Cmax). Many algorithms and methods have been proposed for this hard combinatorial problem, including several highly sophisticated procedures. By contrast, in this paper we propose a set of simple iterated greedy local search based metaheuristics that produce solutions of very good quality in a very short amount of time. Extensive computational campaigns show that these solutions are, most of the time, better than the current state-of-the-art methodologies by a statistically significant margin.
Wu Yi Chen - One of the best experts on this subject based on the ideXlab platform.
-
Analysis on the Instantaneous Stiffness of the 3-RPS Parallel Machine
Key Engineering Materials, 2009Co-Authors: Xian Guo Han, Xue Liang Cui, Wu Yi ChenAbstract:Based on the screw theory, the force analysis of the 3-RPS Parallel Machine is illuminated. Been equivalent to a 6-chain Parallel Machine, the deformation harmony equation of the Parallel Machine under the outside generalized force is interpreted. The instantaneous stiffness model of the Parallel Machine, which includes the change of the force Jacobian matrix, is established. Considering the deviation of the position and orientation of the moving platform, which is resulted from the distortion of the PRS chains of the Parallel Machine, the influence of the change of the Jacobian matrix to the instantaneous stiffness model of the 3-RPS Parallel Machine is analyzed, and furthermore, it is verified with an instance.
-
Dimensional Designing Study on a Novel 3-RPS Parallel Machine
Key Engineering Materials, 2009Co-Authors: Xue Liang Cui, Xian Guo Han, Wu Yi ChenAbstract:Analysis on the singularity of the 3-RPS Parallel Machine which probably occurs in the engineering application is presented. The influence of the singular configurations in the workspace of the Parallel Machine is interpreted. To improve the orientation capacity of the moving platform, a novel complex spherical joint is designed, however a special singularity namely coaxial singularity is resulted in. By optimizing the dimension parameters and designing a special moving platform, the singularity can be averted in the wanted workspace, and the nutation angle of the Parallel Machine can be enlarged to ±45 degree.
-
Study on the Accuracy of 3-RPS Parallel Machine Tools
Key Engineering Materials, 2009Co-Authors: Jun Xiong, Xian Guo Han, Wu Yi ChenAbstract:According to the inverse solutions of 3-RPS Parallel Machine tools, the mapping relationship between the geometrical errors built on the 3-RPS Parallel Machine tools and errors of out posture has been created, then the error model of direct solutions including all the geometrical parameter errors has been built, and this model can be directly used to analyse the accuracy of Parallel mechanism. On this basis, the algorithm about error compensation has been proposed. Moreover, accuracy synthesis of 3-RPS Parallel Machine tools was made respectively in probabilistic synthesis method and extreme synthesis method, and at last these two methods were compared.
