Scheduling with assignable due dates, two competing agents and late work related criteria

This paper investigates several scheduling problems on a single machine that exhibit three key features: (i) assignable due dates are considered, meaning that a predefined set of due dates is provided, and these due dates can be assigned to the jobs independently and arbitrarily; (ii) two competing...

Full description

Saved in:
Bibliographic Details
Published in:Computers & operations research Vol. 182; p. 107144
Main Authors: Li, Shi-Sheng, Sang, Yao-Wen, Chen, Ren-Xia, Sterna, Malgorzata, Kis, Tamas
Format: Journal Article
Language:English
Published: Elsevier Ltd 01.10.2025
Subjects:
ISSN:0305-0548
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first