A new interpolation-based polynomial algorithm for estimating lateness in single machine scheduling problem
IFAC-PapersOnLine(2022)
Abstract
This research extends the interpolation approach to approximating the objective function value for the minimization maximum lateness problem. The interpolation approach is defined using a special objective function L-max(alpha), which is proven to be continuous and depends only on a transform coefficient. Such a function is proven to be monotonically increasing, and this property is used in the presented modified interpolation polynomial algorithm which is used to estimate the approximation error. Copyright (C) 2022 The Authors.
MoreTranslated text
Key words
scheduling,optimization,interpolation,approximation,objective function
AI Read Science
Must-Reading Tree
Example
![](https://originalfileserver.aminer.cn/sys/aminer/pubs/mrt_preview.jpeg)
Generate MRT to find the research sequence of this paper
Chat Paper
Summary is being generated by the instructions you defined