A two-agent single-machine scheduling problem with late work criteria
- First Online:
- Cite this article as:
- Wang, DJ., Kang, CC., Shiau, YR. et al. Soft Comput (2017) 21: 2015. doi:10.1007/s00500-015-1900-5
- 166 Downloads
This paper addresses a two-agent scheduling problem where the objective is to minimize the total late work of the first agent, with the restriction that the maximum lateness of the second agent cannot exceed a given value. Two pseudo-polynomial dynamic programming algorithms are presented to find the optimal solutions for small-scale problem instances. For medium- to large-scale problem instances, a branch-and-bound algorithm incorporating the implementation of a lower bounding procedure, some dominance rules and a Tabu Search-based solution initialization, is developed to yield the optimal solution. Computational experiments are designed to examine the efficiency of the proposed algorithms and the impacts of all the relative parameters.