Bibliographic Details
| Title: |
Study on Multiple Due-Windows Assignment Scheduling with Learning and Deteriorating Effects. |
| Authors: |
Song, Hai-Ruo1,2 (AUTHOR) songhairuo2020@163.com, Yang, Jia-Kun3 (AUTHOR) yjk0306@hnu.edu.cn, Wang, Ji-Bo1,2 (AUTHOR) wangjibo75@163.com |
| Source: |
Asia-Pacific Journal of Operational Research. Feb2026, p1. 28p. |
| Subject Terms: |
*Scheduling, *Mathematical optimization, *Production scheduling, Assignment problems (Programming), Learning curve, Computational complexity |
| Abstract: |
This paper focuses on the single-machine scheduling problems with multiple due-windows and learning and deteriorating effects, where the actual processing time of the job is a function of its starting time and position in a sequence. The aim is to minimize the weighted sum of the earliness, tardiness and the due-windows costs. Under common due-windows and slack due-windows, the optimal properties of the problems are analyzed and each of the above problems can be transformed into an assignment problem. An algorithm with a time complexity of O(n3) is presented, and the effectiveness of the algorithm is verified by an example, where n is the number of jobs. [ABSTRACT FROM AUTHOR] |
|
Copyright of Asia-Pacific Journal of Operational Research is the property of World Scientific Publishing Company and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.) |
| Database: |
Business Source Index |