This paper presents a simulated genetic algorithm (GA) model of scheduling the flow shop problem with reentrant jobs. The objective of this research is to minimize the weighted tardiness and makespan. The proposed model considers that the jobs with non-identical due dates are processed on the machines in the same order. Furthermore, the re-entrant jobs are stochastic as only some jobs are requi...

In this paper we consider an NP -hard hybrid flow shop problem with machine setups and cycletime minimization. The above issue is an important generalization of a flow-shop problem with minimization of a cycle time, and it stays in a direct relationship with a flexible job shop problem. In the hybrid problem task operations are performed by machines arranged in slots, i.e., a set of machines wi...

The IC packaging industry relies heavily on shop floor information, necessitating the development of a data model to flexibly define shop floor information in the production flow. For this purpose, this work designs a novel data model by using IDEF1x. The proposed data model consists of four modules: operation template setup, general process setup, enhanced bill of manufacture (EBOMfr) setup, a...

In the stochastic online scheduling environment, jobs with unknown release times and weights arrive over time. Upon arrival, the information on the weight of the job is revealed but the processing requirement remains unknown until the job is finished. With the objective of minimizing the total weighted completion time, various asymptotically optimal algorithms have been proposed for the online ...

In the present scenario the recent engineering and industrial built-up units are facing hodgepodge of problems in a lot of aspects such as machining time, electricity, man power, raw material and customer’s constraints. The job-shop scheduling is one of the most significant industrial behaviours, particularly in manufacturing planning. This paper proposes the permutation flow shop sequencing pr...

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...

500 Abstract— This research aims to improve the plant layout of manufacturing industry to make optimum space utilization, eliminate obstructions in material flow and thus obtain maximum productivity. The present layout and operation process of each section (i.e. material storage, cutting, machining shop, fabrication shop, assembly and inspection section and finish product storage) have been inv...