Single two-stage openshop and parallel two-stage openshops scheduling with optional job rejection under makespan constraint

We consider a scheduling scenario on single two-stage openshop and parallel two-stage openshops where there is an upper bound on the makespan of the scheduled jobs. For each job, in the first version one will get a profit if the job is accepted to be processed while in the second version one will ne...

Full description

Bibliographic Details

Published in:	Computers & industrial engineering Vol. 212; p. 111695
Main Authors:	Guo, Yanjie, Luo, Wenchang, Xu, Dehua
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.02.2026
Subjects:	Job rejection Makespan constraint Polynomial time approximation scheme Scheduling Single two-stage openshop and parallel two-stage openshops Polynomial time approximation scheme Scheduling Single two-stage openshop and parallel two-stage openshops Makespan constraint Job rejection
ISSN:	0360-8352
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!