We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A two-agent single-machine scheduling problem with late work criteria.
- Authors
Wang, Du-Juan; Kang, Chao-Chung; Shiau, Yau-Ren; Wu, Chin-Chia; Hsu, Peng-Hsiang
- Abstract
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.
- Subjects
SCHEDULING; ALGORITHMS; DYNAMIC programming; MATHEMATICAL programming; SOFT computing
- Publication
Soft Computing - A Fusion of Foundations, Methodologies & Applications, 2017, Vol 21, Issue 8, p2015
- ISSN
1432-7643
- Publication type
Article
- DOI
10.1007/s00500-015-1900-5