Journal of the Operational Research Society

, Volume 60, Issue 12, pp 1759–1766

Branch-and-bound and weight-combination search algorithms for the total completion time problem with step-deteriorating jobs

Theoretical Paper

DOI: 10.1057/jors.2008.123

Cite this article as:
He, CC., Wu, CC. & Lee, WC. J Oper Res Soc (2009) 60: 1759. doi:10.1057/jors.2008.123

Abstract

In many real situations, it is found that if certain maintenance procedures fail to be completed prior to a pre-specified deterioration date, then the jobs will require extra time for successful completion. In this paper, a single-machine total completion time problem with step-deteriorating jobs is considered. A branch-and-bound method incorporated with several dominance properties and a lower bound is developed to derive the optimal solution for this problem. In addition, a weight-combination search algorithm is proposed to search for a near-optimal solution. Computational results indicate that the branch-and-bound algorithm can solve most of the problems with up to 24 jobs in a reasonable amount of time. Moreover, the proposed heuristic algorithm is accurate with mean deviations from the optimum value of less than 0.3%.

Keywords

scheduling single-machine step-deteriorating jobs total completion time 

Copyright information

© Palgrave Macmillan 2008

Authors and Affiliations

  1. 1.Feng Chia UniversityTaichungTaiwan

Personalised recommendations