scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Dispatching rules for scheduling in assembly jobshops - Part 2

01 Jul 2000-International Journal of Production Research (Taylor & Francis Group)-Vol. 38, Iss: 10, pp 2349-2360
TL;DR: A new definition of 'operation due date' in the context of assembly jobs is presented and used in the development of dispatching rules and it is indicated that the proposed rules perform better than the existing rules.
Abstract: In this part of the paper, we present the development and evaluation of dispatching rules for scheduling in jobshops manufacturing multi-level assembly jobs with the performance measures reated to tardiness. We present a new definition of 'operation due date' in the context of assembly jobs and use it in the development of dispatching rules. A simulation study is carried out to evaluate the performances of the existing and the proposed dispatching rules with respect to different measures of tardiness. We also measure their performances with respect to different measures of flowtime and staging delays. The results of the study indicate that the proposed rules perform better than the existing rules.
Citations
More filters
Journal Article
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

13,333 citations

Journal ArticleDOI
TL;DR: An attempt is made to present dispatching rules by incorporating the relative costs of earliness, tardiness and holding of jobs in the form of scalar weights, and the proposed rules are found to be effective in minimizing the mean and maximum values of the measures of performance.

85 citations

Journal ArticleDOI
TL;DR: In this paper, the authors deal with an assembly job shop scheduling problem considering two phases of control: order review/release (ORR) and dispatching rules and evaluate the ability of different combinations of ORR-dispatching rules in optimising due date and flow time related performance.
Abstract: This paper deals with an assembly job shop scheduling problem considering two phases of control: order review/release (ORR) and dispatching rules. Dispatching rules have been intensively used in earlier job shop research. Such rules determine the processing sequence of jobs waiting in the queues of corresponding machines. In recent years, ORR emerges as another option for job shop control and has received increasing attention. Such control determines when to release jobs to the shop floor. Different ORR mechanisms have been devised and are reported to bring several advantages such as reduced inventory cost of early finished orders, controlled and balanced shop load levels and shorter order flow time. Previous studies on ORR often assume a simplified job shop without assembly operations, while this research applies ORR to an assembly job shop. The aim of this research is to evaluate the ability of different combinations of ORR-dispatching rules in optimising due date and flow time related performance measu...

85 citations


Cites methods from "Dispatching rules for scheduling in..."

  • ...A simulation approach is used as in many previous studies (Maxwell and Mehra 1968, Maxwell 1969, Adam et al. 1987, Ragatz and Mabert 1988, Melnyk and Ragatz 1989, Ramasech 1990, Reeja and Rajendran 2000a, b, Sabuncuoglu and Karapinar 2000, Vinod and Sridharan 2009)....

    [...]

Journal ArticleDOI
TL;DR: The development of a genetic algorithms based scheduling tool that takes into account multiple resource constraints and multiple levels of product structure is described and it is demonstrated that the schedules produced perform significantly better than those produced by the company using a conventional planning method.

83 citations


Cites background from "Dispatching rules for scheduling in..."

  • ...Reeja and Rajendran (2000) stated that most research on job shop scheduling problems ignored assembly relationships arising from product structure....

    [...]

Journal ArticleDOI
TL;DR: An attempt is made to develop efficient dispatching rules by incorporating the relative costs of holding and tardiness of jobs in the form of scalar weights, and the proposed rules are effective in minimizing the means and maximums of the primary measure.
Abstract: Most studies on scheduling in dynamic job-shops assume that the holding cost of a job is given by the flowtime of the job and that the tardiness cost of a job is given by the tardiness of the job. In other words, unit holding and unit tardiness costs of a job are assumed. However, in reality, such an assumption need not hold, and it is quite possible that there are different costs for holding and tardiness for different jobs. In addition, most studies on job-shop scheduling assume that jobs are independent and that no assembly operations exist. The current study addresses the problem of scheduling in dynamic assembly job-shops (manufacturing multilevel jobs) with the consideration of different holding and tardiness costs for different jobs. An attempt is made to develop efficient dispatching rules by incorporating the relative costs of holding and tardiness of jobs in the form of scalar weights. The primary objective of scheduling considered here is the minimization of the total scheduling cost consisting...

37 citations

References
More filters
Journal Article
TL;DR: This book by a teacher of statistics (as well as a consultant for "experimenters") is a comprehensive study of the philosophical background for the statistical design of experiment.
Abstract: THE DESIGN AND ANALYSIS OF EXPERIMENTS. By Oscar Kempthorne. New York, John Wiley and Sons, Inc., 1952. 631 pp. $8.50. This book by a teacher of statistics (as well as a consultant for \"experimenters\") is a comprehensive study of the philosophical background for the statistical design of experiment. It is necessary to have some facility with algebraic notation and manipulation to be able to use the volume intelligently. The problems are presented from the theoretical point of view, without such practical examples as would be helpful for those not acquainted with mathematics. The mathematical justification for the techniques is given. As a somewhat advanced treatment of the design and analysis of experiments, this volume will be interesting and helpful for many who approach statistics theoretically as well as practically. With emphasis on the \"why,\" and with description given broadly, the author relates the subject matter to the general theory of statistics and to the general problem of experimental inference. MARGARET J. ROBERTSON

13,333 citations

Journal ArticleDOI

72 citations


"Dispatching rules for scheduling in..." refers background or methods in this paper

  • ...Maxwell and Mehra (1968) considered single-level assembly jobs and assigned due dates to arriving jobs by using the information on the arrival time and due date of the job, the maximum total processing time among segments and the maximum number of operations of a segment among all segments....

    [...]

  • ...…work dealing with either the development of dispatching rules or due date setting methodologies in assembly jobshops has been carried out by Maxwell and Mehra (1968), Maxwell (1969), Goodwin and Goodwin (1982), Siegel (1971), Huang (1984), Sculli (1987), Russell and Taylor (1985) , Fry et…...

    [...]

  • ...Maxwell and Mehra (1968) experimented with multilevel s̀ymmetric tree structured’ jobs....

    [...]

  • ...Suppose that the due date of a job is set by using the total processing time of items/components on the critical path, and is calculated using equation (1) (see also Maxwell and Mehra 1968, Adam et al. 1993)....

    [...]

Journal ArticleDOI
TL;DR: In this article, a new set of sequencing rules, called importance ratio (IR), is proposed and the operation of a hypothetical assembly shop is simulated to test the performance of eight sequencing rules on three distinct sets of product structures.
Abstract: This paper updates the current literature on assembly shop scheduling to include multi-attribute based sequencing rules that have recently been introduced and measures of shop performance that more accurately reflect management's view toward tardiness and inventory. In addition, a new set of sequencing rules, called importance ratio (IR), is proposed. The operation of a hypothetical assembly shop is simulated to test the performance of eight sequencing rules on three distinct sets of product structures. Four measures of system inventory and four measures of job tardiness are used to evaluate sequencing rule performance. The study shows that sequencing rules which incorporate attributes of both job shop and assembly shop scheduling do not necessarily produce the best performance. Moreover, multiple measures of inventory and tardiness performance do provide important insight into the operation and particular benefits of different sequencing rules. Finally, the importance ratio rules introduced are viable ca...

58 citations


"Dispatching rules for scheduling in..." refers background or methods in this paper

  • ...…methodologies in assembly jobshops has been carried out by Maxwell and Mehra (1968), Maxwell (1969), Goodwin and Goodwin (1982), Siegel (1971), Huang (1984), Sculli (1987), Russell and Taylor (1985) , Fry et al. (1989), Philipoom et al. (1991), Adam et al. (1993) , and Roman and del Valle (1996)....

    [...]

  • ...Later, Philipoom et al. (1991) proposed a new set of sequencing rule called the importance ratio (IR) rules and evaluated them with respect to four measures of tardiness....

    [...]

Journal ArticleDOI
TL;DR: 11 sequencing rules (some of which are common to simple job shops and some decigned specifically for assembly shops) are evaluated using a simulation analysis of a hypothetical assembly shop using an ANOVA procedure.
Abstract: Research relating to sequencing rules in simple job shops has proliferated, but there has not been a corresponding proliferation of research evaluating similar sequencing rules in more complex assembly job shops. In a simple job shop, all operations are performed serially; but an assembly shop encompasses both serial and parallel operations. As a result of the increased complexity of assembly shops, the results associated with the performance of sequencing rules in simple job shops cannot be expected for an assembly shop. In this paper, 11 sequencing rules (some of which are common to simple job shops and some decigned specifically for assembly shops) are evaluated using a simulation analysis of a hypothetical assembly shop. The simulation results are analyzed using an ANOVA procedure that identifies significant differences in the results of several performance measures. Sensitivity analysis also is performed to determine the effect of job structure on the performance of the sequencing rules.

56 citations


"Dispatching rules for scheduling in..." refers background or methods in this paper

  • ...Some of the rules which were evaluated were [IR ; WKR (total work content remaining)], IR-SLK(slack), MS (modi® ed slack)-IR, and MS-TWK rule. The (IR ; TWKR) rule performed well with respect to mean ̄ owtime and per cent tardy jobs. The results suggested that (IR ; TWKR) rule is more appropriate for scheduling assembly jobs than any of the other rules tested. Adam et al. (1993) presented a study on the due date assignment procedures in jobshop environments where multi-level assembly jobs were processed and due dates were internally assigned....

    [...]

  • ...They used the total work content (TWK), in which the allowance of a job was in proportion to its total processing time and the predetermined constant lead time allowance (CON), where the allowance of individual jobs was set equal to a constant representing the average lead time of a job in the shop. Huang (1984) explored the impact of the various rules on the performance of the shop....

    [...]

Journal ArticleDOI
TL;DR: In this article, the structural complexity of jobs can be incorporated explicitly into priority rules to reduce job lead times and the combined rule results in the improvement of the lead time performance, and experimental results provide a comparative perspective on the performance of priority rules that have been examined in the earlier research literature.
Abstract: This paper deals with the design of priority rules for job shops that process multi-level assembly jobs. Specifically, it explores the means by which the structural complexity of jobs can be incorporated explicitly into priority rules to reduce job lead times. The job lead time is viewed as consisting of two components: flow time and job staging delays. The primary focus of the paper is on the development of a class of priority rules that is aimed at reducing the staging delay. The class of priority rules that is developed is then used in combination with rules that are effective for the flow time component. The combined rule results in the improvement of the lead time performance. The paper also includes experimental results on sets of jobs of varying degrees of complexity. These results provide a comparative perspective on the performance of priority rules that have been examined in the earlier research literature as well as the rules specifically developed in this paper.

54 citations