چکیده:
Much of the research on operations scheduling problems has either
ignored setup times or assumed that setup times on each machine are
independent of the job sequence. This paper deals with the hybrid flow
shop scheduling problems in which there are sequence dependent setup
times, commonly known as the SDST hybrid flow shops. This type of
production system is found in industries such as chemical, textile,
metallurgical, printed circuit board, and automobile manufacture. With
the increase in manufacturing complexity, conventional scheduling
techniques for generating a reasonable manufacturing schedule have
become ineffective. A particle swarm optimization algorithm can be used
to tackle complex problems and produce a reasonable manufacturing
schedule within an acceptable time. This paper describes a novel particle
swarm optimization algorithm approach to the scheduling of a SDST
hybrid flow shop. An overview of the hybrid flow shops and the basic
notions of a PSO are first presented. Subsequently, the details of a
NPSO approach are described and implemented. The results obtained
are compared with those computed by Random Key Genetic Algorithm
presented previously.
خلاصه ماشینی:
"69-95 A novel particle swarm optimization algorithm approach to hybrid flow shops scheduling with sequence-dependent setup times Abstract M.
Key words: Short-term scheduling; Hybrid flow shops; Sequence dependent setup times; Makespan; Particle Swarm Optimization 1.
2. Literature review Gupta and Tunc (1994) presented four heuristic algorithms to minimize makespan for a two stage hybrid flow shop problem with separable setup and removal times.
Kochhar and Morris (1987) model flexible flow lines in a more complete manner in that they allow for setups between jobs, finite buffers which may cause blocking and starvation, machine down-time, and current and subsequent state of the system.
Rios-Mercado and Bard (1998) also considered the sequence-dependent setup time flow shop and developed several valid inequalities for models based on the traveling salesman problem and the Srikar-Ghosh model.
Hung and Ching (2003) addressed a scheduling problem taken from a label sticker manufacturing company which is a two-stage hybrid flow shop with the characteristics of sequence-dependent setup time at stage 1, dedicated machines at stage 2, and two due dates.
Following Kurz and Askin (2003,2004), data required for a problem consists of the number of jobs, number of stages, number of machines in each stage, range of processing times, and the range of sequence dependent setup times.
There are potentially unlimited opportunities for research in scheduling to minimize makespan in hybrid flow shops with sequence- dependent setup times.
Scheduling flexible flow lines with sequence- dependent setup times, European Journal of Operational Research, 159, 1,66–82."