Preprint
Article

An Interpolation-Based Polynomial Method of Estimating the Objective Function Value in Scheduling Problems of Minimizing the Maximum Lateness

Submitted:

06 November 2021

Posted:

09 November 2021

You are already at the latest version

Abstract
An approach to estimating the objective function value of minimization maximum lateness problem is proposed. It is shown how to use transformed instances to define a new continuous objective function. After that, using this new objective function, the approach itself is formulated. We calculate the objective function value for some polynomially solvable transformed instances and use them as interpolation nodes to estimate the objective function of the initial instance. What is more, two new polynomial cases, that are easy to use in the approach, are proposed. In the end of the paper numeric experiments are described and their results are provided.
Keywords: 
discrete mathematics; scheduling; optimization; interpolation; approximation; objective function.
Subject: 
Computer Science and Mathematics  -   Mathematics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.

Downloads

182

Views

166

Comments

0

Subscription

Notify me about updates to this article or when a peer-reviewed version is published.

Email

Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2025 MDPI (Basel, Switzerland) unless otherwise stated