An integrative heuristic method for detailed operations scheduling in assembly job shop systems

In this paper, we describe a new heuristic method for simulating and supporting the operations scheduling process in assembly job shop systems. The method is based on the assumption that the improvement in operations synchronisation at fabrication and assembly stations brings forth better achievement of due dates. The method implements two scheduling approaches: a backward approach satisfying due date completely and a forward approach satisfying capacity restrictions completely. The two approaches work iteratively within two different simulation models of the production system – one deterministic and the other probabilistic – in searching for operations synchronisation improvement and due date achievement. The method intends to be integrative, i.e., to be able to integrate effectively three fundamental enterprise systems: order processing, production scheduling, and manufacturing activity control. An experimental study was conceived to evaluate the suitability of the method to support scheduling decision making. As results demonstrate, the method proves to be suitable for this objective. As a co-product, results show the method is better than the single-pass procedure/rules tested on average and is as good as the best single-pass procedure/rule tested.

[1]  Philip Y. Huang,et al.  A comparative study of priority dispatching rules in a hybrid assembly/job shop , 1984 .

[2]  Timothy D. Fry,et al.  A preliminary investigation of multi-attribute based sequencing rules for assembly shops , 1991 .

[3]  Timothy D. Fry,et al.  The effects of product structure and sequencing rule on assembly shop performance , 1989 .

[4]  Christian Hicks,et al.  Stochastic simulation studies of dispatching rules for production scheduling in the capital goods industry , 2006 .

[5]  Jack S. Goodwin,et al.  Evaluating Scheduling Policies in a Multi-Level Assembly System , 1986 .

[6]  Chandrasekharan Rajendran,et al.  Scheduling in dynamic assembly job-shops with jobs having different holding and tardiness costs , 2003 .

[7]  William L. Maxwell,et al.  Theory of scheduling , 1967 .

[8]  B. K. Choi,et al.  Dispatching rules for dynamic scheduling of one-of-a-kind production , 2006, Int. J. Comput. Integr. Manuf..

[9]  Jan Karel Lenstra,et al.  Complexity of Scheduling under Precedence Constraints , 1978, Oper. Res..

[10]  Chandrasekharan Rajendran,et al.  Dispatching rules for scheduling in assembly jobshops - Part 1 , 2000 .

[11]  Ihsan Sabuncuoglu,et al.  Experimental investigation of iterative simulation-based scheduling in a dynamic and stochastic job shop , 2001 .

[12]  Bernard W. Taylor,et al.  An evaluation of scheduling policies in a dual resource constrained assembly shop , 1985 .

[13]  Chandrasekharan Rajendran,et al.  Scheduling rules for dynamic shops that manufacture multi-level jobs , 2003 .

[14]  George Q. Huang,et al.  Integrating order review/release and dispatching rules for assembly job shop scheduling using a simulation approach , 2011 .

[15]  Chandrasekharan Rajendran,et al.  Performance evaluation of priority dispatching rules in multi-level assembly job shops with jobs having weights for flowtime and tardiness , 2006 .

[16]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[17]  William L. Maxwell,et al.  Multiple‐factor rules for sequencing with assembly constraints , 1968 .