Universal Journal of Industrial and Business Management(CEASE PUBLICATION) Vol. 2(3), pp. 69 - 74
DOI: 10.13189/ujibm.2014.020302
Reprint (PDF) (388Kb)

β - Robust Parallel Machine Scheduling with Uncertain Durations

Akram Pishevar ^*, Reza Tavakkoi-Moghaddam
School of Industrial Engineering, College of Engineering, University of Tehran, 11155-4563, Tehran, Iran

ABSTRACT

Uncertainty is a main characteristic of many real-world scheduling problems, and scheduling solutions should be robust against changes. In this paper, we consider parallel machines that the processing time of each task follows a normal distribution and total completion times as main optimization criterion. We propose a mixed-integer nonlinear programming (MINLP) model to minimize the risk of the completion time exceeding a fixed value. The objective is to find a β-robust schedule. Additionally, we use a proper approximation to convert the MINLP model to an integer programming one. The computational results on a small example are presented to demonstrate the effectiveness of the proposed approach. Furthermore, we compare and analyze the associated results of these models. Finally, the conclusion is provided.

KEYWORDS
Robust Parallel Machines Scheduling, Total Completion Time, Uncertain Duration

Cite This Paper in IEEE or APA Citation Styles
(a). IEEE Format:
[1] Akram Pishevar , Reza Tavakkoi-Moghaddam , "β - Robust Parallel Machine Scheduling with Uncertain Durations ," Universal Journal of Industrial and Business Management(CEASE PUBLICATION), Vol. 2, No. 3, pp. 69 - 74, 2014. DOI: 10.13189/ujibm.2014.020302.

(b). APA Format:
Akram Pishevar , Reza Tavakkoi-Moghaddam (2014). β - Robust Parallel Machine Scheduling with Uncertain Durations . Universal Journal of Industrial and Business Management(CEASE PUBLICATION), 2(3), 69 - 74. DOI: 10.13189/ujibm.2014.020302.