Title: Heuristics for single machine scheduling problem with family setup times

Authors: Yunfang Peng; Yajuan Han; Yuyan Xiao; Saif Ullah

Addresses: School of Management, Shanghai University, Shanghai, China ' School of Management, Shanghai University, Shanghai, China ' School of Management, Shanghai University, Shanghai, China ' Department of Industrial Engineering, School of Mechanical Science and Engineering, Huazhong University of Science and Technology, Wuhan, China

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.

Keywords: single machine scheduling; family; setup time; tardiness; heuristic algorithm.

DOI: 10.1504/IJCSM.2017.083755

International Journal of Computing Science and Mathematics, 2017 Vol.8 No.2, pp.166 - 174

Received: 08 Jul 2016
Accepted: 06 Dec 2016
Published online: 21 Apr 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article