A Note on Multimachine Scheduling with Weighted Early/Late Work Criteria and Common Due Date. (17th April 2021)

• Record Type: Journal Article
• Authors: Cao, Kerang; Chen, Xin; Choi, Kwang-nam; Liang, Yage; Miao, Qian; Zhang, Xingong
• Other Names: Sahin Bekir Academic Editor.
• Is Part Of: Mathematical problems in engineering. Volume 2021(2021)
• Publication Date: 2021-04-17
• Subjects: Engineering mathematics -- Periodicals; 510.2462
• DOI: 10.1155/2021/6611493
• Languages: English
• ISSNs: 1024-123X

Abstract

Abstract : In this note, we revisit two types of scheduling problem with weighted early/late work criteria and a common due date. For parallel identical machines environment, we present a dynamic programming approach running in pseudopolynomial time, to classify the considered problem into the set of binary NP-hard. We also propose an enumeration algorithm for comparison. For two-machine flow shop systems, we focus on a previous dynamic programming method, but with a more precise analysis, to improve the practical performance during its execution. For each model, we verify our studies through computational experiments, in which we show the advantages of our techniques, respectively.