A Bicriterion Approach to Due Date Assignment Scheduling in Single-Machine with Position-Dependent Weights

We study single-machine bicriteria scheduling problems with position-dependent weights. Due date costs and penalty costs can affect the decision-maker’s profit. Therefore, how to optimize the benefits and balance of these costs for decision-makers is the focus of this research. This paper discusses...

Full description

Saved in:
Bibliographic Details
Published in:Asia-Pacific journal of operational research 2023-04, Vol.40 (2)
Main Authors: Sun, Xinyu, Geng, Xin-Na, Wang, Jiayin, Liu, Tao
Format: Article
Language:English
Subjects:
Algorithms
Decision making
Operations research
Optimization
Polynomials
Scheduling
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study single-machine bicriteria scheduling problems with position-dependent weights. Due date costs and penalty costs can affect the decision-maker’s profit. Therefore, how to optimize the benefits and balance of these costs for decision-makers is the focus of this research. This paper discusses three models: weighted-sum scheduling problem, constrained scheduling problem, Pareto scheduling problem. It analyzes the properties of bicriteria schedule, determines the optimal due dates (usually referred to as different due dates: DIF), and gives the corresponding polynomial solvable algorithms.
ISSN:0217-5959
1793-7019
0217-5959
DOI:10.1142/S021759592250018X