Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4628739 | Applied Mathematics and Computation | 2013 | 15 Pages |
Abstract
Recently, machine scheduling problems with deteriorating jobs have received more attention from the scheduling research community. In this paper we consider a single-machine scheduling problem with a linear deteriorating effect and unequal release times. The objective is to minimize the total tardiness. We propose a branch-and-bound algorithm incorporating with several dominance properties and two lower bounds to search for the optimal solution. In addition, we propose a marriage in honey-bees optimization algorithm (MBO) to provide a near-optimal solution. The computational experiment is also conducted to evaluate the impacts of the parameters over the performances of the proposed algorithms.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Chin-Chia Wu, Shuenn-Ren Cheng, Wen-Hsiang Wu, Yunqiang Yin, Wen-Hung Wu,