A RELATIONAL DATABASE APPROACH TO THE JOB SHOP SCHEDULING PROBLEM

Authors

  • P. Lindeque Department of Industrial and Systems Engineering, University of Pretoria
  • P.S. Kruger Department of Industrial and Systems Engineering, University of Pretoria

DOI:

https://doi.org/10.7166/2-1-451

Abstract

ENGLISH ABSTRACT: This paper will attempt to illuminate the advantages of an approach to the job shop scheduling problem using priority based search algorithms and database technology. It will use as basis a system developed for and implemented at a large manufacturing plant. The paper will also attempt to make some predictions as to future developments in these techniques and look at the possibility of including new technologies such as expert systems.

AFRIKAANSE OPSOMMING: Die voordele en toepaslikheid van prioriteits-gebaseerde soek-algoritmes en databasisstelsels op die taakwerkswinkelprobleem sal in hierdie artikel uitgelig word. 'n Stelsel wat by 'n groot vervaardigingsonderneming geimplementeer is, sal as uitgangspunt gebruik word. Toekomstige ontwikkelings in bogenoemde tegnieke en die moontlike insluiting van ekspertstelsels sal ook ondersoek word.

Downloads

Download data is not yet available.

Downloads

Published

2011-11-05

How to Cite

Lindeque, P., & Kruger, P. (2011). A RELATIONAL DATABASE APPROACH TO THE JOB SHOP SCHEDULING PROBLEM. The South African Journal of Industrial Engineering, 2(1). https://doi.org/10.7166/2-1-451

Issue

Vol. 2 No. 1 (1988)

Section

General Articles

License

Authors who publish in the Journal agree to the following terms:
  1. Authors retain copyright and grant the Journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this Journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the Journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this Journal.

Most read articles by the same author(s)

1 2 > >>