THE SINGLE-MACHINE MULTI-PRODUCT PROBLEM: NEAR OPTIMAL SCHEDULING
MAKROUM, H. (1984). THE SINGLE-MACHINE MULTI-PRODUCT PROBLEM: NEAR OPTIMAL SCHEDULING. EKB Journal Management System, 2(1st Conference on Applied Mechanical Engineering.), 135-141. doi: 10.21608/amme.1984.50314
HANY A. MAKROUM. "THE SINGLE-MACHINE MULTI-PRODUCT PROBLEM: NEAR OPTIMAL SCHEDULING". EKB Journal Management System, 2, 1st Conference on Applied Mechanical Engineering., 1984, 135-141. doi: 10.21608/amme.1984.50314
MAKROUM, H. (1984). 'THE SINGLE-MACHINE MULTI-PRODUCT PROBLEM: NEAR OPTIMAL SCHEDULING', EKB Journal Management System, 2(1st Conference on Applied Mechanical Engineering.), pp. 135-141. doi: 10.21608/amme.1984.50314
MAKROUM, H. THE SINGLE-MACHINE MULTI-PRODUCT PROBLEM: NEAR OPTIMAL SCHEDULING. EKB Journal Management System, 1984; 2(1st Conference on Applied Mechanical Engineering.): 135-141. doi: 10.21608/amme.1984.50314

THE SINGLE-MACHINE MULTI-PRODUCT PROBLEM: NEAR OPTIMAL SCHEDULING

The International Conference on Applied Mechanics and Mechanical Engineering
Article 49, Volume 2, 1st Conference on Applied Mechanical Engineering., May 1984, Page 135-141  XML PDF (1.42 MB)
Document Type: Original Article
DOI: 10.21608/amme.1984.50314
View on SCiNiTO View on SCiNiTO
Author
HANY A. MAKROUM
Lecturer, Dpt.of Production Engineering,Helwan University, Cairo,Egypt.
Abstract
An iterative procedure is presented for determining near optimal production schedule in the single-machine multi-product lot sizing problem. The approach does not require equal lot sizes, and based on finding a feasible solution (lower bound).
Two examples from the previous literature indicated that cancelling the restriction of equal lot sizes may provide a
chance for producing better solutions.
Statistics
Article View: 115
PDF Download: 184