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

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Journal of combinatorial optimization Ročník 41; číslo 1; s. 1 - 11
Hlavní autoři:	Mor, Baruch, Mosheiov, Gur, Shapira, Dana
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.01.2021 Springer Nature B.V
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!