Solution Algorithms for Single-Machine Group Scheduling with Learning Effect and Convex Resource Allocation. (3rd March 2021)

• Record Type: Journal Article
• Authors: Wang, Wanlei; Wang, Jian-Jun; Wang, Ji-Bo
• Other Names: Xie Lei Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-03-03
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/6615824
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : 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.