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

Uložené v:

Podrobná bibliografia
Vydané v:	Computers & industrial engineering Ročník 212; s. 111695
Hlavní autori:	Guo, Yanjie, Luo, Wenchang, Xu, Dehua
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier Ltd 01.02.2026
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Popis
Shrnutí:	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 need to pay a cost if it is rejected to be processed. For the objective of maximizing the total profit of the accepted jobs, we first derive a polynomial time approximation scheme based on guessing strategy and linear program rounding technique for the case of single openshop and then we also propose a polynomial time approximation scheme for the case of a fixed number of openshops by more involved guessing strategy and linear program rounding technique. For the objective of minimizing the total cost of the rejected jobs, in the case of single openshop we address a polynomial time approximation scheme and in the case of a fixed number of openshops we develop a pseudo-polynomial time dynamic programming exact algorithm and present a super-optimal dual fully polynomial time approximation scheme. •The work is motivated by the outsourcing practice in make-to-order scenarios.•Both single openshop case and parallel openshops case are considered.•It focuses on profit maximizing and cost minimization rather than time oriented traditional criteria.•PTASes and super-optimal dual FPTAS on the considered problems are proposed.•It gives production managers more flexibility when handling job outsourcing issues.
ISSN:	0360-8352
DOI:	10.1016/j.cie.2025.111695