Bounded mixed batch scheduling with job release dates and rejection

This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs that their number does not exceed the machine capacity. For the case with a certain release date, we present a polynomial-time exact algorithm....

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Operations research letters Ročník 57; s. 107159
Hlavní autori: Xu, Jun, Huang, Yong-Xing, Zhang, Daxing, Lin, Ran, Fan, Guo-Qiang
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.11.2024
Predmet:
Approximation algorithm
Exact algorithm
Mixed batch scheduling
Polynomial-time approximation scheme
Rejection penalty
Mixed batch scheduling
Exact algorithm
Approximation algorithm
Polynomial-time approximation scheme
Rejection penalty
ISSN:0167-6377
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper investigates a bounded mixed batch scheduling problem with job release dates and rejection. The machine processes a batch containing several jobs that their number does not exceed the machine capacity. For the case with a certain release date, we present a polynomial-time exact algorithm. For the case with a constant number of release dates, a pseudo-polynomial-time exact algorithm is proposed. For the general problem, we provide a 2-approximation algorithm and a polynomial-time approximation scheme. •We investigate a bounded mixed batch scheduling problem with job release dates and rejection penalty.•We present a polynomial-time exact algorithm and a pseudo-polynomial time exact algorithm for two special cases.•For the general problem, we devise a 2-approximation algorithm and a polynomial-time approximation scheme.
ISSN:0167-6377
DOI:10.1016/j.orl.2024.107159