this paper considers a two-stage assembly flow shop problem (tafsp) where m machines are in the first stage and an assembly machine is in the second stage. the objective is to minimize a weighted sum of earliness and tardiness time for n available jobs. jit seeks to identify and eliminate waste components including over production, waiting time, transportation, inventory, movement and defective...

During the manufacturing process in a steel mill, the chemical composition and quality of raw-iron, steel and slack has to be checked several times. The organization of the corresponding list of operations can be classified as a hybrid flow shop scheduling problem with jobs arriving over time and the objective is to minimize the total weighted completion time. Since this problem is known to be ...

Job-shop scheduling problem (JSP) is one of the most well-known machine scheduling problems and one of the strongly NP-hard combinatorial optimization problems. Cost optimization is an attractive and critical research and development area for both academic and industrial societies. This paper presents a cost driven model of the job-shop scheduling problem in which the solutions are driven by bu...

The reentrant hybrid flow shop for a heat treatment process is considered in this study. We consider job scheduling in a reentrant hybrid flow shop problem that consists of two statges in series. The first stage is washing, followed by heat treating in the second stage. Each job passes through the first and second stages, respectively, and then re-enter the first stage one more time. Since the ...

Considering the standard particle swarm optimization (PSO) has the shortcomings of low convergence precision in job shop scheduling problems, the job shop scheduling solution is presented based on improved particle swarm optimization (A-PSO). In this paper, the basic theory of A-PSO is described. Also, the coding and the selection of parameters as well as the decoding of A-PSO are studied. It u...