Published Feb 24, 2015
Derya Deliktas Orhan Torkul Ozden Ustun Safak Kiris


This study proposes a multi-choice goal programming for the single machine scheduling problem of minimizing the weighted number of tardy jobs, the total weighted completion time and makespan with sequence-dependent setup times. In this problem, there are n candidate jobs for processing in a single machine, each job has a weight, a due date, a processing time, and also sequence-dependent setup times exist between two consecutive jobs. In the first stage of the proposed methodology, the job weights of each job are determined by using the Analytic Hierarchy Process (AHP) method. In the second stage, a 0-1 mixed integer non-linear programming model is built by considering three objective functions and the ideal point is obtained by minimizing the objectives individually. Then, the multi-choice goal programming is used to allow the decision makers to set multi-choice aspiration levels for each goal.



Download data is not yet available.



AHP, single machine scheduling problem, sequence-dependent setup times, Multi-choice goal programming, 0-1 mixed integer non-linear programming model

How to Cite
Deliktas, D., Torkul, O., Ustun, O., & Kiris, S. (2015). AN INTEGRATED APPROACH FOR SINGLE MACHINE SCHEDULING WITH SEQUENCE-DEPENDENT SETUP TIMES. International Journal of the Analytic Hierarchy Process, 7(1). https://doi.org/https://doi.org/10.13033/ijahp.v7i1.291