A branch-and-bound approach to the no-idle flowshop scheduling problem
From MaRDI portal
Publication:6202953
DOI10.1016/J.DAM.2024.01.022OpenAlexW4391242650WikidataQ129332535 ScholiaQ129332535MaRDI QIDQ6202953FDOQ6202953
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
Operations research and management science (90Bxx) Mathematical programming (90Cxx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Local branching
- The Complexity of Flowshop and Jobshop Scheduling
- Branch-and-Bound Methods: A Survey
- Benchmarks for basic scheduling problems
- 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
- A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
- 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 flow shop problem with no-idle constraints: a review and approximation
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
- A hybrid discrete teaching-learning based meta-heuristic for solving no-idle flow shop scheduling problem with total tardiness criterion
- THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS
This page was built for publication: A branch-and-bound approach to the no-idle flowshop scheduling problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6202953)
