A note: flowshop scheduling with linear deterioration and job-rejection

We study a scheduling problem on an m -machine flowshop with linear deterioration of job processing times and job rejection. The objectives are minimum makespan and minimum total load, subject to an upper bound on the total permitted rejection cost. The problems are NP-hard (since the single machine...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	4OR Ročník 19; číslo 1; s. 103 - 111
Hlavní autori:	Mor, Baruch, Mosheiov, Gur
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2021 Springer Nature B.V
Predmet:	Algorithms Business and Management Dynamic programming Flow control Industrial and Production Engineering Operations research Operations Research/Decision Theory Optimization Polynomials Rejection Research Paper Scheduling Upper bounds 90B35 Deterministic scheduling theory in operations research Scheduling Job-rejection Flowshop Dynamic programming Linear deterioration
ISSN:	1619-4500, 1614-2411
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!