The G-group heuristic for single machine lot scheduling

1987 ◽  
Vol 25 (3) ◽  
pp. 363-379 ◽  
Author(s):  
FAYEZ FOUAD BOCTOR
Keyword(s):  
Single Machine ◽  
Lot Scheduling

scholarly journals A Batching Machine Model for Lot Scheduling on a Single Machine

2018 ◽  
Vol 43 (1) ◽  
pp. 37-40
Author(s):  
Mikhail Y. Kovalyov
Keyword(s):  
Single Machine ◽  
Completion Time ◽  
Optimal Solution ◽  
Time Algorithm ◽  
Machine Model ◽  
Average Completion Time ◽  
Lot Scheduling ◽  
Batching Machine ◽  
Machine Problem ◽  
Total Average

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

Lot scheduling on a single machine

2014 ◽  
Vol 114 (12) ◽  
pp. 718-722 ◽  
Author(s):  
Yung-Tsung Hou ◽  
Dar-Li Yang ◽  
Wen-Hung Kuo
Keyword(s):  
Single Machine ◽  
Lot Scheduling

scholarly journals Note—A Note on the Single-Machine Multi-Product Lot Scheduling Problem

1976 ◽  
Vol 22 (8) ◽  
pp. 909-912 ◽  
Author(s):  
Robert W. Haessler ◽  
Steven L. Hogue
Keyword(s):  
Single Machine ◽  
Scheduling Problem ◽  
Lot Scheduling
Sign in / Sign up

Export Citation Format

Share Document