Novel job based and machine based lower bound on makespan in jobshop scheduling problem

Authors:
Ali Kargarnejad;Mehdi Maneshi;Shahrdad Ezzatdoust
Affiliations:
Computer Engineering Department, Islamic Azad University, Tehran, Iran;Computer Engineering Department, Islamic Azad University, Tehran, Iran;Computer Engineering Department, Islamic Azad University, Tehran, Iran
Venue:
ISTASC'08 Proceedings of the 8th conference on Systems theory and scientific computation
Year:
2008

Citing 5
Cited 0

The shifting bottleneck procedure for job shop scheduling

Management Science
New search spaces for sequencing problems with application to job shop scheduling

Management Science
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Scheduling Algorithms

Scheduling Algorithms
Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Handbook of Scheduling: Algorithms, Models, and Performance Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, two new lower boundaries named Extended Machine-Based Lower Bound and Extended Job-Based Lower Bound on Jobshop scheduling problem with objective makespan function are being issued. In order to calculate the extended low boundaries, situations are being considered in which, that processing of operations by machine, is not possible. With making use of the given low boundaries, better estimation relative to optimized response can be obtained. No matter how much the low boundary is close to the real optimized boundary, the evaluation of obtained results from different algorithms will be carried out with more precision. Low Extended boundaries were computed on 80 available test problems. After computing extended low boundaries, they are compared with available boundaries; results show that on 55 percent of the available results cases had development relative to previous results.