A computational study of the permutation flow shop problem based on a tight lower bound
type: Item
instance of: scholarly article
title: A computational study of the permutation flow shop problem based on a tight lower bound
zbMATH Open document ID: 1074.90018
author: Talel Ladhari
author: Mohamed Haouari
published in: Computers \& Operations Research
publication date: 2005-05-12T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2168006
zbMATH Keywords: Scheduling
zbMATH Keywords: Permutation flow shop
zbMATH Keywords: Branch-and-bound algorithm
MaRDI profile type: Publication
full work available at URL: j.cor.2003.12.001
OpenAlex ID: W2088851523
cites work: Q3525910
cites work: Permutation vs. non-permutation flow shop schedules
cites work: Optimal two- and three-stage production schedules with set-up time included
cites work: Q4365136
cites work: The Complexity of Flowshop and Jobshop Scheduling
cites work: An Automatic Method of Solving Discrete Programming Problems
cites work: A General Bounding Scheme for the Permutation Flow-Shop Problem
cites work: An adaptive branching rule for the permutation flow-shop problem
cites work: On two-machine scheduling with release and due dates to minimize maximum lateness
cites work: Two branch and bound algorithms for the permutation flow shop problem
cites work: A branch-and-bound algorithm with fuzzy inference for a permutation flowshop scheduling problem
cites work: A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
cites work: An Evaluation of Flow Shop Sequencing Heuristics
cites work: A fast tabu search algorithm for the permutation flow-shop problem
cites work: A genetic algorithm for flowshop sequencing
cites work: A branch-and-bound-based local search method for the flow shop problem
cites work: Some results of the worst-case analysis for flow shop scheduling
cites work: A note on permutation flow shop problem
cites work: Q4124328
cites work: Some simple scheduling algorithms
cites work: The one-machine sequencing problem
cites work: Mathematical aspects of the 3 × n job-shop sequencing problem
cites work: Minimising Maximum Lateness in a Two-Machine Flowshop
cites work: Benchmarks for basic scheduling problems
cites work: Adjustment of heads and tails for the job-shop problem
cites work: The job-shop problem and immediate selection
DOI: 10.1016/J.COR.2003.12.001
description: scientific article; zbMATH DE number 2168006