A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP

DOI10.1142/S0217595905000601zbMath1088.90027OpenAlexW2163526210MaRDI QIDQ5708850

No author found.

Publication date: 21 November 2005

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595905000601

zbMATH Keywords

branch-and-boundlower boundflowshop

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Flow shop non-idle scheduling and resource-constrained scheduling ⋮ Minimizing Total Idle Energy Consumption in the Permutation Flow Shop Scheduling Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Improved lower bounds for minimizing the sum of completion times of n jobs over m machines in a flow shop
• The two-machine total completion time flow shop problem
• A heuristic algorithm for mean flowtime objective in flowshop scheduling
• An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
• Minimizing Total Completion Time in a Two-Machine Flowshop: Analysis of Special Cases
• Optimal two- and three-stage production schedules with setup times included
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• The Lessons of Flowshop Scheduling Research
• Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
• Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
• Flowshop and Jobshop Schedules: Complexity and Approximation
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey

This page was built for publication: A SIMPLE LOWER BOUND FOR TOTAL COMPLETION TIME MINIMIZATION IN A TWO-MACHINE FLOWSHOP