This paper explores the flexile flow lines where setup times are sequence- dependent. The optimization criterion is the minimization of total weighted completion time. We propose an iterated greedy algorithm (IGA) to tackle the problem. An experimental evaluation is conducted to evaluate the proposed algorithm and, then, the obtained results of IGA are compared against those of some other exist...

This paper considers single-machine position-dependent weights scheduling problem with past-sequence-dependent delivery times and truncated sum-of-processing-times-based learning effect. The objective is to minimize the weighted sum of due date, number early jobs tardy jobs, where are weights. Under common slack date different assignments, optimal properties given, corresponding solution algori...

in this study, given the sequence dependent setup times, we attempt using the technique of response surface methodology (rsm) to set the parameters of the genetic algorithm (ga), which is used to optimize the scheduling problem of n job on 1 machine (n/1). it aims at finding the most suitable parameters for increasing the efficiency of the proposed algorithm. at first, a central composite desig...

we propose a wavelet based stochastic regression function estimator for the estimation of the regression function for a sequence of pairwise negative quadrant dependent random variables with a common one-dimensional probability density function. some asymptotic properties of the proposed estimator are investigated. it is found that the estimators have similar properties to their counterparts st...