A comparative study of dispatching rules in dynamic flowshops and jobshops
TL;DR: A comparative study on the performance of dispatching rules in the following sets of dynamic manufacturing systems: flowshop and jobshops, and flowshops with missing operations and job shops reveals some interesting observations on the relative performance.
About: This article is published in European Journal of Operational Research.The article was published on 1999-07-01. It has received 242 citations till now. The article focuses on the topics: Job shop & Flow shop scheduling.
Citations
More filters
TL;DR: The paper defines the problem of dynamic scheduling and provides a review of the state-of-the-art of currently developing research on dynamic scheduling, and the principles of several dynamic scheduling techniques, namely, heuristics, meta-heuristic, multi-agent systems, and other artificial intelligence techniques are described in detail.
Abstract: In most real-world environments, scheduling is an ongoing reactive process where the presence of a variety of unexpected disruptions is usually inevitable, and continually forces reconsideration and revision of pre-established schedules. Many of the approaches developed to solve the problem of static scheduling are often impractical in real-world environments, and the near-optimal schedules with respect to the estimated data may become obsolete when they are released to the shop floor. This paper outlines the limitations of the static approaches to scheduling in the presence of real-time information and presents a number of issues that have come up in recent years on dynamic scheduling.
The paper defines the problem of dynamic scheduling and provides a review of the state-of-the-art of currently developing research on dynamic scheduling. The principles of several dynamic scheduling techniques, namely, heuristics, meta-heuristics, multi-agent systems, and other artificial intelligence techniques are described in detail, followed by a discussion and comparison of their potential.
786 citations
Cites background from "A comparative study of dispatching ..."
...Ramasesh (1990), and Rajendran and Holthaus (1999) presented excellent state-of-the-art surveys of dispatching rules in dynamic job shops and flow shops....
[...]
TL;DR: The state-of-the-art approaches are summarized, suggesting a taxonomy, and providing the interested researchers and practitioners with guidelines for the design of hyper-heuristics in production scheduling are summarized and suggested.
Abstract: Hyper-heuristics have recently emerged as a powerful approach to automate the design of heuristics for a number of different problems. Production scheduling is a particularly popular application area for which a number of different hyper-heuristics have been developed and are shown to be effective, efficient, easy to implement, and reusable in different shop conditions. In particular, they seem to be a promising way to tackle highly dynamic and stochastic scheduling problems, an aspect that is specifically emphasized in this survey. Despite their success and the substantial number of papers in this area, there is currently no systematic discussion of the design choices and critical issues involved in the process of developing such approaches. This paper strives to fill this gap by summarizing the state-of-the-art approaches, suggesting a taxonomy, and providing the interested researchers and practitioners with guidelines for the design of hyper-heuristics in production scheduling. This paper also identifies challenges and open questions and highlights various directions for future work.
315 citations
Cites background from "A comparative study of dispatching ..."
...A possible benchmark are the dynamic job and flow shop problems designed by Rajendran and Holthaus [95] and Holthaus and Rajendran [96] for the purpose of comparing dispatching rules from the literature....
[...]
...flow shop problems designed by Rajendran and Holthaus [95] and Holthaus and Rajendran [96] for the purpose of comparing dispatching rules from the literature....
[...]
TL;DR: In this paper, the state-of-the-art in the food processing and packaging industry in the light of recent advancements in the fields of smart packaging and materials including the application of nanoscience and technology, automation and control technology, standards, and their application scenarios, and finally, production management principles and their improvements for the food industry.
Abstract: In today's world of global markets and stiff competition in every product along with increasing consumer demand, it becomes imperative for companies to explore ways to improve their productivity in terms of maintaining safety, using sustainable packaging materials, implementing flexible and standardized technology, and adopting proven management principles. In this paper, we look into the state-of-the-art in the food processing and packaging industry in the light of recent advancements in the fields of (i) smart packaging and materials including the application of nanoscience and technology, (ii) automation and control technology, standards, and their application scenarios, and finally (iii) production management principles and their improvements for the food industry. A comprehensive review on the above and related areas is presented in appropriate order. From the survey of literature, it is clear that although researchers have focused on individual aspects of the processing, packaging, and manufacturing, there is need for a more holistic approach to system analysis while understanding the scope of the entire operations. We conclude that it is imperative to investigate why the practical implementations of these advancements seem to lag behind research in the field.
298 citations
03 Dec 2006
TL;DR: A novel approach that uses the honey bees foraging model to solve the job shop scheduling problem and experimental results comparing the proposed honey bee colony approach with existing approaches such as ant colony and tabu search are presented.
Abstract: In the face of globalization and rapidly shrinking product life cycle, manufacturing companies are trying different means to improve productivity through management of machine utilization and product cycle-time. Job shop scheduling is an important task for manufacturing industry in terms of improving machine utilization and reducing cycle-time. However, job shop scheduling is inherently a NP-hard problem with no easy solution. This paper describes a novel approach that uses the honey bees foraging model to solve the job shop scheduling problem. Experimental results comparing the proposed honey bee colony approach with existing approaches such as ant colony and tabu search will be presented.
220 citations
Cites background from "A comparative study of dispatching ..."
...1982, Rajendran and Holthaus 1999, Jain and Meeran 1999) A scheduling problem can be characterized by a set of jobs, each with one or more operations....
[...]
...The objective of scheduling is to determine the job schedules that minimize (or maximize) a measure (or multiple measures) of performance (Rajendran and Holthaus 1999)....
[...]
...The objective of scheduling is to determine the job schedules that minimize (or maximize) a measure (or multiple measures) of performance (Rajendran and Holthaus 1999)....
[...]
TL;DR: Simulation results show that, for most of the performance measures, a MAS integrated with well-designed ant-inspired coordination performs well compared to a MAS using dispatching rules.
210 citations
References
More filters
Book•
15 Jul 1994
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
Abstract: This book on scheduling covers theoretical models as well as scheduling problems in the real world. Author Michael Pinedo also includes a CD that contains slide-shows from industry and movies dealing with implementations of scheduling systems. The book consists of three parts. The first part focuses on deterministic scheduling with the associated combinatorial problems. The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance. The third part deals with scheduling in practice. It covers heuristics that are popular with practitioners and discusses system design and development issues. Each chapter contains a series of computational and theoretical exercises. This book is of interest to theoreticians and practitioners alike. Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource. Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments. Michael Pinedo is the Julius Schlesinger Professor of Operations Management at New York University.
6,209 citations
Book•
01 Jan 1974
TL;DR: In this article, the authors present an introduction to Sequencing and Scheduling in the context of the Operational Research Society (ORS) and the International Journal of Distributed Sensor Networks (ILS).
Abstract: (1977). Introduction to Sequencing and Scheduling. Journal of the Operational Research Society: Vol. 28, No. 2, pp. 352-353.
2,640 citations
TL;DR: A simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics, and performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
Abstract: In a general flow-shop situation, where all the jobs must pass through all the machines in the same order, certain heuristic algorithms propose that the jobs with higher total process time should be given higher priority than the jobs with less total process time. Based on this premise, a simple algorithm is presented in this paper, which produces very good sequences in comparison with existing heuristics. The results of the proposed algorithm have been compared with the results from 15 other algorithms in an independent study by Park [13], who shows that the proposed algorithm performs especially well on large flow-shop problems in both the static and dynamic sequencing environments.
2,255 citations
Book•
24 Mar 1982
TL;DR: In this article, an introduction to the mathematics of the job shop is presented, with a focus on the sequential and scheduling aspects of the system. But this approach is not suitable for all job-shop scenarios.
Abstract: (1982). Sequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop. Journal of the Operational Research Society: Vol. 33, No. 9, pp. 862-862.
1,017 citations
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