Deterministic job-shop scheduling: Past, present and future

A. S. Jain, S. Meeran

Research output: Contribution to journalArticle

531 Citations (Scopus)

Abstract

Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been investigated from a variety of perspectives resulting in several analytical techniques combining generic as well as problem specific strategies. We seek to assess a subclass of this problem in which the objective is minimising makespan, by providing an overview of the history, the techniques used and the researchers involved. The sense and direction of their work is evaluated by assessing the reported results of their techniques on the available benchmark problems. From these results the current situation and pointers for future work are provided.

Original languageEnglish
Pages (from-to)390-434
Number of pages45
JournalEuropean Journal of Operational Research
Volume113
Issue number2
DOIs
Publication statusPublished - 1 Mar 1999

Fingerprint

Job Shop Scheduling
Job Shop Scheduling Problem
Benchmark
Job shop scheduling
Makespan
Analytical techniques

Keywords

  • Computational study
  • Job-shop
  • Review
  • Scheduling theory

ASJC Scopus subject areas

  • Modelling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

Deterministic job-shop scheduling : Past, present and future. / Jain, A. S.; Meeran, S.

In: European Journal of Operational Research, Vol. 113, No. 2, 01.03.1999, p. 390-434.

Research output: Contribution to journalArticle

@article{c1445e2a79854537a20d59305e2a5230,
title = "Deterministic job-shop scheduling: Past, present and future",
abstract = "Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been investigated from a variety of perspectives resulting in several analytical techniques combining generic as well as problem specific strategies. We seek to assess a subclass of this problem in which the objective is minimising makespan, by providing an overview of the history, the techniques used and the researchers involved. The sense and direction of their work is evaluated by assessing the reported results of their techniques on the available benchmark problems. From these results the current situation and pointers for future work are provided.",
keywords = "Computational study, Job-shop, Review, Scheduling theory",
author = "Jain, {A. S.} and S. Meeran",
year = "1999",
month = "3",
day = "1",
doi = "10.1016/S0377-2217(98)00113-1",
language = "English",
volume = "113",
pages = "390--434",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "2",

}

TY - JOUR

T1 - Deterministic job-shop scheduling

T2 - Past, present and future

AU - Jain, A. S.

AU - Meeran, S.

PY - 1999/3/1

Y1 - 1999/3/1

N2 - Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been investigated from a variety of perspectives resulting in several analytical techniques combining generic as well as problem specific strategies. We seek to assess a subclass of this problem in which the objective is minimising makespan, by providing an overview of the history, the techniques used and the researchers involved. The sense and direction of their work is evaluated by assessing the reported results of their techniques on the available benchmark problems. From these results the current situation and pointers for future work are provided.

AB - Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been investigated from a variety of perspectives resulting in several analytical techniques combining generic as well as problem specific strategies. We seek to assess a subclass of this problem in which the objective is minimising makespan, by providing an overview of the history, the techniques used and the researchers involved. The sense and direction of their work is evaluated by assessing the reported results of their techniques on the available benchmark problems. From these results the current situation and pointers for future work are provided.

KW - Computational study

KW - Job-shop

KW - Review

KW - Scheduling theory

UR - http://www.scopus.com/inward/record.url?scp=0033102020&partnerID=8YFLogxK

U2 - 10.1016/S0377-2217(98)00113-1

DO - 10.1016/S0377-2217(98)00113-1

M3 - Article

AN - SCOPUS:0033102020

VL - 113

SP - 390

EP - 434

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 2

ER -