Scheduling production using genetic algorithm for elastic knitted fabrics with wide ranges of quantities demanded

  • Authors:
  • Rong-Chang Chen;Pei-Hsuan Hung;Mei-Ching Wu

  • Affiliations:
  • Department of Logistics Engineering and Management, National Taichung Institute of Technology, Taichung, Taiwan, R.O.C.;Department of Logistics Engineering and Management, National Taichung Institute of Technology, Taichung, Taiwan, R.O.C.;Department of Logistics Engineering and Management, National Taichung Institute of Technology, Taichung, Taiwan, R.O.C.

  • Venue:
  • SMO'07 Proceedings of the 7th WSEAS International Conference on Simulation, Modelling and Optimization
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

In dealing with the production of various products in some industries, many firms need to respond to wide ranges of quantities demanded. High responsiveness to wider ranges of quantities can be a competitive advantage for a firm in modern highly competing environments. To stay ahead of competitors, a firm should be able to schedule production in an efficient way. The purpose of this study is to investigate the effects of wide ranges of quantities demanded on the scheduling. The production scheduling problem of knitted fabrics is used to examine the influences. Genetic algorithm (GA) is employed to be the analytical tool. Optimal parameters including mutation rates and crossover rates that generate good performance are obtained experimentally. Results from this paper show that the makespan in wide ranges of quantities is lower than that in a small range. However, the machine utilization in wide ranges of quantities is lower than that in a small range. To schedule the production with a lower makespan and with reasonable machine utilization, one can divide a big customer order into many manufacturing orders with smaller quantities. In addition, the on-time delivery rate can be increased by adding a penalty factor of completion time of a job.