Single-machine common/slack due window assignment problems with linear decreasing processing times. Issue 8 (3rd August 2017)

• Record Type: Journal Article
• Authors: Zhang, Xingong; Lin, Win-Chin; Wu, Wen-Hsiang; Wu, Chin-Chia
• Is Part Of: Engineering optimization. Volume 49:Issue 8(2017)
• Page Start: 1388
• Page End: 1400
• Publication Date: 2017-08-03
• Subjects: Scheduling -- single machine -- due window assignment; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2016.1248180
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This paper studies linear non-increasing processing times and the common/slack due window assignment problems on a single machine, where the actual processing time of a job is a linear non-increasing function of its starting time. The aim is to minimize the sum of the earliness cost, tardiness cost, due window location and due window size. Some optimality results are discussed for the common/slack due window assignment problems and two O( n log n ) time algorithms are presented to solve the two problems. Finally, two examples are provided to illustrate the correctness of the corresponding algorithms.