A sequencing problem in the weaving industry

Mohamad H. Al-Haboubi; Shokri Z. Selim

doi:10.1016/0377-2217(93)90206-3

A sequencing problem in the weaving industry

Mohamad H. Al-Haboubi^*
, Shokri Z. Selim

^*Corresponding author for this work

King Fahd University of Petroleum & Minerals

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

12 Scopus citations

Abstract

The problem of sequencing jobs on a weaving machine is considered where set-up costs are included. The structure of the set-up cost is utilized to develop a polynomial time solution algorithm. The algorithm involves computing the shortest path of a network. An example is solved.

Original language	English
Pages (from-to)	65-71
Number of pages	7
Journal	European Journal of Operational Research
Volume	66
Issue number	1
DOIs	https://doi.org/10.1016/0377-2217(93)90206-3
State	Published - 2 Apr 1993

Bibliographical note

Funding Information:
The authors wish to acknowledge the support provided by the King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. The authors appreciate the many useful recommendations of the referees which improved the presentation of the paper.

Keywords

Job sequencing
Set-up costs
Shortest path
Travelling salesman problem

ASJC Scopus subject areas

General Computer Science
Modeling and Simulation
Management Science and Operations Research
Information Systems and Management

Access to Document

10.1016/0377-2217(93)90206-3

Cite this

@article{d7012baa65f141cc841d97b0b0402f58,

title = "A sequencing problem in the weaving industry",

abstract = "The problem of sequencing jobs on a weaving machine is considered where set-up costs are included. The structure of the set-up cost is utilized to develop a polynomial time solution algorithm. The algorithm involves computing the shortest path of a network. An example is solved.",

keywords = "Job sequencing, Set-up costs, Shortest path, Travelling salesman problem",

author = "Al-Haboubi, \{Mohamad H.\} and Selim, \{Shokri Z.\}",

note = "Funding Information: The authors wish to acknowledge the support provided by the King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. The authors appreciate the many useful recommendations of the referees which improved the presentation of the paper.",

year = "1993",

month = apr,

day = "2",

doi = "10.1016/0377-2217(93)90206-3",

language = "English",

volume = "66",

pages = "65--71",

journal = "European Journal of Operational Research",

issn = "0377-2217",

publisher = "Elsevier B.V.",

number = "1",

}

TY - JOUR

T1 - A sequencing problem in the weaving industry

AU - Al-Haboubi, Mohamad H.

AU - Selim, Shokri Z.

N1 - Funding Information: The authors wish to acknowledge the support provided by the King Fahd University of Petroleum and Minerals, Dhahran, Saudi Arabia. The authors appreciate the many useful recommendations of the referees which improved the presentation of the paper.

PY - 1993/4/2

Y1 - 1993/4/2

N2 - The problem of sequencing jobs on a weaving machine is considered where set-up costs are included. The structure of the set-up cost is utilized to develop a polynomial time solution algorithm. The algorithm involves computing the shortest path of a network. An example is solved.

AB - The problem of sequencing jobs on a weaving machine is considered where set-up costs are included. The structure of the set-up cost is utilized to develop a polynomial time solution algorithm. The algorithm involves computing the shortest path of a network. An example is solved.

KW - Job sequencing

KW - Set-up costs

KW - Shortest path

KW - Travelling salesman problem

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

U2 - 10.1016/0377-2217(93)90206-3

DO - 10.1016/0377-2217(93)90206-3

M3 - Article

AN - SCOPUS:0027904995

SN - 0377-2217

VL - 66

SP - 65

EP - 71

JO - European Journal of Operational Research

JF - European Journal of Operational Research

IS - 1

ER -

A sequencing problem in the weaving industry

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Fingerprint

Cite this