A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking

DOI10.1504/IJOR.2012.047094zbMath1362.90179OpenAlexW2058920015MaRDI QIDQ2627304

Mourad Boudhar, Brahim Benmedjdoub, Abdelhakim AitZai

Publication date: 31 May 2017

Published in: International Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1504/ijor.2012.047094

zbMATH Keywords

branch and boundjob shop schedulingoperational researchparallel genetic algorithmsB\&Bblocking constraintsalternative graphs

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (1)

An efficient tabu search neighborhood based on reconstruction strategy to solve the blocking job shop scheduling problem

This page was built for publication: A branch and bound and parallel genetic algorithm for the job shop scheduling problem with blocking