Single-machine scheduling of multiple projects with controllable processing times

•The single-machine multiple-project scheduling problems.•The processing times of jobs are controllable.•The processing cost of a project includes total compression cost and total tardiness cost of its jobs.•Two types of problems are considered: Sum problem and Restricted problem. This paper studies...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 308; H. 3; S. 1074 - 1090
Hauptverfasser:	Geng, Zhichao, Yuan, Jinjiang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.08.2023
Schlagworte:	Compression cost Controllable processing times Multiple projects Pseudo-polynomial algorithm Scheduling Pseudo-polynomial algorithm Scheduling Controllable processing times Multiple projects Compression cost
ISSN:	0377-2217, 1872-6860
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!