Due-window assignment scheduling problems with position-dependent weights on a single machine. Issue 2 (1st February 2020)

• Record Type: Journal Article
• Authors: Wang, Ji-Bo; Zhang, Bo; Li, Lin; Bai, Danyu; Feng, Yu-Bo
• Is Part Of: Engineering optimization. Volume 52:Issue 2(2020)
• Page Start: 185
• Page End: 193
• Publication Date: 2020-02-01
• Subjects: Due-window assignment -- scheduling -- production planning -- sequencing; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2019.1577411
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This article deals with an integrated optimization problem of production scheduling and common due-window assignment on a single machine. The objective is to minimize the total cost, which is a weighted sum function of earliness and tardiness, due-window starting time, and due-window size, where the weights only depend on their position in a sequence ( i.e. position-dependent weights). A polynomial time solution algorithm is provided for the corresponding problem. The problem can also be extended to slack due-windows assignment and general position-dependent processing times. It is proved that both these extensions remain polynomially solvable.