Single machine scheduling with slack due dates assignment. Issue 4 (3rd April 2017)

• Record Type: Journal Article
• Authors: Liu, Weiguo; Hu, Xiangpei; Wang, Xuyin
• Is Part Of: Engineering optimization. Volume 49:Issue 4(2017)
• Page Start: 709
• Page End: 717
• Publication Date: 2017-04-03
• Subjects: Scheduling -- single machine -- polynomial time algorithm -- due date assignment; Engineering design -- Periodicals; Mathematical optimization -- Periodicals; 620.0042
• DOI: 10.1080/0305215X.2016.1197611
• Languages: English
• ISSNs: 0305-215X

Abstract

ABSTRACT: This paper considers a single machine scheduling problem in which each job is assigned an individual due date based on a common flow allowance ( i.e. all jobs have slack due date). The goal is to find a sequence for jobs, together with a due date assignment, that minimizes a non-regular criterion comprising the total weighted absolute lateness value and common flow allowance cost, where the weight is a position-dependent weight. In order to solve this problem, an time algorithm is proposed. Some extensions of the problem are also shown.