• Title/Summary/Keyword: Job sequence

Search Result 129, Processing Time 0.02 seconds

An approximation method for job shop scheduling problem with sequence independent setup time (준비시간을 고려한 job shop 스케쥴링 문제의 근사적 해법에 관한 연구)

  • 정한일;김기동;정대영;박진우
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.306-309
    • /
    • 1996
  • The job shop scheduling problem has been a major target for many researchers. And, most of the past studies did not consider setup time. In many cases of real manufacturing environment, however, there exists a setup time for each operations. The setup can be divide into two parts, one can be done after job arrival. The setup time based on the latter can be summed together with processing time, but that based on the former can not be. We propose an approximation method based on shifting bottleneck procedure for solving the job shop scheduling problem with sequence independent setup time. It schedules the machines one by one, taking a bottleneck machine among the machines not yet scheduled. Every time after a new machine is scheduled, all schedules previously established are updated. Both the bottlenck search and the schedule updating procedure are based on solving a single machine scheduling problem with ready time, setup time and delivery time iteratively.

  • PDF

Optimum Scheduling Algorithm for Job Sequence, Common Due Date Assignment and Makespan to Minimize Total Costs for Multijob in Multimachine Systems (다수(多数) 기계(機械)의 총비용(總費用)을 최소화(最小化)하는 최적작업순서, 공통납기일 및 작업완료일 결정을 위한 일정계획(日程計劃))

  • No, In-Gyu;Kim, Sang-Cheol
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.12 no.1
    • /
    • pp.1-11
    • /
    • 1986
  • This research is concerned with n jobs, m parallel identical machines scheduling problem in which all jobs have a common due date. The objective of the research is to develop an optimum scheduling algorithm for determining an optimal job sequence, the optimal value of the common due date and the minimum makespan to minimize total cost. The total cost is based on the common due date cost, the earliness cost, the tardiness cost and the flow time cost of each job in the selected sequence. The optimum scheduling algorithm is developed. A numerical example is given to illustrate the scheduling algorithm.

  • PDF

Determination of the Optimal Job Sequence on the Flow-Shop Type FMS Considering the AGVs' Entering Interval (AGV 투입간격을 고려한 Flow Shop형 FMS의 최적작업순서 결정)

  • ;;Yang, Dae Yong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.17 no.3
    • /
    • pp.47-57
    • /
    • 1992
  • The purpose of this paper is to improve the operation performance of unit-load Automated Guided Vehicles (AGV's) used as a carrier and mobile workstation in a flow-shop type flexible manufacturing system. An algorithm is developed to determine the optimal job sequence which minimizes the vehicle idle time on the line and the production makespan by the use of the entering interval and travel time between workcenters. An entering times of AGV's and the minimum number of AGV's required are calculated by optimal job sequence. When the numbe rof AGV's is limited, enterling times of AGV's are adjusted to maximize the efficient use of vehicles. A numerical example is given to illustrate the application of the algorithm.

  • PDF

A Study on Job Sequence and Feeder Allocation Problem in PCB Assembly Line (PCB 조립 공정의 작업 투입 순서 및 부품함 배치 문제에 관한 연구)

  • Yu, Sung-Yeol;Lee, Kang-Bae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.29 no.1
    • /
    • pp.63-71
    • /
    • 2006
  • In this paper, we consider a planning problem arising from printed circuit board manufacturing industries. Given a set of several types of PCBs, component feeders and surface mounting machines in series in a PCB assembly line, the problem is to define the feeder allocation and job sequence with the objective of minimizing the total operation time of the line. We formulate the problem as a mathematical model. And, the problem is proven to be NP-hard, so a genetic algorithm is developed. Finally, we give test results to evaluate the performance of the genetic algorithm.

Job Shop Scheduling Problems with Common Due Date (공통납기를 고려한 주문생산형 일정계획문제)

  • 김진규;이근부
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.15 no.25
    • /
    • pp.23-31
    • /
    • 1992
  • This paper is concerned with an n jobs one machine Job shop scheduling problems in which all jobs have a common due date and unequal penalties occur when a job is completed before or after due date. The objective is to determine an optimal sequence and the corresponding common due date that yield the global minimum value of a penalty function Then a sequence that minimize the penalty function globally is a V-shaped sequence Using the idea of linear equations and a LGP(Linear Goal Programming), this paper shows that LGP and MAD(Mean Absolute Deviation) are equivalent problems. Therefore an efficient algorithm that is developed for MAD problem holds for LGP problem and vice-versa. A numerical example to account for the algorithm is provided.

  • PDF

JPS 할당규칙의 Transitivity 증명을 통한 총납기지연 최소화

  • 전태준;박성호
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 1999.12a
    • /
    • pp.485-491
    • /
    • 1999
  • 총납기지연 최소화 문제에서 많은 할당규칙들이 개발되어져 왔는데, 대부분의 개발 배경이 모든 Job이 동일한 시작시간을 갖는 Single Machine을 대상으로 하였기 때문에 이 할당규칙들을 Job의 시작시간이 다르게 주어지는 문제에 그대로 적용했을 때는 만족할만한 결과를 얻기가 쉽지 않다. 따라서 본 연구에서는 다른 시작시간을 갖는 Single Machine문제에서 총납기지연을 최소화하기 위하여 먼저, 새로운 작업쌍 순서(Job Pair Sequencing) 할당규칙을 제시한다. 제시되는 할당규칙은 Job들간의 Sequence를 쌍으로 비교하여 총납기지연 측면에서 선행이 바람직한 Job을 선택한다. 그리고 제시된 할당규칙에 대하여 다수개의 Job에 적용 시 선택된 Job들간에 Transitivity 가 성립됨을 증명함으로서 총납기지연을 최소화 시린 수 잇.음을 증명하였다.

  • PDF

A Comparative Study of Two-phase Heuristic Approaches to General Job Shop Scheduling Problem

  • Sun, Ji Ung
    • Industrial Engineering and Management Systems
    • /
    • v.7 no.2
    • /
    • pp.84-92
    • /
    • 2008
  • Scheduling is one of the most important issues in the planning and operation of production systems. This paper investigates a general job shop scheduling problem with reentrant work flows and sequence dependent setup times. The disjunctive graph representation is used to capture the interactions between machines in job shop. Based on this representation, four two-phase heuristic procedures are proposed to obtain near optimal solutions for this problem. The obtained solutions in the first phase are substantially improved by reversing the direction of some critical disjunctive arcs of the graph in the second phase. A comparative study is conducted to examine the performance of these proposed algorithms.

Scheduling Algorithms for the Maximal Total Revenue on a Single Processor with Starting Time Penalty

  • Joo, Un-Gi
    • Management Science and Financial Engineering
    • /
    • v.18 no.1
    • /
    • pp.13-20
    • /
    • 2012
  • This paper considers a revenue maximization problem on a single processor. Each job is identified as its processing time, initial reward, reward decreasing rate, and preferred start time. If the processor starts a job at time zero, revenue of the job is its initial reward. However, the revenue decreases linearly with the reward decreasing rate according to its processing start time till its preferred start time and finally its revenue is zero if it is started the processing after the preferred time. Our objective is to find the optimal sequence which maximizes the total revenue. For the problem, we characterize the optimal solution properties and prove the NP-hardness. Based upon the characterization, we develop a branch-and-bound algorithm for the optimal sequence and suggest five heuristic algorithms for efficient solutions. The numerical tests show that the characterized properties are useful for effective and efficient algorithms.

Analysis of Gendered Job Sequence through Optimal Matching (최적일치법을 이용한 남녀간 직업 배열의 분석)

  • Han, Joon
    • Journal of Labour Economics
    • /
    • v.24 no.1
    • /
    • pp.149-176
    • /
    • 2001
  • This paper analyzes job sequences of men and women using optimal matching in order to find patterns of intra-generational mobility in Korean society. Men and women differ in their job careers: men show long-lasting job sequences with few gaps, while women either have short careers or have interrupted careers with long gaps. Long gaps in men's career are limited to those cases in which men move from agricultural to other job. The results from a combination of optimal matching and cluster analysis show that men's job sequences cluster around major occupations while women's cluster in terms of sequence length. The interrupted careers characteristic of women are considered to be consequent on the burdens of house keeping and child raising together with the discrimination against women pursuing careers.

  • PDF

Common Due-Date Assignment and Scheduling on Parallel Machines with Sequence-Dependent Setup Times

  • Kim, Jun-Gyu;Yu, Jae-Min;Lee, Dong-Ho
    • Management Science and Financial Engineering
    • /
    • v.19 no.1
    • /
    • pp.29-36
    • /
    • 2013
  • This paper considers common due-date assignment and scheduling on parallel machines. The main decisions are: (a) deter-mining the common due-date; (b) allocating jobs to machines; and (c) sequencing the jobs assigned to each machine. The objective is to minimize the sum of the penalties associated with common due-date assignment, earliness and tardiness. As an extension of the existing studies on the problem, we consider sequence-dependent setup times that depend on the type of job just completed and on the job to be processed. The sequence-dependent setups, commonly found in various manufacturing systems, make the problem much more complicated. To represent the problem more clearly, a mixed integer programming model is suggested, and due to the complexity of the problem, two heuristics, one with individual sequence-dependent setup times and the other with aggregated sequence-dependent setup times, are suggested after analyzing the characteristics of the problem. Computational experiments were done on a number of test instances and the results are reported.