Effective scheduling of litho machines with load balancing

نویسندگان

  • Bing Yan
  • Hsin Yuan Chen
  • Peter B. Luh
  • Simon Wang
  • Joey Chang
چکیده

The increasing demand for on-time delivery is forcing semiconductor manufacturers to seek more efficient schedules of machines and other resources to meet targets while making effective use of excess capacities. This paper presents the modeling and solution methodology of lithography machine scheduling with load balancing and reticle expiration consideration for the bottleneck process of semiconductor fabrication. A mixed-integer optimization model is established with capacity constraints and processing requirements. The objective is to meet daily targets, to keep load balancing, to avoid reticles shortage, and to reduce the number of machine setups. The problem formulated above is solved by the branch-and-cut method. Although the formulation is linearized, the practical size problem is still difficult to solve because the convex hull is hard to obtain. To overcome efficiency difficulty, some constraints are modified. To further improve efficiency, a two-phase model is established. The higher phase is to reduce the problem range by relaxing some constraints, and the lower phase is for scheduling. Numerical testing shows that the method can generate high quality schedules within reasonable time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

GASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment

The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...

متن کامل

GASA: Presentation of an Initiative Method Based on Genetic Algorithm for Task Scheduling in the Cloud Environment

The need for calculating actions has been emerged everywhere and in any time, by advancing of information technology. Cloud computing is the latest response to such needs. Prominent popularity has recently been created for Cloud computing systems. Increasing cloud efficiency is an important subject of consideration. Heterogeneity and diversity among different resources and requests of users in ...

متن کامل

Optimization Techniques for Resource Provisioning and Load Balancing in Cloud Environment: A Review

Cloud computing is an emerging technology which provides unlimited access of versatile resources to users. The multifaceted and dynamic aspects of cloud computing require efficient and optimized techniques for resource provisioning and load balancing. Cloud monitoring is required identifying overutilized and underutilized of physical machines which hosting Virtual Machines (VMs). Load balancing...

متن کامل

A Genetic Algorithm for Job Shop Scheduling with Load Balancing

This paper deals with the load-balancing of machines in a real-world job-shop scheduling problem, with identical machines. The load-balancing algorithm allocates jobs, split into lots, on identical machines, with objectives to reduce job total throughput time and to improve machine utilization. A genetic algorithm is developed, whose fitness function evaluates the load-balancing in the generate...

متن کامل

Load Balancing in Cloud Computing with Enhanced Optimal Cost Scheduling Algorithm

Cloud computing is a trending technology to provide ease of access to services that a user requires with pay-as-you-go model. The number of user requests on the servers increase tremendously therefore increasing load on the servers. This requires a proper load balancing technique to balance the load on the virtual machines. In this paper we have modified an existing algorithm Optimal Cost Sched...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012