No-wait flexible flow shop scheduling with due windows
type: Item
instance of: scholarly article
title: No-wait flexible flow shop scheduling with due windows
zbMATH Open document ID: 1394.90277
DOI: 10.1155/2015/456719
author: Rong-Hwa Huang
author: Chang-Lin Yang
author: Shang-Chia Liu
published in: Mathematical Problems in Engineering
publication date: 2018-08-27T00:00:00Z
review text: Summary: To improve capacity and reduce processing time, the flow shop with multiprocessors (FSMP) system is commonly used in glass, steel, and semiconductor production. No-wait FSMP is a modern production system that responds to periods when zero work is required in process production. The production process must be continuous and uninterrupted. Setup time must also be considered. Just-in-time (JIT) production is very popular in industry, and timely delivery is important to customer satisfaction. Therefore, it is essential to consider the time window constraint, which is also very complex. This study focuses on a no-wait FSMP problem with time window constraint. An improved ant colony optimization (ACO), known as ant colony optimization with flexible update (ACOFU), is developed to solve the problem. The results demonstrate that ACOFU is more effective and robust than ACO when applied to small-scale problems. ACOFU has superior solution capacity and robustness when applied to large-scale problems. Therefore, this study concludes that the proposed algorithm ACOFU performs excellently when applied to the scheduling problem discussed in this study.
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6926389
Wikidata QID: Q59118625
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1155/2015/456719
OpenAlex ID: W1539307054
cites work: Parallel machine scheduling with a common due window
cites work: A new heuristic and dominance relations for no-wait flowshops with setups
cites work: Approximative procedures for no-wait job shop scheduling.
cites work: A heuristic approach for two-machine no-wait flowshop scheduling with due dates and class setups
cites work: The two-machine flowshop no-wait scheduling problem with a single server to minimize the total completion time
cites work: A branch-and-price algorithm for scheduling parallel machines with sequence dependent setup times
cites work: A non-delayed relax-and-cut algorithm for scheduling problems with parallel machines, due dates and sequence-dependent setup times
description: scientific article; zbMATH DE number 6926389