A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs |
| |
Authors: | M. Duran Toksarı |
| |
Affiliation: | Erciyes University, Engineering Faculty, Industrial Engineering Department, Kayseri, Turkey |
| |
Abstract: | We present a single-machine problem with the unequal release times under learning effect and deteriorating jobs when the objective is minimizing the makespan. In this study, we introduced a scheduling model with unequal release times in which both job deterioration and learning exist simultaneously. By the effects of learning and deterioration, we mean that the processing time of a job is defined by increasing function of its execution start time and position in the sequence. A branch-and-bound algorithm incorporating with several dominance properties and lower bounds is developed to derive the optimal solution. A heuristic algorithm is proposed to obtain a near-optimal solution. The computational experiments show that the branch-and-bound algorithm can solve instances up to 30 jobs, and the average error percentage of the proposed heuristic is less than 0.16%. |
| |
Keywords: | Scheduling Single machine scheduling Learning effect Deterioration jobs Release times Makespan |
本文献已被 ScienceDirect 等数据库收录! |
|