Generating improved dominance conditions for the flowshop problem
type: Item
instance of: scholarly article
title: Generating improved dominance conditions for the flowshop problem
zbMATH Open document ID: 0625.90044
DOI: 10.1016/0305-0548(87)90056-6
author: Jatinder N. D. Gupta
author: J. George Shanthikumar
author: Wlodzimierz Szwarc
published in: Computers \& Operations Research
publication date: 1987-01-01T00:00:00Z
review text: This paper proposes a class of functions that generates new dominance conditions for the flowship scheduling problem and shows that the use of these conditions will eliminate more partial sequences than the existing conditions. While the problem is in the NP-complete category, the use of the proposed dominance conditions reduces the number of active partial schedules to be examined and stored. These improvements are useful in solving the flowshop scheduling problems through the branch-and-bound and elimination procedures.
reviewed by: V.Peteanu
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 4016582
zbMATH Keywords: flowship scheduling
zbMATH Keywords: dominance conditions
zbMATH Keywords: branch-and-bound
MaRDI profile type: Publication
full work available at URL: 0305-0548(87)90056-6
OpenAlex ID: W2000913749
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: Technical Note—An Improved Combinatorial Algorithm for the Flowshop-Scheduling Problem
cites work: Q5563220
cites work: Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem
cites work: Technical Note—Improved Dominance Conditions for the Three-Machine Flowshop Scheduling Problem
cites work: Technical Note—Dominance Conditions for the Three-Machine Flow-Shop Problem
cites work: Permutation flow-shop theory revisited
description: scientific article; zbMATH DE number 4016582