Professional Documents
Culture Documents
14-16, Kitakyushu
Abstract. The objective of this research is to develop a program for a production scheduling. In addition, it
also concentrates on developing the user interface to key in data and modify which is appropriate for the
actual situation encounted. This research studies the production scheduling system of a glass industry. The
production scheduling systems have 10 job types and different process routing. From traditional job
scheduling, we found that the delivery date was often tardiness. This research proposes the computer
simulation software (Arena) used for planning and presents heuristic approaches such as Shortest Processing
Time (SPT), Earliest Due Date (EDD), Earliness cost to Tardiness cost Ratio (ETR), Longest Processing Time
(LPT) and Least Operation Number (LOPN) to minimize the total cost.
1. INTRODUCTION (LPT) and Least Operation Number (LOPN) to minimize the total
cost.
Many real scheduling problems are represented as Job
Shop Scheduling Problem (JSSP). Because almost all 2. HEURISTIC METHOD
scheduling problems, comprising JSSP, are the NP hard
optimization problems, an efficient approximate method is Heuristics depend on experience and expertise like
required. The approximate methods are categorized in dispatching rules. Since the dispatching rules are based on
heuristics and meta-heuristics. Meta-heuristics are methods experience and expertise, some of the dispatch rules are not
that search many solutions simultaneously by simple effective for some problems, i. e., conventionally, there is no
calculation and choose the best one in the solutions. This dispatch rule that always gives good solution for any
category includes Genetic-Algorithm and Simulated- problem. Therefore, it is useful to develop a new rule that can
Annealing. be applied to many problems. Dispatching rules have been
Job shop scheduling is essentially a task of allocation of applied for this analysis. This is due to that they are
machines over time to the jobs in such a way that the selected commonly used in manufacturing. The rules are following.
performance criteria are optimized. For the shops running in
the make-to-order fashion, the most important goal is to a. Short Processing Time (SPT ): The short processing time
complete the customers orders within the specified due could be the most well known dispatching rule, and was
dates. usually reported to perform well on minimizing tardy rate
This research studied about production scheduling when the shop has high utilization and/or tight due date
system of the glass industry. The findings of production setting .
scheduling systems have 10 job types with different process
routing. From the traditional job scheduling, we found that b. Earliest Due Date (EDD): The earliest due date is the
the delivery date was often tardiness. This proposed the representative of dispatching rules focused on due date-
computer simulation software (Arena) that used for planning based objectives.
and presents the heuristic approach such as Shortest
Processing Time (SPT), Earliest Due Date (EDD), Earliness
cost to Tardiness cost Ratio (ETR), Longest Processing Time
________________________________________
: Roongrat Pisuchpen
682
APIEMS2009 Dec. 14-16, Kitakyushu
683
APIEMS2009 Dec. 14-16, Kitakyushu
5. SCHEDULING PROGRAM
684
APIEMS2009 Dec. 14-16, Kitakyushu
685
APIEMS2009 Dec. 14-16, Kitakyushu
5. RESULT
686
APIEMS2009 Dec. 14-16, Kitakyushu
687