Heuristics for single machine scheduling problem with family setup times
by Yunfang Peng; Yajuan Han; Yuyan Xiao; Saif Ullah
International Journal of Computing Science and Mathematics (IJCSM), Vol. 8, No. 2, 2017

Abstract: Grouping of jobs from the same family on bottleneck resource is significant to reduce setup time of jobs. But, the grouping may result in delay of jobs. How to balance the contradiction between utilisation of bottleneck resource and delivery time is a great challenge in production scheduling. This paper considers a single machine scheduling problem in which each job to be scheduled belongs to a family and family setup times exist. This paper is aimed to identify a schedule of families of jobs to minimise total tardiness with respect to the given due dates of the jobs. A mathematical model is formulated for this problem and a heuristic solution approach is presented. Computational experiments show that the proposed heuristic algorithm performs better both in terms of solution quality and computational time.

Online publication date: Fri, 21-Apr-2017

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 Computing Science and Mathematics (IJCSM):
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