By Topic

Comments on "A practical approach to job shop scheduling problems" [with reply]

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Ramaswamy, S. ; Dept. of Ind. & Manage. Syst. Eng., Pennsylvania State Univ., University Park, PA, USA ; Hoitomt, D.J. ; Luh, P.B.

The author states that, in the original paper (D.L. Hoitomt and P.B. Luh ibid., vol. 9, no. 1, p. 1-13, 1993), the model formulation of the scheduling problem is highly irregular. If one were to consider the formulation by itself it would seem that since neither the precedence nor processing time constraints are linked to time, we could set all /spl delta//sub ijkh/=0 and obtain a feasible solution with jobs overlapping on machines. It is noted that in the subsequent relaxation of the capacity constraint, the binary variables have been set to 1 from start to finish time of the corresponding operation to account for capacity. The need for the model formulation to include such constraints explicitly is discussed, and the original authors discuss the relevance of the comments. The existence of related and similar results in previous works is also considered.<>

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:11 ,  Issue: 3 )