In this paper, the single-machine scheduling problem is studied by simultaneously considering due-date assignment and group technology. The objective is to determine the optimal sequence of groups and jobs within groups and optimal due-date assignment to minimize the weighted sum of the absolute value in lateness and due-date assignment cost, where the weights are position dependent. For the common due-date assignment, slack due-date assignment, and different due-date assignment, an O n log n time algorithm is proposed, respectively, to solve the (...) problem, where n is the number of jobs. (shrink)

This paper deals with a single-machine resource allocation scheduling problem with learning effect and group technology. Under slack due-date assignment, our objective is to determine the optimal sequence of jobs and groups, optimal due-date assignment, and optimal resource allocation such that the weighted sum of earliness and tardiness penalties, common flow allowances, and resource consumption cost is minimized. For three special cases, it is proved that the problem can be solved in polynomial time. To solve the general case of problem, (...) the heuristic, tabu search, and branch-and-bound algorithms are proposed. (shrink)