Optimization for Due-Date Assignment Single-Machine Scheduling under Group Technology

Li-Yan Wang, Mengqi Liu, Ji-Bo Wang, Yuan-Yuan Lu, Wei-Wei Liu and Lei Xie

Complexity, 2021, vol. 2021, 1-9

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 On  log  n time algorithm is proposed, respectively, to solve the problem, where n is the number of jobs.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/6656261.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/6656261.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:6656261

DOI: 10.1155/2021/6656261

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().