In this work we present a metaheuristic method based on tabu search for solving the permutation flow shop scheduling problem with sequence dependent setup times, with the objective of minimizing total weighted tardiness. The problem is well known for its practical applications and for the difficulty in obtaining good solutions. The tabu search method proposed is based on the insertion neighborh...

In this paper, we address a new integration of column generation and Lagrangian relaxation for solving flowshop scheduling problems to minimize the total weighted tardiness. In the proposed method, the initial columns are generated by using near-optimal dual variables for linear programming relaxation of Dantzig-Wolfe decomposition derived by the Lagrangian relaxation method. The column generat...

We propose a problem space genetic algorithm to solve single machine total weighted tardiness scheduling problems. The proposed algorithm utilizes global and time-dependent local dominance rules to improve the neighborhood structure of the search space. They are also a powerful exploitation (intensifying) tool since the global optimum is one of the local optimum solutions. Furthermore, the prob...

This paper develops a fuzzy multi-objective linear programming (FMOLP) model for solving a multiobjective single-machine scheduling problem. The proposed model attempts to minimize the total weighted tardiness andmakespan simultaneously. In this problem, a proposed FMOLPmethod is applied with respect to the overall acceptable degree of thedecisionmaker (DM) satisfaction. Anumber of numerical ex...

In this paper, a scatter search algorithm with improved component modules is proposed to solve the single machine total weighted tardiness problem with sequence-dependent setup times. For diversification generation module, both random strategy based heuristics and construction heuristic are adopted to generate the diversified population. For improvement module, variable neighborhood search base...

Mixed model assembly lines (MMAL) are a type of production line where a variety of product models similar in product characteristics are assembled. The effective design of these lines requires that schedule for assembling the different products is determined. In this paper we tried to fit the sequencing problem with the main characteristics of make to order (MTO) environment. The problem solved...

The Apparent Tardiness Cost (ATC) heuristic is one of the best performing dispatch rules for the weighted tardiness scheduling problem. This heuristic uses a lookahead parameter whose value must be specified. In this paper we develop a function that maps some instance statistics into an appropriate value for the lookahead parameter. This function is compared with some fixed values that have bee...

This report details a set of benchmark problem instances that we have generated for the weighted tardiness scheduling with sequence-dependent setups problem. The version of the problem without setup times is NP-Hard. The problem is further complicated by the sequence-dependent nature of the setups. Given that the weighted tardiness objective and the sequence-dependent setups constraint are both...

In this paper intelligent search technique of variable structure learning automata (VSLA) has been used to solve single machine total weighted tardiness job scheduling problem. The goal is investigating reduction in delays result in late execution of the jobs after specified deadline as well as reducing the time required to find the best execution order of the jobs. For this reason, fixed struc...

Quality control lead times are one of most significant causes of loss of time in the pharmaceutical and cosmetics industries. This is partly due to the organization of laboratories that feature parallel multipurpose machines for chromatographic analyses. The testing process requires long setup times and operators are needed to launch the process. The various controls are non-preemptive and are ...