A biological intelligent scheduling algorithm for scheduling with batch size and non-cutting time consideration
by Yaqin Zhou, Beizhi Li, Jianguo Yang
International Journal of Manufacturing Technology and Management (IJMTM), Vol. 10, No. 2/3, 2007

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.

Online publication date: Thu, 28-Dec-2006

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Manufacturing Technology and Management (IJMTM):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com