![Sample our Engineering & Technology journals, sign in here to start your access, latest two full volumes FREE to you for 14 days]({"type":"image" , "src" : "/sda/5933/TOC-Subject-Sample-2021-Engineering-Tech.jpg"})
ABSTRACT
In this research, we look the setup, processing, and removal times as separatable, then take the sequence-independent setup and dependent removal times into account when deal with an open shop scheduling problem with the objective to minimize the total job tardiness. The addressed problem is first described as a 0-1 integer programming model, and following, a simulated annealing based heuristic is proposed to get an near optimal schedule in a reasonable computation time. During the research, the parameters used in the heuristics that affect the solution quality and efficiency are analyzed and designed; then for the constructed heuristic, a good parameter setting is suggested. The experimental results are reported, and provided for the references for the further research.