A Batching Machine Model for Lot Scheduling on a Single Machine

A Batching Machine Model for Lot Scheduling on a Single Machine

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

Full description

Bibliographic Details
Main Author: Kovalyov Mikhail Y.
Format: Article
Language:English
Published: Sciendo 2018-03-01
Series:Foundations of Computing and Decision Sciences
Subjects:
scheduling
lot-sizing
single machine
batching machine
polynomial time algorithm
Online Access:https://doi.org/10.1515/fcds-2018-0003

Similar Items

Similar Items