IDEAS home Printed from https://ideas.repec.org/a/ids/ijmtma/v10y2007i2-3p247-260.html
   My bibliography  Save this article

A biological intelligent scheduling algorithm for scheduling with batch size and non-cutting time consideration

Author

Listed:
  • Yaqin Zhou
  • Beizhi Li
  • Jianguo Yang

Abstract

Non-cutting time or auxiliary time may not be ignored in solving job shop scheduling problems, which includes the time for transportation or transferring of job pieces and for adjustment of cutting tools and fixtures, etc. while considering batch that can also reduce the number of transporting and adjusting times. In this paper, a complicated scheduling problem is studied, which fully considers batch size, the available time of jobs and non-cutting time as the necessary operating conditions based on practical production. Firstly, a model of this problem is given, along with a biological immune algorithm for solving it. Then the key techniques for realising the intelligent algorithm are introduced, including the design of antibody encoding, the computation and optimisation method of the starting time of each job, and the operation of crossover and mutation. Results from the trial solutions of the problem with considerations of non-cutting time, batch size and multiconstraints show that the biological intelligent scheduling algorithm proposed is effective in solving this kind of scheduling problem.

Suggested Citation

  • Yaqin Zhou & Beizhi Li & Jianguo Yang, 2007. "A biological intelligent scheduling algorithm for scheduling with batch size and non-cutting time consideration," International Journal of Manufacturing Technology and Management, Inderscience Enterprises Ltd, vol. 10(2/3), pages 247-260.
    • Handle: RePEc:ids:ijmtma:v:10:y:2007:i:2/3:p:247-260
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=11852
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijmtma:v:10:y:2007:i:2/3:p:247-260. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=21 .

    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.