Skip Navigation

The Computer Journal 1968 11(1):48-56; doi:10.1093/comjnl/11.1.48
© 1968 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrow Search for citing articles in:
ISI Web of Science (2)
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Nicholson, T. A. J.
Right arrow Articles by Pullen, R. D.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

A permutation procedure for job-shop scheduling

T. A. J. Nicholson and R. D. Pullen *

Mathematics Branch, A.E.R.E., Harwell, Didcot, UK

A new method is proposed for scheduling jobs through a factory. The jobs consist of a sequence of operations, each operation requiring a number of resources of different types. The objective is to plan the start times of the operations so as to minimise the cost the jobs being late, subject to the sequence constraints being satisfied and the demand for resources not exceeding the supply. The problem is formulated in terms of optimising a permutation, and conditions for a locally optimal permutation are defined. A procedure is described for obtaining such locally optimal permutations and subsequent results show significant improvements over heuristic techniques such as the shortest operation and least slack rules.


* Mathematics Branch, A.E.R.E., Harwell, Didcot, Berkshire.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.