A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness

DOI10.1080/0020754041233127044zbMath1069.90115OpenAlexW2081580328MaRDI QIDQ4666773

Geun-Cheol Lee, Yeong-Dae Kim

Publication date: 5 April 2005

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020754041233127044

zbMATH Keywords

branch-and-bound algorithmflowshop-scheduling problem

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (7)

Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective ⋮ Scheduling on parallel identical machines to minimize total tardiness ⋮ The hybrid flow shop scheduling problem ⋮ Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study ⋮ Monadic convergence structures revisited ⋮ Heuristics for a two-stage hybrid flowshop scheduling problem with ready times and a product-mix ratio constraint ⋮ A TABU SEARCH ALGORITHM FOR A PIPE-PROCESSING FLOWSHOP SCHEDULING PROBLEM MINIMIZING TOTAL TARDINESS IN A SHIPYARD

Cites Work

• Branch and bound algorithm for the flow shop with multiple processors
• The two-machine flowshop scheduling problem with total tardiness
• Minimizing total tardiness in permutation flowshops
• A multi-stage parallel-processor flowshop problem with minimum flowtime
• A new branch and bound algorithm for minimizing mean tardiness in two- machine flowshops
• Scheduling a two-stage hybrid flow shop with parallel machines at the first stage
• Scheduling hybrid flowshops to minimize maximum tardiness or maximum completion time
• A new dynamic programming formulation of (n x m) flowshop sequencing problems with due dates
• Minimizing tardy jobs in a two-stage hybrid flowshop
• Two-machine flowshop scheduling to minimize total tardiness
• Selecting Scheduling Heuristics Using Neural Networks
• Bottleneck-focused scheduling for a hybrid flowshop
• A dispatching rule-based approach to production scheduling in a printed circuit board manufacturing system
• The Total Tardiness Problem: Review and Extensions
• A flexible flowshop problem with total flow time minimization
• Minimizing tardiness in a two-machine flow-shop

This page was built for publication: A branch-and-bound algorithm for a two-stage hybrid flowshop scheduling problem minimizing total tardiness