1988
DOI: 10.1287/inte.18.4.84
|View full text |Cite
|
Sign up to set email alerts
|

Job-Shop Scheduling Theory: What Is Relevant?

Abstract: The theoretical approach of OR and AI to scheduling often is not applicable to the dynamic characteristics of the actual situation. A preliminary field study is used to illustrate that the basic theoretical approach does not represent the reality of open job-shop scheduling, and its applicability is limited to those situations that are fundamentally static and behave like the models. Better understanding and modeling of the scheduling situation is needed.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
63
0
5

Year Published

1992
1992
2018
2018

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 183 publications
(68 citation statements)
references
References 11 publications
0
63
0
5
Order By: Relevance
“…Our proposed approach addresses many of the limitations of existing job-shop scheduling identified in [5] by providing a decision support collaborative framework for scheduling. It enables scheduling solutions to be evaluated by experts with different points of view incorporating their knowledge in the system.…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Our proposed approach addresses many of the limitations of existing job-shop scheduling identified in [5] by providing a decision support collaborative framework for scheduling. It enables scheduling solutions to be evaluated by experts with different points of view incorporating their knowledge in the system.…”
Section: Resultsmentioning
confidence: 99%
“…Automated scheduling, whatever its nature whether heuristic or rulebased, may not produce realistic schedules in environments where contextual information is represented inadequately. Where objectives are complex and unstated and situations are dynamic and uncertain, domain experts address these issues [5][6][7][8] bringing to scheduling their inductive and pattern recognition abilities.…”
Section: Collaborative Schedulingmentioning
confidence: 99%
“…In fact, in many production scheduling domains, the management problem is more accurately described as a rescheduling problem rather than a scheduling problem. In this regard, as has been recently pointed out by several researchers (e.g., [85]), work in scheduling theory has been solving the wrong problem altogether. For the most part, OR research relcvant to managing executional uncertainty has focused on the development of local dispatch heuristics for dynamic decision-making (e.g., [111]).…”
Section: Existing Solutionsmentioning
confidence: 96%
“…There is a range of applications here, from simple closed-loop presentation of a canned solution which cannot be modified, through dynamic algorithms that can account for changing situations within a limited modelling framework, to fully interactive support systems which provide recommendations, along with a transparent set of reasoning, and allow for modification and interaction as the schedule is being built (Godin 1978, McKay et al 1988, Glassy 1991. While afterthe-fact modification is an improvement on the flexibility of batch scheduling, it is still short of fully interactive scheduling.…”
Section: Operational Efficiency and Effectivenessmentioning
confidence: 99%