IDEAS home Printed from https://ideas.repec.org/a/inm/ormnsc/v16y1970i6pb373-b383.html
   My bibliography  Save this article

Printing Press Scheduling for Multi-Edition Periodicals

Author

Listed:
  • Samuel Gorenstein

    (IBM, New York Scientific Center)

Abstract

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.

Suggested Citation

  • Samuel Gorenstein, 1970. "Printing Press Scheduling for Multi-Edition Periodicals," Management Science, INFORMS, vol. 16(6), pages 373-383, February.
    • Handle: RePEc:inm:ormnsc:v:16:y:1970:i:6:p:b373-b383
    DOI: 10.1287/mnsc.16.6.B373
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.16.6.B373
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.16.6.B373?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Tamás Kalmár-Nagy & Giovanni Giardini & Bendegúz Dezső Bak, 2017. "The Multiagent Planning Problem," Complexity, Hindawi, vol. 2017, pages 1-12, February.
    2. Yuan, Shuai & Skinner, Bradley & Huang, Shoudong & Liu, Dikai, 2013. "A new crossover approach for solving the multiple travelling salesmen problem using genetic algorithms," European Journal of Operational Research, Elsevier, vol. 228(1), pages 72-82.
    3. B. Madhu Rao & Petros Xanthopoulos & Qipeng Phil Zheng, 2020. "Case Article—DeLand Crayon Company: An Application of the Traveling Salesman Problem to Production Scheduling with Sequence-Dependent Setup Times," INFORMS Transactions on Education, INFORMS, vol. 20(2), pages 93-98, January.
    4. Bektas, Tolga, 2006. "The multiple traveling salesman problem: an overview of formulations and solution procedures," Omega, Elsevier, vol. 34(3), pages 209-219, June.
    5. Kara, Imdat & Bektas, Tolga, 2006. "Integer linear programming formulations of multiple salesman problems and its variations," European Journal of Operational Research, Elsevier, vol. 174(3), pages 1449-1458, November.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. 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.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.