A new perspective on single-machine scheduling problems with late work related criteria

This paper provides two new perspectives on single-machine scheduling problems in which the objective involves penalties regarding late work. Both of this perspectives have been neglected in the previous literature. We begin by presenting a parameterized complexity analysis of the N P -hard problem...

Full description

Saved in:

Bibliographic Details
Published in:	Annals of operations research Vol. 322; no. 2; pp. 947 - 966
Main Author:	Shabtay, Dvir
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.03.2023 Springer Nature B.V
Subjects:	Algorithms Business and Management Combinatorial analysis Combinatorics Cost function Fines & penalties Operations research Operations Research/Decision Theory Original Research Parameters Polynomials Scheduling Theory of Computation Upper bounds Late work Scheduling Single machine Parameterized complexity Due date assignment
ISSN:	0254-5330, 1572-9338
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!