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

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 308; no. 3; pp. 1074 - 1090
Main Authors:	Geng, Zhichao, Yuan, Jinjiang
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.08.2023
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!