Single machine lot scheduling with optional job-rejection

We consider single machine lot scheduling problems. A number of customer orders of different sizes may be processed in the same lot. Splitting orders between consecutive lots is allowed. Three scheduling measures are considered: makespan, total completion time and total weighted completion time. In...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Journal of combinatorial optimization Jg. 41; H. 1; S. 1 - 11
Hauptverfasser:	Mor, Baruch, Mosheiov, Gur, Shapira, Dana
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York Springer US 01.01.2021 Springer Nature B.V
Schlagworte:	Algorithms Combinatorics Completion time Convex and Discrete Geometry Dynamic programming Job shops Mathematical Modeling and Industrial Mathematics Mathematics Mathematics and Statistics Operations Research/Decision Theory Optimization Polynomials Rejection Scheduling Theory of Computation Upper bounds Lot scheduling Dynamic programming Order rejection Single machine
ISSN:	1382-6905, 1573-2886
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!