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...

Celý popis

Podrobná bibliografia

Vydané v:	Computers & operations research Ročník 182; s. 107144
Hlavní autori:	Li, Shi-Sheng, Sang, Yao-Wen, Chen, Ren-Xia, Sterna, Malgorzata, Kis, Tamas
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.10.2025
Predmet:	Assignable due dates Late work Scheduling Single machine Two-agent Two-agent Late work Scheduling Assignable due dates Single machine
ISSN:	0305-0548
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!