• Title/Summary/Keyword: job sequencing problem

Search Result 29, Processing Time 0.026 seconds

A Case Study on the Scheduling for a Tube Manufacturing System (튜브 제조 시스템의 생산 스케줄링 사례연구)

  • Yim, D.S.;Park, C.H.;Cho, N.C.;Oh, H.S.
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.3
    • /
    • pp.110-117
    • /
    • 2009
  • This paper introduces a case study for efficient generation of production schedules in a tube manufacturing system. The considered scheduling problem consists of two sub problems : lot sizing for a job and Job sequencing. Since these problems require simulation optimization in which the performance measures are obtained by simulation execution, the trade-off between solution quality and computation time is an important issue. In this study, the optimal lot size for every product type is determined from simulation experiments. Then, target production quantity for each product type is transformed to several jobs such that a Job consists of determined lot size. To obtain the good solution for a Job sequence in a reasonable time, a number of alternatives are generated from heuristic rules developed by intuition and analysis of the considered system, and a job sequence is selected from simulation experiments.

APPLICATION OF CONSTRAINT LOGIC PROGRAMMING TO JOB SEQUENCING

  • Ko, Jesuk;Ku, Jaejung
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2000.04a
    • /
    • pp.617-620
    • /
    • 2000
  • In this paper, we show an application of constraint logic programming to the operation scheduling on machines in a job shop. Constraint logic programming is a new genre of programming technique combining the declarative aspect of logic programming with the efficiency of constraint manipulation and solving mechanisms. Due to the latter feature, combinatorial search problems like scheduling may be resolved efficiently. In this study, the jobs that consist of a set of related operations are supposed to be constrained by precedence and resource availability. We also explore how the constraint solving mechanisms can be defined over a scheduling domain. Thus the scheduling approach presented here has two benefits: the flexibility that can be expected from an artificial intelligence tool by simplifying greatly the problem; and the efficiency that stems from the capability of constraint logic programming to manipulate constraints to prune the search space in an a priori manner.

  • PDF

Scheduling of the Bottleneck Operation with Capacity-Dependent Processing Time (장비능력에 의존적인 처리시간을 가진 애로공정의 일정계획 수립(몰드변압기 공장을 중심으로))

  • Seo, Jun-Yong;Koh, Jae-Moon
    • IE interfaces
    • /
    • v.14 no.4
    • /
    • pp.385-393
    • /
    • 2001
  • In this paper, a scheme of scheduling a bottleneck operation is presented for production planning of make-to-order. We focus on the problem of capacity-dependent processing time in which processing time of the bottleneck operation is not fixed, but varies with job sequence or equipment capacity. For this, a genetic algorithm is applied for job sequencing with an objective function of mean square of weighted deviation. An experimental study is implemented in power transformer plant and results are compared with those of the EDD rule. It shows that the genetic algorithm is relatively good for most cases.

  • PDF

A Scheduling Problem for Production-Delivery in a Supply Chain (생산 및 배송을 위한 공급사슬망에서의 일정계획에 관한 연구)

  • Yoon, Sang-Hum;Lee, Ik-Sun
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.31 no.4
    • /
    • pp.35-47
    • /
    • 2006
  • This paper considers an integrated scheduling problem for consecutive production and delivery stages in a two-stage supply chain. The Production is performed on a single facility and then the finished products are delivered to the customer by capacitated multiple vehicles. The objective of this paper is to obtain job sequencing and delivery batching minimizing the total cost of the associated WIP inventory, finished product inventory and delivery. The inventory cost is characterized by the sum of weighted flowtime. The delivery cost is proportional to the required number of delivery batches. Some polynomial-solvable cases are derived. For the general case, two efficient heuristic algorithms are suggested, and then the heuristics are tested through some numerical experiments.

Dynamic Programming Algorithms for Scheduling Jobs with Sequence-Dependent Processing Times (순서 의존적인 작업시간을 갖는 작업들의 스케쥴링을 위한 동적계획법)

  • Lee, Moon-Kyu;Lee, Seung-Joo
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.24 no.3
    • /
    • pp.431-446
    • /
    • 1998
  • In this paper, we consider the problem of scheduling n jobs with sequence-dependent processing times on a set of parallel-identical machines. The processing time of each job consists of a pure processing time and a sequence-dependent setup time. The objective is to maximize the total remaining machine available time which can be used for other tasks. For the problem, we first propose a dynamic programming(DP) algorithm for sequencing jobs processed on a single machine. The algorithm is then extended to handle jobs on parallel-identical machines. Finally, we developed an improved version of the algorithm which generates optimal solutions using much smaller amount of memory space and computing time. Computational results are provided to illustrate the performance of the DP algorithms.

  • PDF

A Study on Flow Shop Scheduling Problems under Fuzzy Environment (퍼지 환경하에서의 FLOW SHOP 일정계획 방법에 관한 연구)

  • 김정자;이상완;박병주
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.13 no.2
    • /
    • pp.163-163
    • /
    • 1988
  • This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

A study on flow shop scheduling problems under fuzzy environment (퍼지 환경하에서의 flow shop 일정계획 방법에 관한 연구)

  • 김정자;이상완;박병주
    • Korean Management Science Review
    • /
    • v.13 no.2
    • /
    • pp.163-175
    • /
    • 1996
  • This research shows that fuzzy set theory can be useful in modeling and solving flow shop scheduling problems with uncertain processing times and illustrates a method for solving job sequencing problem which the opinions of experts disagree in each processing time. In this study, FCDS (Fuzzified Campbell-Dudek-Smith) algorithm and FNEH (Fuzzified Nawaz-Enscope-Ham) algorithm are proposed to improve the fuzzified Branch & Bound algorithm that requires long run-time and computational complexities to find the optimal sequence. These proposed algorithms are also designed to treat opinions of experts. In this paper, Fuzzy processing times are expressed as triangular fuzzy numbers and comparison method use Lee-Li method and ranking method based on the dominance property. On the basis of the proposed method, an example is presented.

  • PDF

An improved version of Minty's algorithm to solve TSP with penalty function

  • Moon, Geeju;Oh, Hyun-Seung;Yang, Jung-Mun;Kim, Jung-Ja
    • Korean Management Science Review
    • /
    • v.13 no.3
    • /
    • pp.187-198
    • /
    • 1996
  • The traveling salesman problem has been studied for many years since the model can be used for various applications such as vehicle routing, job sequencing, clustering a data array, and so on. In this paper one of the typical exact algorithms for TSP, Minty's, will be modified to improve the performance of the algorithm on the applications without losing simplicity. The Little's algorithm gives good results, however, the simple and plain Minty's algorithm for solving shortest-route problems has the most intuitive appeal. The suggested Minty's modification is based on the creation of penalty-values on the matrix of a TSP. Computer experiments are made to verify the effectiveness of the modification.

  • PDF

Scheduling of Printing Process in which Ink Color Changes Exist (잉크 색상 변화가 존재하는 인쇄 공정의 스케줄링)

  • Moon, Jae Kyeong;Uhm, Hyun Seop;Tae, Hyun Chul
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.44 no.4
    • /
    • pp.32-42
    • /
    • 2021
  • The printing process can have to print various colors with a limited capacity of printing facility such as ink containers that are needed cleaning to change color. In each container, cleaning time exists to assign corresponding inks, and it is considered as the setup cost required to reduce the increasing productivity. The existing manual method, which is based on the worker's experience or intuition, is difficult to respond to the diversification of color requirements, mathematical modeling and algorithms are suggested for efficient scheduling. In this study, we propose a new type of scheduling problem for the printing process. First, we suggest a mathematical model that optimizes the color assignment and scheduling. Although the suggested model guarantees global optimality, it needs a lot of computational time to solve. Thus, we decompose the original problem into sequencing orders and allocating ink problems. An approximate function is used to compute the job scheduling, and local search heuristic based on 2-opt algorithm is suggested for reducing computational time. In order to verify the effectiveness of our method, we compared the algorithms' performance. The results show that the suggested decomposition structure can find acceptable solutions within a reasonable time. Also, we present schematized results for field application.