scispace - formally typeset
Search or ask a question
Journal ArticleDOI

Integrating order review/release and dispatching rules for assembly job shop scheduling using a simulation approach

01 Feb 2011-International Journal of Production Research (Taylor & Francis Group)-Vol. 49, Iss: 3, pp 647-669
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...
Citations
More filters
Journal ArticleDOI
TL;DR: A comprehensive review of discrete event simulation publications published between 2002 and 2013 with a particular focus on applications in manufacturing is provided in this paper, where the literature is classified into three general classes of manufacturing system design, manufacturing system operation, and simulation language/package development.

448 citations

Journal ArticleDOI
TL;DR: This is the first paper that empirically demonstrates performance improvements resulting from WLC alongside a detailed discussion of the implementation process, and the importance of a contingency‐based approach to production planning and control.
Abstract: Purpose – The purpose of this paper is to present a successful implementation of a comprehensive workload control (WLC) concept; and to describe the associated implementation process. Design/methodology/approach – Longitudinal action research using a contingency‐based approach to ensure alignment between the case company and the characteristics of the WLC approach; and the resulting expected improvements in performance. A set of 17 issues and responses from the literature is used as a checklist for implementing WLC. Findings – Performance improvements include: reduced lead times; significant improvement in lateness and tardiness; reduced costs; improved internal and external co‐ordination; and higher quality. The relevance of 15 of the 17 implementation issues is confirmed along with the same response as in previous research for ten issues and an improved response for five issues. In addition, three new issues are identified and addressed. Research limitations/implications – Dependability was a more important competitive priority in this company than speed; and, therefore, the ability of WLC to reduce lead times was not fully assessed. Practical implications – The importance of a contingency‐based approach to production planning and control is confirmed. Comprehensive WLC approaches are closely aligned with the high‐variety/low‐volume context of make‐to‐order (MTO) companies. Originality/value – This is the first paper that empirically demonstrates performance improvements resulting from WLC alongside a detailed discussion of the implementation process. Few examples of successful implementations have been published previously, and these tend to treat the implementation process as a “black box”. Where more detail on the implementation process has been given in previous studies, evidence of effectiveness in practice was not provided

78 citations

Journal ArticleDOI
TL;DR: A consolidated survey of assembly flow shop models with their solution methodology is provided and some problems receiving less attention are presented and several salient research opportunities are proposed.
Abstract: The past few years have witnessed a resurgence of interest in assembly flow shop scheduling as evidenced by increasing number of published articles in this field. A basic assembly flow shop consist...

76 citations


Cites background from "Integrating order review/release an..."

  • ...If at least two jobs with assembly operations have distinctive process flow, then the problem is modelled as an assembly job shop, see Cummings and Egbelu (1998), Lu, Huang, and Yang (2011), and Wong and Ngan (2013), and for a recent survey of assembly job shop see Khodke and Bhongade (2013)....

    [...]

Journal ArticleDOI
TL;DR: Meta-heuristic algorithms as state-of-the-art algorithms proposed for Fuzzy JSSPs are reviewed in three steps, namely, pre-processing, initialization procedures, and improvement algorithms.

73 citations


Cites methods from "Integrating order review/release an..."

  • ...Although numerous heuristic methods have been proposed based on dispatching rules for crisp JSSPs [2,5,6,8,21,26,52,55,60,78,82], only one implementation of fuzzy priority dispatching rules for Fuzzy JSSP exists because dispatching rules cannot perform effectively over complex Fuzzy JSSPs and have limited use in practical JSSPs....

    [...]

  • ...In recent decades, a number of researchers have expanded the theoretical models of Fuzzy JSSPs and introduced algorithms to solve them....

    [...]

  • ...This paper reviews the classification of Fuzzy JSSPs, constraints and objectives investigated in Fuzzy JSSPs, and the methodologies applied in solving Fuzzy JSSPs....

    [...]

  • ...The paper centers on reviewing meta-heuristic algorithms as state-of-the-art algorithms proposed for Fuzzy JSSPs....

    [...]

  • ...Summary: Fuzzy job-shop scheduling problems (Fuzzy JSSPs) are a class of combinational optimization problems known as non-deterministic polynomial-hard problems....

    [...]

Journal ArticleDOI
TL;DR: This paper proposes an effective hybrid cooperative coevolution algorithm (hCEA) for the minimization of fuzzy makespan, which is named fuzzy flexible job shop scheduling because it performs better than the existing methods from the literature.
Abstract: Flexible scheduling is one of the most significant core techniques for intelligent manufacturing systems. Realization of an optimized schedule through flexible resources assignment is critical to the application and popularization of flexible scheduling, especially in uncertain manufacturing environments. In this paper, we consider flexible job shop scheduling with uncertain processing time represented by fuzzy numbers, which is named fuzzy flexible job shop scheduling. We propose an effective hybrid cooperative coevolution algorithm (hCEA) for the minimization of fuzzy makespan. The hCEA combines particle swarm optimization with the genetic algorithm to improve the convergence ability. A parameter self-adaptive strategy is applied to the problems with different scale effectively as well. Five benchmarks and three large-scale problems with fuzzy processing time are adopted to test the hCEA. Computational results show that the hCEA performs better than the existing methods from the literature.

62 citations


Cites background from "Integrating order review/release an..."

  • ...applications that belong to this category of problems, such as FJSP [17], [18]....

    [...]

References
More filters
Journal ArticleDOI
TL;DR: A review of the state of the art in the study of dispatching rules can be found in this paper, where a dispatching rule is used to select the next job to be processed from a set of jobs awaiting service.
Abstract: This paper reviews recent studies of dispatching rules. A dispatching rule is used to select the next job to be processed from a set of jobs awaiting service. The paper has two objectives. The first is to discuss the state of the art in the study of dispatching rules. The discussion includes analytical approaches, simulation techniques and evaluation criteria. The second objective of the paper is to compare several of the dispatching rules listed in the Appendix using the results of recently published studies. It is impossible to identify any single rule as the best in all circumstances. However, several rules have been identified as exhibiting good performance in general.

967 citations


"Integrating order review/release an..." refers background in this paper

  • ...A noticeable number of earlier researches have focused on priority dispatching rules (Blackstone et al. 1982, Ramasech 1990, Chiang and Fu 2007, Alpay and Yuzugullu 2009)....

    [...]

  • ...Job shop scheduling has long attracted substantial interest of both academic researchers and industrial practitioners (Blackstone et al. 1982, Ramasech 1990, Bollapragada and Sadeh 2004, Chan et al. 2009, Zhou et al. 2009)....

    [...]

Journal ArticleDOI
TL;DR: In this article, a single-machine scheduling problem in which penalities occur when a job is completed early or late is considered, where the objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions.
Abstract: This paper considers a single-machine scheduling problem in which penalities occur when a job is completed early or late. The objective is to minimize the total penalty subject to restrictive assumptions on the due dates and penalty functions for jobs. A procedure is presented for finding an optimal schedule.

331 citations


"Integrating order review/release an..." refers background in this paper

  • ...3.3.1 Mean absolute deviation (MAD) MAD measures the deviation of order completion dates from their respective due dates (Kanet 1981, Uttarayan Bagchi et al. 1986, Ragatz and Mabert 1988)....

    [...]

Journal ArticleDOI
TL;DR: This paper provides a state-of-the-art survey of the simulation-based research on dynamic job shop scheduling with a distinct emphasis on two important aspects.
Abstract: Scheduling of job shops has been extensively researched over the last three decades and it continues to attract the interests of both academic researchers and practitioners. This paper provides a state-of-the-art survey of the simulation-based research on dynamic job shop scheduling with a distinct emphasis on two important aspects. First, job-shop simulation modeling and experimental considerations are discussed with a review of the different approaches taken in the literature. Second, a review of the different studies is provided with a focus on their findings on the job shop performance criteria of interest. This paper is aimed at both practicing managers and researchers in the area of job shop scheduling because of the following considerations: 1. (i) The number of factors that characterize a job shop is very large and there is considerable variation in modeling and experimentation across the vast number of studies reported. Important research findings relevant to these issues reviewed in this paper would facilitate comparison of the currently available research results and their extension or application to other situations. 2. (ii) A review of the various studies focusing on some of the more important performance criteria should help practitioners in the selection of scheduling rules to match the criterion particularly relevant to their shops. 3. (iii) Recent studies which have modeled job shops as dual-resource constrained systems and assembly shops have been included in this survey for a more comprehensive coverage. A detailed bibliography is included and every effort has been made to make the survey up-to-date.

298 citations


"Integrating order review/release an..." refers background or methods in this paper

  • ...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)....

    [...]

  • ...A noticeable number of earlier researches have focused on priority dispatching rules (Blackstone et al. 1982, Ramasech 1990, Chiang and Fu 2007, Alpay and Yuzugullu 2009)....

    [...]

  • ...Job shop scheduling has long attracted substantial interest of both academic researchers and industrial practitioners (Blackstone et al. 1982, Ramasech 1990, Bollapragada and Sadeh 2004, Chan et al. 2009, Zhou et al. 2009)....

    [...]

Journal ArticleDOI
TL;DR: Load-oriented manufacturing control is a new solution for job shops and its successful implementation in a plastic leaves factory as mentioned in this paper, where the idea is to limit and balance work-in-process inventory on a level as low as possible in order to accomplish a high workcentre utilization as well as a rapid and in-time flow of orders.
Abstract: The paper describes the principles of load-oriented manufacturing control as a new solution for job shops and its successful implementation in a plastic leaves factory. The idea of load-oriented manufacturing control is to limit and balance work-in-process inventory on a level as low as possible in order to accomplish a high workcentre utilization as well as a rapid and in-time flow of orders. As the new system keeps actual lead times on a planned level in a self-regulating way it allows reliable due date scheduling. Furthermore, it points out the bottlenecks and performs applicable mid- and short-term capacity planning.

231 citations


"Integrating order review/release an..." refers background in this paper

  • ...The first norm is developed by Bechte (1987)....

    [...]

Journal ArticleDOI
TL;DR: In this article, the authors examined the ORR function and its impact on the operation of the shop floor and found that ORR does not always reduce the total time spent in the system.
Abstract: SUMMARY This paper examines the order review/release (ORR) function and its impact on the operation of the shop floor. A source of disagreement between practitioners and researchers, ORR is an important element of any shop floor control system. This paper attempts to provide a better understanding of this element by presenting a framework for ORR. This framework not only identifies the important dimensions of ORR but also new dimensions for research. The paper also explores the relationship between ORR and job dispatching through a simple computer simulation model. The results indicate that the ORR, while reducing time spent in queue on the shop floor, does not always reduce the total time spent in the system.

215 citations


"Integrating order review/release an..." refers background in this paper

  • ...As found by Melnyk and Ragatz (1989), although ORR reduces the time that products spend on the shop floor, it does not always reduce the total time spent in the system (the pre-shop pool and the shop floor). Similarly, Kanet (1988) pointed out this disadvantage of ORR....

    [...]

  • ...As found by Melnyk and Ragatz (1989), although ORR reduces the time that products spend on the shop floor, it does not always reduce the total time spent in the system (the pre-shop pool and the shop floor)....

    [...]