A Bicriteria Single Machine Scheduling with Exponential Sum-of-Logarithm-Processing-Times Based Learning Effect

43979

In traditional scheduling problems, most literature assumes that the processing time of a job is fixed. However, there are many situations where the processing time of a job depends on the starting time or the position of the job in a sequence. In such situations, the actual processing time of a job may be more or less than its normal processing time if it is scheduled later. This phenomenon is known as the ‘‘learning effect’’. In this study, we introduce a exponential sum-of-logarithm-processing-times based learning effect into a single-machine scheduling problem. We consider the following objective function minimize maximum lateness subject to the number of tardy jobs A non-linear programming model are developed for problem. Also the model is tested on an example.

99

Single machine scheduling , bicriteria , exponential sum , of , logarithm , processing , times based learning effect , number of tardy , maximum lateness

Trakya university journal of engineering sciences

104

Trakya university journal of engineering sciences