Manufacturing cycle time reduction for batch production in a shared worker environment

Responsive delivery without inefficient excess inventory requires short manufacturing cycle times. The manufacturing cycle time is comprised of operation time, loading/unloading time, set up time and machine idle time. The sum of loading/unloading, set up and machine idle times is called downtime. To shorten batch processing time, reduction in downtime must be the first priority. One way to reduce downtime per work unit is to increase batch quantity, while another is to shorten the sum of set up and machine idle times. Whereas fast cycle time is critical for time-based competition, efficient utilisation of labour is also essential to keep a manufacturing company competitive due to the rapid increase in labour costs. Therefore, in many small and medium-sized businesses, one worker simultaneously handles multiple machines. In such a shared worker environment, machine idle time inevitably occurs due to a lack of available workers. The purpose of this paper is to propose a downtime reduction method based on part sequencing in a shared worker environment. The proposed heuristic results in a significant reduction in average downtime when compared to the results from the existing optimal sequencing method of independent machines.

[1]  Martin Grunow,et al.  Development of group setup strategies for makespan minimisation in PCB assembly , 2007 .

[2]  Wen-Hwa Yang,et al.  Survey of scheduling research involving setup times , 1999, Int. J. Syst. Sci..

[3]  J. R. Brown,et al.  A two-stage traveling salesman procedure for the single machine sequence-dependent scheduling problem , 1995 .

[4]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[5]  Jatinder N. D. Gupta,et al.  Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups , 2010 .

[6]  Jatinder N. D. Gupta,et al.  A review of scheduling research involving setup considerations , 1999 .

[7]  Uğur Özcan,et al.  Balancing two-sided assembly lines with sequence-dependent setup times , 2010 .

[8]  Paul A. Rubin,et al.  A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times , 2000 .

[9]  Jatinder N. D. Gupta,et al.  Single machine group scheduling with family setups to minimize total tardiness , 2008 .

[10]  Wilbert E. Wilhelm,et al.  Scheduling and lot sizing with sequence-dependent setup: A literature review , 2006 .

[11]  R. Gomory,et al.  Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem , 1964 .

[12]  Jing Liu,et al.  A survey of scheduling problems with setup times or costs , 2008, Eur. J. Oper. Res..

[13]  V. Vinod,et al.  Simulation-based metamodels for scheduling a dynamic job shop with sequence-dependent setup times , 2009 .

[14]  G. Croes A Method for Solving Traveling-Salesman Problems , 1958 .

[15]  Michael Pinedo,et al.  Scheduling: Theory, Algorithms, and Systems , 1994 .

[16]  Robert E. Williams,et al.  Integrating simulation with activity-based management to evaluate manufacturing cell part sequencing , 1999 .

[17]  James A. Chisman Manufacturing cell: Analytical setup times and part sequencing , 1986 .

[18]  G. Rinaldi,et al.  Scheduling tasks with sequence-dependent processing times , 1988 .