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

Celý popis

Podrobná bibliografie

Vydáno v:	Computers & industrial engineering Ročník 212; s. 111695
Hlavní autoři:	Guo, Yanjie, Luo, Wenchang, Xu, Dehua
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier Ltd 01.02.2026
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!