An operation scheme for make-to-order job-shop production systems

K. Choi, S. Kim, Hong Chul Lee, I. Kwon

Research output: Contribution to journalArticle

5 Citations (Scopus)

Abstract

The purpose of this paper is to solve multi-job order release problem whose objective is to minimize the sum of mean shop floor flow times (SFFTs) of orders subject to due-date constraint. A heuristic algorithm is proposed for the problem by decomposing the load profile of the shop. The load profile is divided into two parts. One is for the planning orders (new orders and unreleased orders) and the other is for the current orders being processed. The advantage of decomposing the load profile is to reduce computational complexity in the estimation step of order completion time. A job dispatching rule is also suggested to synchronize part flows in the shop floor. The experimental results show that work-in-process (WIP) in both bottleneck stations and assembly station, the SFFT of orders, and the percentage of tardy orders are significantly reduced.

Original languageEnglish
Pages (from-to)765-768
Number of pages4
JournalComputers and Industrial Engineering
Volume33
Issue number3-4
Publication statusPublished - 1997 Dec 1

Fingerprint

Job Shop
Heuristic algorithms
Production Systems
Computational complexity
Planning
Flow Time
Dispatching Rules
Shopfloor
Job shop
Make-to-order
Due Dates
Completion Time
Heuristic algorithm
Percentage
Flow time
Computational Complexity
Minimise

Keywords

  • Dispatching
  • Load profile
  • Make-to-order job shop
  • Multi-job order release

ASJC Scopus subject areas

  • Information Systems and Management
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Cite this

An operation scheme for make-to-order job-shop production systems. / Choi, K.; Kim, S.; Lee, Hong Chul; Kwon, I.

In: Computers and Industrial Engineering, Vol. 33, No. 3-4, 01.12.1997, p. 765-768.

Research output: Contribution to journalArticle

@article{418a605a5ec84313930e0b2e5e3677fe,
title = "An operation scheme for make-to-order job-shop production systems",
abstract = "The purpose of this paper is to solve multi-job order release problem whose objective is to minimize the sum of mean shop floor flow times (SFFTs) of orders subject to due-date constraint. A heuristic algorithm is proposed for the problem by decomposing the load profile of the shop. The load profile is divided into two parts. One is for the planning orders (new orders and unreleased orders) and the other is for the current orders being processed. The advantage of decomposing the load profile is to reduce computational complexity in the estimation step of order completion time. A job dispatching rule is also suggested to synchronize part flows in the shop floor. The experimental results show that work-in-process (WIP) in both bottleneck stations and assembly station, the SFFT of orders, and the percentage of tardy orders are significantly reduced.",
keywords = "Dispatching, Load profile, Make-to-order job shop, Multi-job order release",
author = "K. Choi and S. Kim and Lee, {Hong Chul} and I. Kwon",
year = "1997",
month = "12",
day = "1",
language = "English",
volume = "33",
pages = "765--768",
journal = "Computers and Industrial Engineering",
issn = "0360-8352",
publisher = "Elsevier Limited",
number = "3-4",

}

TY - JOUR

T1 - An operation scheme for make-to-order job-shop production systems

AU - Choi, K.

AU - Kim, S.

AU - Lee, Hong Chul

AU - Kwon, I.

PY - 1997/12/1

Y1 - 1997/12/1

N2 - The purpose of this paper is to solve multi-job order release problem whose objective is to minimize the sum of mean shop floor flow times (SFFTs) of orders subject to due-date constraint. A heuristic algorithm is proposed for the problem by decomposing the load profile of the shop. The load profile is divided into two parts. One is for the planning orders (new orders and unreleased orders) and the other is for the current orders being processed. The advantage of decomposing the load profile is to reduce computational complexity in the estimation step of order completion time. A job dispatching rule is also suggested to synchronize part flows in the shop floor. The experimental results show that work-in-process (WIP) in both bottleneck stations and assembly station, the SFFT of orders, and the percentage of tardy orders are significantly reduced.

AB - The purpose of this paper is to solve multi-job order release problem whose objective is to minimize the sum of mean shop floor flow times (SFFTs) of orders subject to due-date constraint. A heuristic algorithm is proposed for the problem by decomposing the load profile of the shop. The load profile is divided into two parts. One is for the planning orders (new orders and unreleased orders) and the other is for the current orders being processed. The advantage of decomposing the load profile is to reduce computational complexity in the estimation step of order completion time. A job dispatching rule is also suggested to synchronize part flows in the shop floor. The experimental results show that work-in-process (WIP) in both bottleneck stations and assembly station, the SFFT of orders, and the percentage of tardy orders are significantly reduced.

KW - Dispatching

KW - Load profile

KW - Make-to-order job shop

KW - Multi-job order release

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

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

M3 - Article

VL - 33

SP - 765

EP - 768

JO - Computers and Industrial Engineering

JF - Computers and Industrial Engineering

SN - 0360-8352

IS - 3-4

ER -