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

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Computers & industrial engineering Jg. 212; S. 111695
Hauptverfasser:	Guo, Yanjie, Luo, Wenchang, Xu, Dehua
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier Ltd 01.02.2026
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!