سال انتشار: ۱۳۹۱

محل انتشار: هشتمین کنفرانس بین المللی مهندسی صنایع

تعداد صفحات: ۵

نویسنده(ها):

o Kheirandish – College of Engineering, University ofTehran
r Tavakkoli-Moghaddam –
m Karimi-Nasab – Iran University of Science & Technology

چکیده:

This paper considers single machine production scheduling problem (SMPSP) with multi products in the case of dealing with the compressible processing time. All processingtimes are unknown variables, in which the only known information is the lower and upper bounds processing times ofeach job. The processing time for each product is considered as a decision variable that can include different amounts of time caused by fluctuation in the batch size. The objective of thepresented model is to determine the quantity of batches and the size of each batch in order to minimize the total weighted tardiness and earliness