P2P B&B and GA for the Flow-Shop Scheduling Problem
DOI10.1007/978-3-540-69277-5_11zbMATH Open1153.68335OpenAlexW106978346MaRDI QIDQ3603121FDOQ3603121
Authors: Ahcene Bendjoudi, S. Guerdah, M. Mansoura, El-Ghazali Talbi, Nouredine Melab
Publication date: 13 February 2009
Published in: Studies in Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69277-5_11
Recommendations
- Parallel Processing and Applied Mathematics
- A combined branch-and bound and genetic algorithm based approach for a flowshop scheduling problem
- Bilevel programming applied to the flow shop scheduling problem
- A branch and bound algorithm for the flow-shop scheduling problem
- A hybrid TP+PLS algorithm for bi-objective flow-shop scheduling problems
- A genetic algorithm for the flowshop scheduling problem
- Algorithms for bicriteria minimization in the permutation flow shop scheduling problem
- A computationally efficient branch-and-bound algorithm for the permutation flow-shop scheduling problem
Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Optimal two- and three-stage production schedules with set-up time included
- Branch-and-Bound Methods: General Formulation and Properties
- Benchmarks for basic scheduling problems
- Parallel Branch-and-Branch Algorithms: Survey and Synthesis
- Using short-term memory to minimize the weighted number of late jobs on a single machine.
- A General Bounding Scheme for the Permutation Flow-Shop Problem
- Sequencing \(n\) jobs on two machines with arbitrary time lags
- Metaheuristics and Parallelism
- Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
- Title not available (Why is that?)
Cited In (1)
Uses Software
This page was built for publication: P2P B&B and GA for the Flow-Shop Scheduling Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603121)