A Batching Machine Model for Lot Scheduling on a Single Machine
2018
artykuł naukowy
angielski
- scheduling
- lot-sizing
- single machine
- batching machine
- polynomial time algorithm
EN A recently introduced lot scheduling problem is considered. It is to find a partition of jobs of n orders into lots and to sequence these lots on a single machine so that the total average completion time of the orders is minimized. A simple O (n log n) time algorithm is presented for this problem in the literature, with a relatively sophisticated proof of its optimality. We show that modeling this problem as a classic batching machine problem makes its optimal solution obvious.
37 - 40
CC BY-NC-ND (uznanie autorstwa - użycie niekomercyjne - bez utworów zależnych)
publiczny
15
15