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

Full description

Saved in:

Bibliographic Details
Published in:	Journal of combinatorial optimization Vol. 41; no. 1; pp. 1 - 11
Main Authors:	Mor, Baruch, Mosheiov, Gur, Shapira, Dana
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.01.2021 Springer Nature B.V
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!