ManageChatDiscover
159318

A Flow Shop Rank Approach to GT Scheduling.

Article

Last updated: 04 Jan 2025

OverviewSimilar Items

Subjects

-

Tags

Production Engineering and Mechanical Design

Abstract

Previous gronp technology heuristics have not focused on the problem formulation: they have focused on family and dispatching rules which lead to different results depending on the type of die problem. The objective of this paper is to present a static exhaustive heuristic lo solve such problem for unlimited job shop manufacturing cell. It is mainly based on decomposing the cell-queue into subfamilies and con structing a graph showing the setup relationships between the machine arrangement aud the current partition of subfamilies. The solution is similar to that made in the flow shops in a simple applicable fashion. The heuristic is a trial to formulate the problem in an equivaleut flow shop to simplify the cell ussessmenr. 

DOI

10.21608/bfemu.2021.159318

Keywords

Subfamily, cellular, Sequence

Authors

First Name

Hassan

Last Name

Soltan

MiddleName

Ali Mohamed

Affiliation

Production and Mechanical Design Department., Faculty of Engineering., El-Mansoura University., Mansoura., Egypt.

Email

-

City

Mansoura

Orcid

-

Volume

22

Article Issue

2

Related Issue

22112

Issue Date

1997-06-01

Receive Date

1997-04-11

Publish Date

2021-06-01

Page Start

1

Page End

10

Print ISSN

1110-0923

Online ISSN

2735-4202

Article File

BFEMU_Volume 22_Issue 2_Pages 1-10.pdf

PDF . 133.1kB

Link

https://bfemu.journals.ekb.eg/article_159318.html

Detail API

https://bfemu.journals.ekb.eg/service?article_code=159318

Order

6

Type

Research Studies

Type Code

1,205

Publication Type

Journal

Publication Title

MEJ. Mansoura Engineering Journal

Publication Link

https://bfemu.journals.ekb.eg/

MainTitle

A Flow Shop Rank Approach to GT Scheduling.

Details

Type

Article

Created At

22 Jan 2023