A branch and bound algorithm in optimizing job shop scheduling problems

Erna Budhiarti Nababan, Abdul Razak Hamdan, Salwani Abdullah, Mohamad Shanudin Zakaria

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

One primary objective in solving the job shop scheduling problems is to minimize the makespan, which is a particularly hard combinatorial optimization problem. The problem has been known for years and a vast majority of researches had been focused to solve the problem using a variety of optimization methods such as the branch and bound (B&B). However, the B&B method is considered as only suitable for small and medium size problems due its prohibitive computational time. In this paper, we implement the B&B method using the disjunctive programming approach to obtain optimal solutions for job shop scheduling problem. The B&B program developed is tested on a set of benchmark data and the results obtain are compared to best known from the previous work. Based on the comparison, we conclude that the branch and bound algorithm is considerable as a solution tool for small, medium, as well as large job shop problems.

Original languageEnglish
Title of host publicationProceedings - International Symposium on Information Technology 2008, ITSim
Volume1
DOIs
Publication statusPublished - 2008
EventInternational Symposium on Information Technology 2008, ITSim - Kuala Lumpur
Duration: 26 Aug 200829 Aug 2008

Other

OtherInternational Symposium on Information Technology 2008, ITSim
CityKuala Lumpur
Period26/8/0829/8/08

Fingerprint

Combinatorial optimization
Job shop scheduling

ASJC Scopus subject areas

  • Artificial Intelligence
  • Information Systems
  • Control and Systems Engineering
  • Electrical and Electronic Engineering

Cite this

Nababan, E. B., Hamdan, A. R., Abdullah, S., & Zakaria, M. S. (2008). A branch and bound algorithm in optimizing job shop scheduling problems. In Proceedings - International Symposium on Information Technology 2008, ITSim (Vol. 1). [4631564] https://doi.org/10.1109/ITSIM.2008.4631564

A branch and bound algorithm in optimizing job shop scheduling problems. / Nababan, Erna Budhiarti; Hamdan, Abdul Razak; Abdullah, Salwani; Zakaria, Mohamad Shanudin.

Proceedings - International Symposium on Information Technology 2008, ITSim. Vol. 1 2008. 4631564.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Nababan, EB, Hamdan, AR, Abdullah, S & Zakaria, MS 2008, A branch and bound algorithm in optimizing job shop scheduling problems. in Proceedings - International Symposium on Information Technology 2008, ITSim. vol. 1, 4631564, International Symposium on Information Technology 2008, ITSim, Kuala Lumpur, 26/8/08. https://doi.org/10.1109/ITSIM.2008.4631564
Nababan EB, Hamdan AR, Abdullah S, Zakaria MS. A branch and bound algorithm in optimizing job shop scheduling problems. In Proceedings - International Symposium on Information Technology 2008, ITSim. Vol. 1. 2008. 4631564 https://doi.org/10.1109/ITSIM.2008.4631564
Nababan, Erna Budhiarti ; Hamdan, Abdul Razak ; Abdullah, Salwani ; Zakaria, Mohamad Shanudin. / A branch and bound algorithm in optimizing job shop scheduling problems. Proceedings - International Symposium on Information Technology 2008, ITSim. Vol. 1 2008.
@inproceedings{1d7d5c7ec3af48aab47d625bdd139f32,
title = "A branch and bound algorithm in optimizing job shop scheduling problems",
abstract = "One primary objective in solving the job shop scheduling problems is to minimize the makespan, which is a particularly hard combinatorial optimization problem. The problem has been known for years and a vast majority of researches had been focused to solve the problem using a variety of optimization methods such as the branch and bound (B&B). However, the B&B method is considered as only suitable for small and medium size problems due its prohibitive computational time. In this paper, we implement the B&B method using the disjunctive programming approach to obtain optimal solutions for job shop scheduling problem. The B&B program developed is tested on a set of benchmark data and the results obtain are compared to best known from the previous work. Based on the comparison, we conclude that the branch and bound algorithm is considerable as a solution tool for small, medium, as well as large job shop problems.",
author = "Nababan, {Erna Budhiarti} and Hamdan, {Abdul Razak} and Salwani Abdullah and Zakaria, {Mohamad Shanudin}",
year = "2008",
doi = "10.1109/ITSIM.2008.4631564",
language = "English",
isbn = "9781424423286",
volume = "1",
booktitle = "Proceedings - International Symposium on Information Technology 2008, ITSim",

}

TY - GEN

T1 - A branch and bound algorithm in optimizing job shop scheduling problems

AU - Nababan, Erna Budhiarti

AU - Hamdan, Abdul Razak

AU - Abdullah, Salwani

AU - Zakaria, Mohamad Shanudin

PY - 2008

Y1 - 2008

N2 - One primary objective in solving the job shop scheduling problems is to minimize the makespan, which is a particularly hard combinatorial optimization problem. The problem has been known for years and a vast majority of researches had been focused to solve the problem using a variety of optimization methods such as the branch and bound (B&B). However, the B&B method is considered as only suitable for small and medium size problems due its prohibitive computational time. In this paper, we implement the B&B method using the disjunctive programming approach to obtain optimal solutions for job shop scheduling problem. The B&B program developed is tested on a set of benchmark data and the results obtain are compared to best known from the previous work. Based on the comparison, we conclude that the branch and bound algorithm is considerable as a solution tool for small, medium, as well as large job shop problems.

AB - One primary objective in solving the job shop scheduling problems is to minimize the makespan, which is a particularly hard combinatorial optimization problem. The problem has been known for years and a vast majority of researches had been focused to solve the problem using a variety of optimization methods such as the branch and bound (B&B). However, the B&B method is considered as only suitable for small and medium size problems due its prohibitive computational time. In this paper, we implement the B&B method using the disjunctive programming approach to obtain optimal solutions for job shop scheduling problem. The B&B program developed is tested on a set of benchmark data and the results obtain are compared to best known from the previous work. Based on the comparison, we conclude that the branch and bound algorithm is considerable as a solution tool for small, medium, as well as large job shop problems.

UR - http://www.scopus.com/inward/record.url?scp=57349104322&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=57349104322&partnerID=8YFLogxK

U2 - 10.1109/ITSIM.2008.4631564

DO - 10.1109/ITSIM.2008.4631564

M3 - Conference contribution

AN - SCOPUS:57349104322

SN - 9781424423286

VL - 1

BT - Proceedings - International Symposium on Information Technology 2008, ITSim

ER -