Printing Press Scheduling for Multi-Edition Periodicals
The problem of scheduling a printing press for a periodical with several editions, so as to minimize the costs, is discussed. A mixed-integer program is formulated which includes most of the costs and constraints, but it is not solvable for problem sizes of practical interests. A heuristic method, based on the traveling salesman problem, is proposed. A sample computation is included. In §3, a theorem proves that the' solution to the n-salesmen traveling salesman problem, is obtainable from the solution to a single salesman problem with n home visits.
Volume (Year): 16 (1970)
Issue (Month): 6 (February)
|Contact details of provider:|| Postal: |
Web page: http://www.informs.org/
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:inm:ormnsc:v:16:y:1970:i:6:p:b373-b383. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Mirko Janc)
If references are entirely missing, you can add them using this form.