The flowshop problem (FSP) is one of the most thoroughly studied scheduling problems. In the FSP, a set N = {1, . . . , n} of n independent jobs has to be processed on a set M = {1, . . . ,m} of m machines. Every job j, j ∈ N , requires a given fixed, non-negative processing time pij on every machine i, i ∈ M . In a flowshop, all n jobs are to be processed on the m machines in the same order, t...

Flowshop scheduling problems have been extensively studied by several authors using different approaches. A typical flowshop process consists of successive manufacturing stages arranged in a single production line where different jobs have to be processed following a predefined production recipe. In this work, the scheduling of a complex flowshop process involving automated wet-etch station fro...

in this paper a new problem of three stage disassembly-assembly scheduling is introduced and reviewed. this problem, which was arisen from the aviation industry characteristics, is a generalization of the two stage assembly scheduling problem. products (helicopters) in the aviation industry return to assembler for annual overhaul repair services. in the first stage helicopters are disassembled ...

Flowshop scheduling is a very active research area. This problem still attracts a considerable amount of interest despite the sheer amount of available results. Total flowtime minimization of a flowshop has been actively studied and many effective algorithms have been proposed in the last few years. New best solutions have been found for common benchmarks at a rapid pace. However, these improve...

increasing competitiveness between software companies , that stems from customer needs and new information technologies, obliges the companies to improve their products’ quality according to high speed and low cost. this research seeks to introduce and determine the software production assembly line, one of the software development approaches. a three stage questionnaire was used to collect inf...

The issue of sequencing and scheduling has received considerable critical attention in many fields since the early 1950s. In this research, we studied an important production scheduling system, which generally called flexible (or hybrid) flowshop scheduling problem (FFSP or HFSP). We studied this production system with an important restriction called the no-wait. The objective was to optimize t...

The general flowshop scheduling problem is a production problem where a set of n jobs have to be processed with identical flow pattern on m machines. In permutation flowshops the sequence of jobs is the same on all machines. A significant research effort has been devoted for sequencing jobs in a flowshop minimizing the makespan. This paper describes the application of a Constructive Genetic Alg...

0360-8352/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.cie.2008.09.004 q This manuscript was processed by Area Editor Ma * Corresponding author. Tel./fax: +52 653 5356168 E-mail address: [email protected] (V. Yaurima This paper presents a genetic algorithm for an important production scheduling problem. Since the problem is NP-hard, we focus on suboptimal scheduling solutions for the ...