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

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	4OR Jg. 19; H. 1; S. 103 - 111
Hauptverfasser:	Mor, Baruch, Mosheiov, Gur
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2021 Springer Nature B.V
Schlagworte:	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
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!