THE DESIGN AND OPERATION OF Flexible Job-Shop FOR MAKESPAN MINIMIZATION
M.Sc. student - Oshrat Lalush Yechiel
Nowadays, firms are facing competitive and dynamic environments, where it is required to customize products while providing high service level and utilization of resources. Flexibility is an important tool to achieve those goals, as operations can be routed to multiple machines that were configured to perform various tasks. As a result, machine utilization is improved and jobs completion times might be shortened. In this talk, we address the problem of simultaneously determining the machine flexibility and job scheduling in a job-shop environment. The problem is combined of two inter-related well studied problems which so far were examined separately. The first involves selecting a process flexibility configuration, while the second consists of assigning and scheduling job operations to machines, given the chosen flexibility. The solution to each of these problems has a major impact on the other, therefore it is important to examine them simultaneously. Our work first investigates the symmetric case, for which an optimal analytical solution with an interesting structure is detected. When generalizing the problem to asymmetric cases, we show that some of them can still be solved to optimality by the same procedure, while others are shown to be NP-Hard. For an important class of asymmetric cases, a heuristic is developed, which is shown to perform very well.
This work was performed under the supervision of Prof. Yossi Bukchin and Prof. Michal Tzur.
ההרצאה תתקיים ביום חמישי 4/12/14, בשעה 12:00 בחדר 206, בנין וולפסון הנדסה, הפקולטה להנדסה, אוניברסיטת תל-אביב.