A branch-and-bound approach to the no-idle flowshop scheduling problem

DOI10.1016/j.dam.2024.01.022OpenAlexW4391242650WikidataQ129332535 ScholiaQ129332535MaRDI QIDQ6202953

Bassem Jarboui, Mansour Eddaly

Publication date: 27 February 2024

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2024.01.022

zbMATH Keywords

branch and bounditerated local searchmachine based lower boundsno-idle flowshop scheduling problem

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research and management science (90Bxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• Some efficient heuristic methods for the flow shop sequencing problem
• The flow shop problem with no-idle constraints: a review and approximation
• Local branching
• A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
• A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
• Benchmarks for basic scheduling problems
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• The Complexity of Flowshop and Jobshop Scheduling
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS
• Branch-and-Bound Methods: A Survey

This page was built for publication: A branch-and-bound approach to the no-idle flowshop scheduling problem