P2P B&B and GA for the Flow-Shop Scheduling Problem

DOI10.1007/978-3-540-69277-5_11MaRDI QIDQ3603121zbMATHOpenAlexFDO

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

zbMATH Keywords

genetic algorithmsbranch and boundgrid middlewareflow-shop schedulingP2P computing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

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

Cites work

• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 2193705 (Why is no real title available?)
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Benchmarks for basic scheduling problems
• Branch-and-Bound Methods: General Formulation and Properties
• Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
• Metaheuristics and Parallelism
• Optimal two- and three-stage production schedules with set-up time included
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Sequencing \(n\) jobs on two machines with arbitrary time lags
• Using short-term memory to minimize the weighted number of late jobs on a single machine.

Cited in

(1)

• Combining metaheuristics and exact methods for solving exactly multi-objective problems on the grid

Describes a project that uses

Uses Software

• ParaDisEO
• HTCondor MW

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)