ISSN : 2005-0461(Print)
ISSN : 2287-7975(Online)
ISSN : 2287-7975(Online)
Journal of Society of Korea Industrial and Systems Engineering Vol.19 No.39 pp.275-284
Slack Degree에 의한 n/m Job-Shop 스케줄링 문제의 발견적 해법에 관한 연구
A Study on the Heuristic Solution for n/m Job-Shop Scheduling Problems of Slack Degree
Abstract
It can be made a definition that scheduling is a imposition of machinery and equipment to perform a collection of tasks. Ultimately scheduling is an assessment of taking order for which would be perform. So it is called "sequencing" in other words. In a job shop scheduling, the main object is to making delivery in accordance with the due date and order form customer, not to producing lots of quantity with minimizing mean flow time in a given time. Actually, in a company, they concentrate more in the delivery than minimizing the mean flow time. Therefore this paper suggest a new priority dispatching rule under consideration as below in a n/m job shop scheduling problem with due date. 1. handling/transportation time, 2. the size of customer order With this algorithm, we can make a scheduling for minimizing the tardiness of delivery which satisfy a goal of production.roduction.