Niğde Ömer Halisdemir Üniversitesi Mühendislik Bilimleri Dergisi

Yazarlar: Gül Didem BATUR SİR

Konular:Endüstri Mühendisliği

DOI:10.28948/ngumuh.536457

Anahtar Kelimeler:Machine scheduling,Rate modifying activity,Shortest path algorithm,Integer programming

Özet:    In this study, scheduling of jobs and a rate modifying activity (RMA) on a single machine system is considered. A RMA is defined as a maintenance activity applied to bring production speed of the machine back to its original state. From this point of view, when a job is planned before or after the RMA, processing times of the jobs become different. The problem addressed is determination of the job sequence and the position of the RMA in this sequence. A shortest path-based method which is based on network representation is developed for the solution. In the proposed method, a network is created in the first step according to the job sequence obtained by the Shortest Processing Time algorithm. RMA assignment that gives the shortest path on the network is then searched using linear programming and the value of the found path gives total completion time for the machine. After this, using local search procedure, swap operation (binary exchange) is applied on the job positions at each step and final solution is obtained as a result of continuous comparisons on new solutions obtained.

---