An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell

Farzad Mahmoodi; Kevin J. Dooley; Patrick J. Starr

doi:10.1080/00207549008942824

An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell

Farzad Mahmoodi, Kevin J. Dooley, Patrick J. Starr

Research output: Contribution to journal › Article › peer-review

74 Scopus citations

Abstract

The objective of this study is to develop dynamic scheduling heuristics for cellular manufacturing environments (group scheduling or family heuristics) and compare them with existing family heuristics under various shop floor conditions. The proposed family heuristics stress good due date performance while reducing overall set-up time. Computer simulation is used to test three queue selection rules in conjunction with three dispatching rules under eight experimental conditions in a job shop cell. The results indicate that several of the proposed heuristics substantially improve the performance of the cell over the best previously suggested family heuristic under all experimental conditions.

Original language	English (US)
Pages (from-to)	1695-1711
Number of pages	17
Journal	International Journal of Production Research
Volume	28
Issue number	9
DOIs	https://doi.org/10.1080/00207549008942824
State	Published - Sep 1990
Externally published	Yes

ASJC Scopus subject areas

Strategy and Management
Management Science and Operations Research
Industrial and Manufacturing Engineering

Access to Document

10.1080/00207549008942824

Cite this

@article{0104bc85a1104d33aa7708c8bc0192df,

title = "An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell",

abstract = "The objective of this study is to develop dynamic scheduling heuristics for cellular manufacturing environments (group scheduling or family heuristics) and compare them with existing family heuristics under various shop floor conditions. The proposed family heuristics stress good due date performance while reducing overall set-up time. Computer simulation is used to test three queue selection rules in conjunction with three dispatching rules under eight experimental conditions in a job shop cell. The results indicate that several of the proposed heuristics substantially improve the performance of the cell over the best previously suggested family heuristic under all experimental conditions.",

author = "Farzad Mahmoodi and Dooley, {Kevin J.} and Starr, {Patrick J.}",

note = "Funding Information: Acknowledgments This research was partially supported by The School of Management of Clarkson University and by the University of Minnesota CIM consortium. Copyright: Copyright 2016 Elsevier B.V., All rights reserved.",

year = "1990",

month = sep,

doi = "10.1080/00207549008942824",

language = "English (US)",

volume = "28",

pages = "1695--1711",

journal = "International Journal of Production Research",

issn = "0020-7543",

publisher = "Taylor and Francis Ltd.",

number = "9",

}

TY - JOUR

T1 - An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell

AU - Mahmoodi, Farzad

AU - Dooley, Kevin J.

AU - Starr, Patrick J.

N1 - Funding Information: Acknowledgments This research was partially supported by The School of Management of Clarkson University and by the University of Minnesota CIM consortium. Copyright: Copyright 2016 Elsevier B.V., All rights reserved.

PY - 1990/9

Y1 - 1990/9

N2 - The objective of this study is to develop dynamic scheduling heuristics for cellular manufacturing environments (group scheduling or family heuristics) and compare them with existing family heuristics under various shop floor conditions. The proposed family heuristics stress good due date performance while reducing overall set-up time. Computer simulation is used to test three queue selection rules in conjunction with three dispatching rules under eight experimental conditions in a job shop cell. The results indicate that several of the proposed heuristics substantially improve the performance of the cell over the best previously suggested family heuristic under all experimental conditions.

AB - The objective of this study is to develop dynamic scheduling heuristics for cellular manufacturing environments (group scheduling or family heuristics) and compare them with existing family heuristics under various shop floor conditions. The proposed family heuristics stress good due date performance while reducing overall set-up time. Computer simulation is used to test three queue selection rules in conjunction with three dispatching rules under eight experimental conditions in a job shop cell. The results indicate that several of the proposed heuristics substantially improve the performance of the cell over the best previously suggested family heuristic under all experimental conditions.

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

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

U2 - 10.1080/00207549008942824

DO - 10.1080/00207549008942824

M3 - Article

AN - SCOPUS:0025485232

SN - 0020-7543

VL - 28

SP - 1695

EP - 1711

JO - International Journal of Production Research

JF - International Journal of Production Research

IS - 9

ER -

An investigation of dynamic group scheduling heuristics in a job shop manufacturing cell

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this