Elimination conditions and lower bounds for the permutation flow-shop sequencing problem

DOI10.1007/BF01665847zbMath0626.90041OpenAlexW2082304234MaRDI QIDQ581221

Yongmao Chen, Minyi Yue, Ji-ye Han

Publication date: 1985

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01665847

zbMATH Keywords

lower boundsComputational resultsbranch-and- boundelimination conditionspermutation flow-shop

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Unnamed Item
• An adaptive branching rule for the permutation flow-shop problem
• Optimal two- and three-stage production schedules with setup times included
• A Comparative Study of Flow-Shop Algorithms
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• An Evaluation of Flow Shop Sequencing Heuristics
• Mathematical aspects of the 3 × n job-shop sequencing problem
• Optimal Elimination Methods in the m × n Flow-Shop Scheduling Problem
• A General Algorithm for Solution of the n-Job, M-Machine Sequencing Problem of the Flow Shop
• A Heuristic Algorithm for the n Job, m Machine Sequencing Problem
• Elimination methods in them ×n sequencing problem

This page was built for publication: Elimination conditions and lower bounds for the permutation flow-shop sequencing problem