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

DOI10.1016/J.DAM.2024.01.022MaRDI QIDQ6202953zbMATH OpenOpenAlexWikidataFDO

Authors 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

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

Recommendations

• Flowshop/no-idle scheduling to minimise the mean flowtime
• Flowshop/no-idle scheduling to minimize total elapsed time
• The flow shop problem with no-idle constraints: a review and approximation
• No-wait flexible flowshop scheduling with no-idle machines
• Beam search-based heuristics for the mixed no-idle flowshop with total flowtime criterion

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 2050711 (Why is no real title available?)
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• 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
• A note on a greedy heuristic for flow-shop makespan minimization with no machine idle-time
• A travelling salesman approach to solve the \(F\)/no-idle/\(C_{max}\) problem
• A variable iterated greedy algorithm with differential evolution for the no-idle permutation flowshop scheduling problem
• Benchmarks for basic scheduling problems
• Branch-and-Bound Methods: A Survey
• Local branching
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Some efficient heuristic methods for the flow shop sequencing problem
• THE POWER OF UPPER AND LOWER BOUNDING FUNCTIONS IN BRANCH-AND-BOUND ALGORITHMS
• The Complexity of Flowshop and Jobshop Scheduling
• The flow shop problem with no-idle constraints: a review and approximation

Cited in

(1)

• A systematic literature review on no-idle flow shop scheduling problem

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)