Heuristic Approaches for a Scheduling Problem in the Plastic Molding Department of an Audio Company

  • Authors:
  • C. K. Y. Lin;C. L. Wong;Y. C. Yeung

  • Affiliations:
  • Department of Management Sciences, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, People's Republic of China. mslincky@cityu.edu.hk;Department of Management Sciences, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, People's Republic of China;Department of Management Sciences, City University of Hong Kong, 83 Tat Chee Avenue, Kowloon, Hong Kong, People's Republic of China

  • Venue:
  • Journal of Heuristics
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

A production scheduling problem for making plastic molds of hi-fi models is considered. The objective is to minimize the total machine makespan in the presence of due dates, variable lot size, multiple machine types, sequence dependent, machine dependent setup times, and inventory limits. Goal programming and load balancing are applied to select the set of machine types and assign mold types to machines, resulting in a set of single-machine scheduling problems. A mixed-integer program (MIP) is formulated for the general problem but could solve only small instances. A single-machine scheduling heuristic is designed to adopt a production sequence from a travelling salesman solution. The start time of every cycle is determined by a simplified MIP. Production cycles are defined to equalize the stockout times of mold types. A post-processing step reduces the number of setups in the last cycle. Results using real-life data are promising. Characteristics giving rise to high machine utilization are discussed.