Study on Single-Machine Group Scheduling with Due-Window Assignment and Position-Dependent Weights

Weiguo Liu, Xuyin Wang, Xiaoxiao Wang and Peizhen Zhao

Mathematical Problems in Engineering, 2021, vol. 2021, 1-8

Abstract:

This article considers a single-machine group scheduling problem with due-window assignment, where the jobs are classified into groups and the jobs in the same group must be processed in succession. The goal is to minimize the weighted sum of lateness and due-window assignment cost, where the weights depend on the position in which a job is scheduled (i.e., position-dependent weights). For the common, slack, and different due-window assignment methods, we prove that the problem can be solved polynomially, i.e., in time, where is the number of jobs.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2021/2232696.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2021/2232696.xml (text/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:jnlmpe:2232696

DOI: 10.1155/2021/2232696

Access Statistics for this article

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