Local search methods for a single machine scheduling problem

Main Article Content

Asst.Instructor.Adawiyah A. Mahmood
Asst.Instructor.Khalid H. AL- Jourany

Abstract

The problem of scheduling jobs on a single machine to minimize the weighted sum of squares completion time is considered .Al-Salihi used a branch and bound method to minimize the weighted sum of squares completion time. In this research we discuss and apply some known local search methods , namely the adjacent pairwise interchange method (APIM) and descent method (DM) . The performance of local search methods can be tested on large class of test problems.

Downloads

Download data is not yet available.

Article Details

Section

بحـــــــوث العــــــدد

How to Cite

Local search methods for a single machine scheduling problem. (2022). Diyala Journal for Human Researches, 1(36). https://doi.org/10.57592/djhr.v1i36.1675