Journal ArticleOPEN ACCESS

A branch and bound algorithm for the job-shop scheduling problem

Discrete Applied Mathematics (1994) 49(1-3) 107-127
DOI: 10.1016/0166-218X(94)90204-6
402Citations
Citations of this article
161Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A fast branch and bound algorithm for the job-shop scheduling problem has been developed. Among other hard problems it solves the 10 × 10 benchmark problem which has been open for more than 20 years. We will give a complete description of this algorithm and will present computational results. © 1994.

Author supplied keywords

Cite

CITATION STYLE

APA

Brucker, P., Jurisch, B., & Sievers, B. (1994). A branch and bound algorithm for the job-shop scheduling problem. Discrete Applied Mathematics, 49(1–3), 107–127. https://doi.org/10.1016/0166-218X(94)90204-6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free