• Home
  • Search
  • Scheduling flexible flow shops with sequence-dependent setup effects
  • Cite Icon98
  • https://doi.org/10.1109/70.864235Copy DOI Icon

Scheduling flexible flow shops with sequence-dependent setup effects

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

This paper presents a Lagrangian relaxation-based approach for production scheduling of flexible flow shops (PSFFS) where sequence-dependent setup effects are significant. PSPFS is first formulated as a separable integer programming problem with synchronization constraints between production and machine usage. Lagrangian relaxation is then applied, and the scheduling is decomposed into part production and machine scheduling. In these subproblems, there are network flow structures in the equality constraints describing machine status change and production flow balance. Our iterative algorithm applies a minimum cost network flow algorithm to individual subproblems and adopts an efficient surrogate subgradient method to optimize Lagrangian multipliers. A machine availability-searching heuristic finally adjusts the solution to satisfy all synchronization constraints by exploiting the network structure, economic interpretation of Lagrangian multipliers, and the slack time policy. Numerical results of 16 cases, each having 20 test problems, demonstrate that differences between the schedules obtained by our approach and the true optima are on average within 15%, CPU times spent are all less than 17 min on a Pentium-II personal computer. Among the problem dimension factors, the number of part types has the most significant effect on both optimality and computation efficiency. Application of the methodology to daily scheduling of a realistic integrated circuit testing facility of 30 machines takes about 6 min of CPU time to generate a near-optimal solution.

Similar Papers
  • Research Article

Energy‐aware scheduling in a flexible flow shop using a hybrid constraint programming approach

  • Mar 24, 2026
  • International Transactions in Operational Research
  • Joyce Mhanna +3
  • Research Article
  • Citations30

Scheduling of multi-component products in a two-stage flexible flow shop

  • Mar 25, 2015
  • Applied Soft Computing
  • Fatemeh Nikzad +3
  • Research Article
  • Citations10

A constraint programming approach for resource-constrained flexible assembly flow shop scheduling problem with batch direct delivery

  • Sep 24, 2024
  • Computers and Operations Research
  • Chuangfeng Zeng +2
  • Research Article
  • Citations28

A comparative analysis of two different approaches to scheduling in flexible flow shops

  • Jan 01, 2000
  • Production Planning & Control
  • M S Jayamohan +1
  • Research Article
  • Citations8

A separable integer programming problem equivalent to its continual version

  • Sep 01, 1981
  • Journal of Computational and Applied Mathematics
  • A Galperin +1
  • Conference Article
  • Citations8

Lagrangian Relaxation Based Gate Sizing With Clock Skew Scheduling - A Fast and Effective Approach

  • Apr 04, 2019
  • Ankur Sharma +2
  • Research Article
  • Citations46

Hybrid genetic algorithm and tabu search for finite capacity material requirement planning system in flexible flow shop with assembly operations

  • May 04, 2016
  • Computers & Industrial Engineering
  • Watcharapan Sukkerd +1
  • Research Article
  • Citations55

Scheduling flexible flow shops with no setup effects

  • Apr 01, 1994
  • IEEE Transactions on Robotics and Automation
  • Shi-Chung Chang +1
  • Single Book
  • Citations52

Production Planning and Scheduling in Flexible Assembly Systems

  • Jan 01, 1999
  • Tadeusz Sawik
  • Research Article
  • Citations63

An immune algorithm approach to the scheduling of a flexible PCB flow shop

  • Aug 07, 2003
  • The International Journal of Advanced Manufacturing Technology
  • D Alisantoso +2
  • Research Article
  • Citations5

Machine-Oriented Decomposition of Flowshop Scheduling Problems Using Lagrangian Relaxation

  • Jan 01, 2001
  • Transactions of the Institute of Systems, Control and Information Engineers
  • Tatsushi Nishi +2
  • Research Article
  • Citations42

A swarm optimization approach for flexible flow shop scheduling with multiprocessor tasks

  • Dec 04, 2011
  • The International Journal of Advanced Manufacturing Technology
  • Manas Ranjan Singh +1
  • Dissertation

A scheduling in flexible flow shop problem with unrelated parallel machines and sequence-dependent setup times

  • Jan 01, 2007
  • Jitti Jungwattanakit
  • PDF
  • Research Article
  • Citations10

A Hybrid Approach for the Multi-Criteria-Based Optimization of Sequence-Dependent Setup-Based Flow Shop Scheduling

  • Jun 28, 2024
  • Mathematics
  • Fatih Yigit +2
  • Book Chapter

Improved Sub-gradient Algorithm for Solving the Lower Bound of No-Wait Flow-Shop Scheduling with Sequence-Dependent Setup Times and Release Dates

  • Jan 01, 2018
  • Nai-Kang Yu +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.