Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Saïd Toumi; Bassem Jarboui; Mansour Eddaly; Abdelwaheb Rebaï

doi:10.1504/ijmor.2017.080743

ScienceGate Book Chapters

JOURNAL ARTICLE

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Saïd Toumi Bassem Jarboui Mansour Eddaly Abdelwaheb Rebaï

Year: 2016 Journal: International Journal of Mathematics in Operational Research Vol: 10 (1)Pages: 34-34 Publisher: Inderscience Publishers

DOI: 10.1504/ijmor.2017.080743

Get Full-Text PDF Get Analytical Report

Abstract

This paper deals with a permutation flowshop scheduling problem with blocking constraints. To minimise the makespan, it uses a branch-and-bound algorithm. A new lower bound is developed for the problem based upon the two machine-subproblem relaxation. Computational tests show the superiority of the proposed algorithm.

Keywords:

Job shop scheduling Branch and bound Mathematical optimization Computer science Upper and lower bounds Blocking (statistics) Scheduling (production processes) Algorithm Permutation (music) Flow shop scheduling Mathematics Routing (electronic design automation)

Metrics

Cited By

3.13

FWCI (Field Weighted Citation Impact)

Refs

0.93

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Scheduling and Optimization Algorithms

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Advanced Manufacturing and Logistics Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Assembly Line Balancing Optimization

Physical Sciences → Engineering → Industrial and Manufacturing Engineering

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Abstract

Metrics

Citation History

Topics

Related Documents

Branch-and-bound algorithm for solving blocking flowshop scheduling problems with makespan criterion

Solving blocking flowshop scheduling problem with branch and bound algorithm

Branch and bound algorithm for solving blocking flowshop scheduling problem with total tardiness

Branch and bound algorithm for solving blocking flowshop scheduling problem with total completion time

Discrete differential evolution algorithm for distributed blocking flowshop scheduling with makespan criterion