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

DOI10.1007/978-3-540-69277-5_11zbMath1153.68335OpenAlexW106978346MaRDI QIDQ3603121

El-Ghazali Talbi, Ahcene Bendjoudi, M. Mansoura, S. Guerdah, 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

branch and boundgenetic algorithmsgrid middlewareflow-shop schedulingP2P computing

Mathematics Subject Classification ID

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

Uses Software

• ParaDisEO
• HTCondor MW

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem
• Using short-term memory to minimize the weighted number of late jobs on a single machine.
• Benchmarks for basic scheduling problems
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Optimal two- and three-stage production schedules with setup times included
• Metaheuristics and Parallelism
• A General Bounding Scheme for the Permutation Flow-Shop Problem
• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Branch-and-Bound Methods: General Formulation and Properties

This page was built for publication: P2P B&B and GA for the Flow-Shop Scheduling Problem