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

Li-Yan Wang | Zendy; Mengqi Liu | Zendy; JiBo Wang | Zendy; Yuan-Yuan Lu | Zendy; Weiwei Liu | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

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

Author(s) -

Li-Yan Wang,

Mengqi Liu,

JiBo Wang,

Yuan-Yuan Lu,

Weiwei Liu

Publication year - 2021

Publication title -

complexity

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.447

H-Index - 61

eISSN - 1099-0526

pISSN - 1076-2787

DOI - 10.1155/2021/6656261

Subject(s) - scheduling (production processes) , assignment problem , due date , combinatorics , mathematics , computer science , algorithm , mathematical optimization , schedule , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research