Robust Scheduling to Hedge Against Processing Time Uncertainty in Flow Shop

Please enable javascript in your browser.

Golgoli, Majid | 2013

795 Viewed

Type of Document: M.Sc. Thesis
Language: Farsi
Document No: 45172 (01)
University: Sharif University of Technology
Department: Industrial Engineering
Advisor(s): Salmasi, Naser
Abstract:
This study focuses on two-machine flow shop problem where processing times are uncertain and the objective function is makespan. All information available about the processing time is an upper and lower bound and also expected value. The min-max and min-max regret version of the problem are adopted. In this study, in order to control the degree of conservatism of the solution, we suppose in each scenario the number of processing times on each machine that can deviate from its expected value is controllable. By considering the duality theorem, we present a mixed-integer programming model for the min-max problem. For each of two problems, we present an algorithm for finding objective value. We also develop a branch and bound algorithm for both of problems. For min-max regret version, we present a tabu search algorithm. We examine four policies for the tabu search algorithm and results indicate the policy that creates neighbors by swapping each two job is more efficient
Keywords:
Sequencing ; Tabu Search Algorithm ; Mini-Max Problem ; Flow Shop Scheduling ; Branch and Bound Method ; Robust Scheduling

No TOC