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

Comments on the Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem

Author

Listed:
  • Chen Shaoxiang

    (Departement voor Toegepaste, Economische Wetenshappen, Katholieke Universiteit Leuven, Dekenstraat 2, 3000 Leuven, Belgium)

Abstract

One of the necessary and sufficient conditions derived by F. F. Boctor (1982) for feasibility of a repetitive two-product schedule is that the cycle times (T 1 and T 2 ) must be integer multiples of some time interval T (Propositions 2, 3 and 4). This result also holds for N-product schedules. However, the proof for Propositions 3 and 4 in [1] is not exactly valid and therefore a correction has to be made.

Suggested Citation

  • Chen Shaoxiang, 1993. "Comments on the Two-Product, Single-Machine, Static Demand, Infinite Horizon Lot Scheduling Problem," Management Science, INFORMS, vol. 39(3), pages 387-388, March.
    • Handle: RePEc:inm:ormnsc:v:39:y:1993:i:3:p:387-388
    DOI: 10.1287/mnsc.39.3.387
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/mnsc.39.3.387
    Download Restriction: no
    File URL: https://libkey.io/10.1287/mnsc.39.3.387?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
    ---><---

    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:39:y:1993:i:3:p:387-388. 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.