Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups

Kuo Ching Ying; Jatinder N.D. Gupta; Shih Wei Lin; Zen Jung Lee

doi:10.1080/00207540802534707

Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups

Kuo Ching Ying
, Jatinder N.D. Gupta
, Shih Wei Lin^*
, Zen Jung Lee

^*Corresponding author for this work

National Taipei University of Technology
University of Alabama in Huntsville
Chang Gung University
Huafan University

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

46 Scopus citations

Abstract

Through the use of an effective simulated annealing algorithm, this paper presents an extensive computational investigation concerning the performance evaluation of non-permutation vs. permutation schedules for the flowline manufacturing cell with sequence dependent setup times. The results show that there are significant improvements made by using non-permutation schedules over permutation schedules regarding completion-time based and due-date based criteria. It is suggested that practitioners could adopt non-permutation schedules to improve their operational efficiency within a reasonable amount of computational effort.

Original language	English
Pages (from-to)	2169-2184
Number of pages	16
Journal	International Journal of Production Research
Volume	48
Issue number	8
DOIs	https://doi.org/10.1080/00207540802534707
State	Published - 01 2010
Externally published	Yes

UN SDGs

This output contributes to the following UN Sustainable Development Goals (SDGs)

SDG 9 Industry, Innovation, and Infrastructure

Keywords

Due dates
Flowshop manufacturing cell
Makespan
Non-permutation schedules
Scheduling
Sequence dependent family setups
Simulated annealing algorithm

Access to Document

10.1080/00207540802534707

Cite this

@article{6ab13a0b6aa24da8a73f354a82c1a902,

title = "Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups",

abstract = "Through the use of an effective simulated annealing algorithm, this paper presents an extensive computational investigation concerning the performance evaluation of non-permutation vs. permutation schedules for the flowline manufacturing cell with sequence dependent setup times. The results show that there are significant improvements made by using non-permutation schedules over permutation schedules regarding completion-time based and due-date based criteria. It is suggested that practitioners could adopt non-permutation schedules to improve their operational efficiency within a reasonable amount of computational effort.",

keywords = "Due dates, Flowshop manufacturing cell, Makespan, Non-permutation schedules, Scheduling, Sequence dependent family setups, Simulated annealing algorithm",

author = "Ying, \{Kuo Ching\} and Gupta, \{Jatinder N.D.\} and Lin, \{Shih Wei\} and Lee, \{Zen Jung\}",

year = "2010",

month = jan,

doi = "10.1080/00207540802534707",

language = "英语",

volume = "48",

pages = "2169--2184",

journal = "International Journal of Production Research",

issn = "0020-7543",

publisher = "Taylor and Francis Ltd.",

number = "8",

}

TY - JOUR

T1 - Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups

AU - Ying, Kuo Ching

AU - Gupta, Jatinder N.D.

AU - Lin, Shih Wei

AU - Lee, Zen Jung

PY - 2010/1

Y1 - 2010/1

N2 - Through the use of an effective simulated annealing algorithm, this paper presents an extensive computational investigation concerning the performance evaluation of non-permutation vs. permutation schedules for the flowline manufacturing cell with sequence dependent setup times. The results show that there are significant improvements made by using non-permutation schedules over permutation schedules regarding completion-time based and due-date based criteria. It is suggested that practitioners could adopt non-permutation schedules to improve their operational efficiency within a reasonable amount of computational effort.

AB - Through the use of an effective simulated annealing algorithm, this paper presents an extensive computational investigation concerning the performance evaluation of non-permutation vs. permutation schedules for the flowline manufacturing cell with sequence dependent setup times. The results show that there are significant improvements made by using non-permutation schedules over permutation schedules regarding completion-time based and due-date based criteria. It is suggested that practitioners could adopt non-permutation schedules to improve their operational efficiency within a reasonable amount of computational effort.

KW - Due dates

KW - Flowshop manufacturing cell

KW - Makespan

KW - Non-permutation schedules

KW - Scheduling

KW - Sequence dependent family setups

KW - Simulated annealing algorithm

UR - https://www.scopus.com/pages/publications/77951142861

U2 - 10.1080/00207540802534707

DO - 10.1080/00207540802534707

M3 - 文章

AN - SCOPUS:77951142861

SN - 0020-7543

VL - 48

SP - 2169

EP - 2184

JO - International Journal of Production Research

JF - International Journal of Production Research

IS - 8

ER -

Permutation and non-permutation schedules for the flowline manufacturing cell with sequence dependent family setups

Abstract

UN SDGs

Keywords

Access to Document

Other files and links

Fingerprint

Cite this