Job-Shop Scheduling Theory: What Is Relevant?

INFORMS Journal on Applied AnalyticsPublished 1 August 1988

Kenneth N. McKay, Frank Safayeni, John A. Buzacott

DOI10.1287/inte.18.4.84

Citations224

TL;DR

A preliminary field study is used to illustrate that the basic theoretical approach to scheduling 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.

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.

Keywords

Engineering

Operational Research Quarterly (1970-1977)Introduction to Sequencing and Scheduling

2,619 Citations1977A. J. Clewett, Kenneth R. Baker

Operations ResearchA Survey of Scheduling Rules

1,295 Citations1977S. S. Panwalkar, Wafik H. Iskander

This paper presents a summary of over 100 priority dispatching rules, a list of many references that analyze them, and a classification scheme.

International Journal of Production ResearchA state-of-the-art survey of dispatching rules for manufacturing job shop operations

1,005 Citations1982John H. Blackstone, Don T. Phillips +1 more

Journal of the Operational Research SocietySequencing and Scheduling: An Introduction to the Mathematics of the Job-Shop

1,004 Citations1982Graham K. Rand, Simon French

Operations ResearchA Review of Production Scheduling

781 Citations1981Stephen C. Graves

The intent of this paper is to present a broad classification for various scheduling problems, to review important theoretical developments for these problem classes, and to contrast the currently available theory with the practice of production scheduling.

Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)Constraint-directed search : a case study of job-shop scheduling

530 Citations1983Mark S. Fox

In this thesis, a system called ISIS is presented, which uses a constraint-directed search paradigm to solve the scheduling problem and provides a knowledge representation language for modeling organizations and their constraints.

View PDF

Recent Developments in Deterministic Sequencing and Scheduling: A Survey

318 Citations1982Eugene L. Lawler, Jan Karel Lenstra +1 more

The state of the art with respect to optimization and approximation algorithms and interpret these in terms of computational complexity theory are surveyed.

Management ScienceHeuristics in Job Shop Scheduling

226 Citations1966William S. Gere

The approach is simulative in that the operation of the shop is simulated in a Fortran program, but in addition to the straightforward use of priority rules for determining sequences of jobs on the machines, a number of heuristics or rules of thumb are incorporated.

International Journal of Production ResearchA survey and evaluation of static flowshop scheduling heuristics

92 Citations1984Yang Byung Park, C. Dennis Pegden +1 more

This paper provides a survey and evaluation of static flowshop scheduling rules and suggests which of the popular scheduling rules hold promise for application to practical flowshop problems.

Journal of the Operational Research SocietyLessons for O.R. from A.I.: A Scheduling Case Study

87 Citations1986T. J. Grant

Operational research (O.R.) with the currently fashionable topic of artificial intelligence (A.I.) at a detailed level is compared, and O.R. and A.I. approaches compared.