Skip Navigation

The Computer Journal 1973 16(3):262-264; doi:10.1093/comjnl/16.3.262
© 1973 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 arrowRequest Permissions
Google Scholar
Right arrow Articles by Christofides, N.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Large scheduling problems with bivalent costs

N. Christofides *

Department of Management Science, Imperial College of Science and Technology, Exhibition Road, London, UK

Consider n items to be produced on one facility in a cyclic manner, and assume the costs of resetting the facility (so that an item can follow immediately after the completion of the previous one), to be bivalent (two-valued); i.e., either resetting of the facility is necessary and the cost is W, or no resetting is necessary and the cost is zero. The problem considered in this paper is that of scheduling the n items so as to minimise the total resetting cost incurred. This problem is a special case of the well known travelling salesman problem and could be solved as such, although only small size problems could be treated in this way. The present paper describes an alternative formulation of the problem in graph-theoretic terms, which enables the solution of large size problems (involving several hundreds or thousands of items). Computational results are given for six problems varying in size from 50 to 500 items.

Received April 1972.

* Department of Management Science, Imperial College of Science and Technology, Exhibition Road, London SW7 2BX


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.