By Topic

Algebraic, mathematical programming, and network models of the deterministic job-shop scheduling problem

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

2 Author(s)
Rogers, R.V. ; Dept. of Ind. Eng. & Manage. Syst., Univ. of Central Florida, Orlando, FL, USA ; White, K.P., Jr.

In the contemporary literature on deterministic machine scheduling, problems are formulated from three different, but equivalent, perspectives. Algebraic models provide a rigorous problem statement in the language of set theory and are typical of the more abstract development of scheduling theory in mathematics and computer science. Mathematical programming models rely on familiar concepts of nonlinear optimization and are generally the most accessible. Network models (disjunctive graphs) are best suited to the development of solution approaches and figure prominently in discussions of algorithm design and analysis. In this tutorial, it is shown how the minimum-makespan job-shop problem (n/m/G/Cmax) is realized in each of these three model forms. A common notation is developed and how the underlying structure and fundamental difficulty of the problem are expressed in each model is demonstrated

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:21 ,  Issue: 3 )