Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology. (5th March 2021)

• Record Type: Journal Article
• Authors: Wang, Li-Yan; Liu, Mengqi; Wang, Ji-Bo; Lu, Yuan-Yuan; Liu, Wei-Wei
• Other Names: Xie Lei Academic Editor.
• Is Part Of: Complexity. Volume 2021(2021)
• Publication Date: 2021-03-05
• Subjects: Chaotic behavior in systems -- Periodicals; Complexity (Philosophy) -- Periodicals; 003
• DOI: 10.1155/2021/6656261
• Languages: English
• ISSNs: 1076-2787

Abstract

Abstract : In this paper, the single-machine scheduling problem is studied by simultaneously considering due-date assignment and group technology (GT). 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 (CON) due-date assignment, slack (SLK) due-date assignment, and different (DIF) due-date assignment, an O n log n time algorithm is proposed, respectively, to solve the problem, where n is the number of jobs.