Dynamic scheduling—a survey of research
TL;DR: A review of the research on scheduling in a dynamic environment is presented and predicts a solution valid for the entire time span specified.
About: This article is published in International Journal of Production Economics.The article was published on 1993-08-01. It has received 147 citations till now. The article focuses on the topics: Dynamic priority scheduling & Fair-share 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 or methods from "Dynamic scheduling—a survey of rese..."
...Extensive discussions of these techniques can be found in Suresh and Chaudhuri (1993), Szelke and Kerr (1994), Zweben and Fox (1994), Kerr and Szelke (1995), Meziane et al. (2000)....
[...]
...Real-time events have been classified into two categories (Stoop and Weirs 1996; Suresh and Chaudhuri 1993; Cowling and Johansson 2002; Vieira et al. 2003): • Resource-related: machine breakdown, operator illness, unavailability or tool failures, loading limits, delay in the arrival or shortage of…...
[...]
...Advantages and disadvantages of these techniques have been provided by Suresh and Chaudhuri (1993), Shukla and Chen (1996), Stoop and Weirs (1996), and Brandimarte and Villa (1999)....
[...]
...Dynamic scheduling has been solved using the following techniques (Suresh and Chaudhuri 1993; Shukla and Chen 1996; Stoop and Weirs 1996; Brandimarte and Villa 1999): heuristics, meta-heuristics, knowledge-based systems, fuzzy logic, neural networks, hybrid techniques, and multi-agent systems....
[...]
TL;DR: The literature on executing production schedules in the presence of unforeseen disruptions on the shop floor is reviewed, and a taxonomy of the different types of uncertainty faced by scheduling algorithms is provided.
678 citations
Cites methods from "Dynamic scheduling—a survey of rese..."
...Finally, we shall focus our review primarily on work over the last decade, since much of the earlier work has been reviewed by other authors (e.g., Harmonosky and Robohn, 1991; Suresh and Chaudhuri, 1993; Szelke and Kerr, 1994)....
[...]
12 Apr 1999
TL;DR: Three new heuristics, one for batch and two for on-line, are introduced as part of this research, revealing that the choice of mapping heuristic depends on parameters such as: the structure of the heterogeneity among tasks and machines, the optimization requirements, and the arrival rate of the tasks.
Abstract: Dynamic mapping (matching and scheduling) heuristics for a class of independent tasks using heterogeneous distributed computing systems are studied. Two types of mapping heuristics are considered: on-line and batch mode heuristics. Three new heuristics, one for batch and two for on-line, are introduced as part of this research. Simulation studies are performed to compare these heuristics with some existing ones. In total, five on-line heuristics and three batch heuristics are examined. The on-line heuristics consider; to varying degrees and in different ways, task affinity for different machines and machine ready times. The batch heuristics consider these factors, as well as aging of tasks waiting to execute. The simulation results reveal that the choice of mapping heuristic depends on parameters such as: (a) the structure of the heterogeneity among tasks and machines, (b) the optimization requirements, and (c) the arrival rate of the tasks.
658 citations
Cites background or methods from "Dynamic scheduling—a survey of rese..."
...Several researchers have worked on the dynamic mapping problem from areas including job shop scheduling and distributed computer systems (e.g., [10, 12, 18, 20 ])....
[...]
...Furthermore, some of the heuristics featured in [ 20 ] use priorities and deadlines to determine the task scheduling order whereas priorities and deadlines are not considered here....
[...]
...The class of heuristics grouped under the conventional approach are similar to the minimum completion time heuristic considered in this paper, however, the problem domains considered in [ 20 ] and here differ....
[...]
...A survey of dynamic scheduling heuristics for job-shop environments is provided in [ 20 ]....
[...]
TL;DR: A comparative analysis of the production processes and production management problems for the SM–CC–HR and the traditional cold charge process is given and planning and scheduling systems developed and methods used for SM– CC–HR production are reviewed.
330 citations
TL;DR: A literature review, classification schemes and a simple meta-analysis for scheduling of batch processors (SBP) research in semiconductor manufacturing (SM) are presented and show that there is an increasing trend in SBP research in SM.
Abstract: In this paper, we present a literature review, classification schemes and a simple meta-analysis for scheduling of batch processors (SBP) research in semiconductor manufacturing (SM). This review is based on a study of journals and web-based documents/articles, which include conference materials, lecture notes in computer science, working papers, etc. There are 98 articles published in various publication outlets between 1986 and October 2004. Based on the literature review carried out and the nature of SBP research observed in SM, we have introduced two classification schemes to systematically organize the published articles. The first classification scheme is based on the problem configurations of SBP research in SM and the second one is based on the solution methodology followed by the researchers. These classification schemes indicate that there is much research scope on SBP research in SM. Furthermore, a simple meta-analysis is carried out to enhance understanding on the development and evolution of SBP research in SM and to identify potential research areas for further research and for improvement. The results show that there is an increasing trend in SBP research in SM. A comprehensive list of references is presented. This study is expected to provide a source of reference for other researchers (or readers), who are interested in SBP research particularly in SM and help stimulate further interest.
287 citations
Cites background from "Dynamic scheduling—a survey of rese..."
...approaches is that the decision tend to be myopic, that is, it does not consider relevant information that may have an impact on the schedule that is drawn up which occurs elsewhere on the shop floor [ 124 ]....
[...]
References
More filters
TL;DR: In this article, the contract net protocol has been developed to specify problem-solving communication and control for nodes in a distributed problem solver, where task distribution is affected by a negotiation process, a discussion carried on between nodes with tasks to be executed and nodes that may be able to execute those tasks.
Abstract: The contract net protocol has been developed to specify problem-solving communication and control for nodes in a distributed problem solver. Task distribution is affected by a negotiation process, a discussion carried on between nodes with tasks to be executed and nodes that may be able to execute those tasks.
3,612 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
Book•
[...]
01 Jan 1967
TL;DR: Reading theory of scheduling as one of the reading material to finish quickly to increase the knowledge and happiness in your lonely time.
Abstract: Feel lonely? What about reading books? Book is one of the greatest friends to accompany while in your lonely time. When you have no friends and activities somewhere and sometimes, reading book can be a great choice. This is not only for spending the time, it will increase the knowledge. Of course the b=benefits to take will relate to what kind of book that you are reading. And now, we will concern you to try reading theory of scheduling as one of the reading material to finish quickly.
2,356 citations
01 Jan 1984
TL;DR: This book presents, characterizes and analyzes problem solving strategies that are guided by heuristic information and provides examples of how these strategies have changed over time.
Abstract: This book presents, characterizes and analyzes problem solving strategies that are guided by heuristic information
2,090 citations
TL;DR: The characteristics of the speech problem in particular, the special kinds of problem-solving uncertainty in that domain, the structure of the Hearsay-II system developed to cope with that uncertainty, and the relationship between Hearsey-II's structure and those of other speech-understanding systems are discussed.
Abstract: The Hearsay-II system, developed during the DARPA-sponsored five-year speech-understanding research program, represents both a specific solution to the speech-understanding problem and a general framework for coordinating independent processes to achieve cooperative problem-solving behavior. As a computational problem, speech understanding reflects a large number of intrinsically interesting issues. Spoken sounds are achieved by a long chain of successive transformations, from intentions, through semantic and syntactic structuring, to the eventually resulting audible acoustic waves. As a consequence, interpreting speech means effectively inverting these transformations to recover the speaker's intention from the sound. At each step in the interpretive process, ambiguity and uncertainty arise.
The Hearsay-II problem-solving framework reconstructs an intention from hypothetical interpretations formulated at various levels of abstraction. In addition, it allocates limited processing resources first to the most promising incremental actions. The final configuration of the Hearsay-II system comprises problem-solving components to generate and evaluate speech hypotheses, and a focus-of-control mechanism to identify potential actions of greatest value. Many of these specific procedures reveal novel approaches to speech problems. Most important, the system successfully integrates and coordinates all of these independent activities to resolve uncertainty and control combinatorics. Several adaptations of the Hearsay-II framework have already been undertaken in other problem domains, and it is anticipated that this trend will continue; many future systems necessarily will integrate diverse sources of knowledge to solve complex problems cooperatively.
Discussed in this paper are the characteristics of the speech problem in particular, the special kinds of problem-solving uncertainty in that domain, the structure of the Hearsay-II system developed to cope with that uncertainty, and the relationship between Hearsay-II's structure and those of other speech-understanding systems. The paper is intended for the general computer science audience and presupposes no speech or artificial intelligence background.
1,422 citations