in some industries as foundries, it is not technically feasible to interrupt a processor between jobs. this restriction gives rise to a scheduling problem called no-idle scheduling. this paper deals with scheduling of no-idle open shops to minimize maximum completion time of jobs, called makespan. the problem is first mathematically formulated by three different mixed integer linear programming...

the multivariate exponentially weighted moving average (mewma) control chart is one of the best statistical control chart that are usually used to detect simultaneous small deviations on the mean of more than one cross-correlated quality characteristics. the economic design of mewma control charts involves solving a combinatorial optimization model that is composed of a nonlinear cost function ...

in today’s competitive transportation systems, passengers search to find traveling agencies that are able to serve them efficiently considering both traveling time and transportation costs. in this paper, we present a new model for the traveling salesman problem with multiple transporters (tspmt). in the proposed model, which is more applicable than the traditional versions, each city has diffe...

  The clustering problem under the criterion of minimum sum of squares is a non-convex and non-linear program, which possesses many locally optimal values, resulting that its solution often falls into these trap and therefore cannot converge to global optima solution. In this paper, an efficient hybrid optimization algorithm is developed for solving this problem, called Tabu-KM. It gathers the ...

A new constraint-driven methodology for the placement of analog IC's is described. Electrical performance speciications are automatically translated into constraints on the layout parasitics. These constraints and the sensitivity information of the circuit are then used to control a Simulated Annealing-based placement algorithm. At each step of the annealing a fast check on performance degradat...

this study aims to deal with a more realistic combined problem of project scheduling and material ordering. the goal is to minimize the total material holding and ordering costs by determining the starting time of activities along with material ordering schedules subject to some constraints. the problem is first mathematically modelled. then a hybrid simulated annealing and genetic algorithm is...

This paper presents a multi-objective Particle Swarm Optimization (PSO) algorithm for worker assignment and mixed-model assembly line balancing problem when task times depend on the worker’s skill level. The objectives of this model are minimization of the number of stations (equivalent to the maximization of the weighted line efficiency), minimization of the weighted smoothness index and minim...

The forward kinematics of the 6-6 leg parallel manipulator is solved using hybrid meta-heuristic techniques in which the simulated annealing algorithm replaces the mutation operator in a genetic algorithm. The results are compared with the standard simulated annealing and genetic algorithm. It shows that the standard simulated annealing algorithm outperforms standard genetic algorithm in terms ...

In this paper, we demonstrate the ease in which an adaptive simulated annealing algorithm can be designed. Specifically, we use the adaptive annealing schedule known as the modified Lam schedule to apply simulated annealing to the weighted tardiness scheduling problem with sequence-dependent setups. The modified Lam annealing schedule adjusts the temperature to track the theoretical optimal rat...

This paper presents a simulated annealing algorithm that based on multiple search neighborhoods to solve a special kind of timetable problem. The new algorithm also can solve those problems that can be solved by local search algorithm. Various experimental results show that the new algorithm can actually give more satisfactory solutions than general simulated annealing algorithm can do.