An efficient simulated annealing algorithm for a No-Wait Two Stage Flexible Flow Shop Scheduling Problem

In this paper, no wait two stage flexible flow shop scheduling problem (FFSSP) is solved using two meta-heuristic algorithms. This problem with minimum makespan performance measure is NP-Hard. The proposed algorithms are Simulated Annealing and Genetic Algorithm. The results are analyzed in terms of Relative Percentage Deviation of Makespan. The performance of the proposed algorithms are studied and compared with that of MDA algorithm. For this propose a number of problems in different sizes are solved. The results of the studies proposes the effective algorithm. This is followed by describing the outline of the study, concluding remarks and suggesting potential areas for further researches

• Publication year

  2011

• Venue

  Unknown venue

• Publication date

  Unknown publication date

• Fields of study

  Not labeled

• Identifiers
  DOI 10.2139/ssrn.3431088
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A heuristic for two-stage no-wait hybrid flowshop scheduling with a single machine in either stage

  2012cited by this paper
• A hybrid flowshop scheduling problem for a cold treating process in seamless steel tube production

  2011cited by this paper
• Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective

  2010cited by this paper
• The hybrid flow shop scheduling problem

  2010cited by this paper
• Development of a hybrid metaheuristic to minimise earliness and tardiness in a hybrid flowshop with sequence-dependent setup times

  2010cited by this paper
• A hybrid genetic algorithm for flowshop lot streaming with setups and variable sublots

  2010cited by this paper
• An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns

  2009cited by this paper
• No-wait two-stage multiprocessor flow shop scheduling with unit setup

  2009cited by this paper
• An improved iterated greedy algorithm for the no-wait flow shop scheduling problem with makespan criterion

  2008cited by this paper
• Genetic algorithms for the no-wait flowshop sequencing problem with time restrictions

  2006cited by this paper
• Complexity and algorithms for two-stage flexible flowshop scheduling with availability constraints

  2005cited by this paper
• Simulated annealing heuristic for flow shop scheduling problems with unrelated parallel machines

  2005cited by this paper
• A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness

  2004cited by this paper
• Minimum deviation algorithm for two-stageno-wait flowshops with parallel machines

  2004cited by this paper
• A new heuristic for minimal makespan in flow shops with multiple processors and no intermediate storage

  2004cited by this paper
• Improved genetic algorithm for the permutation flowshop scheduling problem

  2004cited by this paper
• NEW HEURISTICS FOR M-MACHINE NO-WAIT FLOWSHOP TO MINIMIZE TOTAL COMPLETION TIME

  2004cited by this paper
• Introduction to Evolutionary Computing

  2003cited by this paper
• Sequencing Hybrid Two-Stage Flowshops with Dedicated Machines

  2001cited by this paper
• Scheduling multipurpose batch process industries with no-wait restrictions by simulated annealing

  2000cited by this paper
• Large production line optimization using simulated annealing

  2000cited by this paper
• Sequencing of jobs in some production system

  2000cited by this paper
• Heuristic algorithms for the two-stage hybrid flowshop problem

  1997cited by this paper
• A Survey of Machine Scheduling Problems with Blocking and No-Wait in Process

  1996cited by this paper
• A No-Wait Flowshop Scheduling Heuristic to Minimize Makespan

  1994cited by this paper
• Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence

  1992cited by this paper
• A simulated annealing procedure for single row layout problems in flexible manufacturing systems

  1992cited by this paper
• Uniform Crossover in Genetic Algorithms

  1989cited by this paper
• Genetic Algorithms in Search Optimization and Machine Learning

  1988cited by this paper
• A COMPARISON OF SEQUENCING RULES FOR A TWO‐STATE HYBRID FLOW SHOP

  1987cited by this paper
• Some no-wait shops scheduling problems: Complexity aspect

  1986cited by this paper

• A Whale Optimization Algorithm based Solver for No-wait Flexible Flow Shop Scheduling Problems

  2024influential citation
• Memetic algorithm used in a flow shop scheduling problem

  2020cites this paper
• Efficient Metaheuristics for Multi-stage No-Wait Flexible Flowshop Scheduling Problem

  2015cites this paper