• Title/Summary/Keyword: job sequencing problem

Search Result 29, Processing Time 0.029 seconds

A Job Sequencing Model for Cold Coil Production Processes (냉연 공정에서의 작업단위 편성)

  • Jun, C.H.;Lee, S.M.;Park, C.S.;Kang, S.Y.;Chang, S.Y.;Choi, I.J.;Kang, J.T.
    • IE interfaces
    • /
    • v.6 no.2
    • /
    • pp.117-131
    • /
    • 1993
  • A job sequencing model is developed and its computer system is tested for processing cold-rolled coils in Tandem Cold Mills(TCM) at the Pohang Iron and Steel Company. Given coils waiting to be processed, this system generates a sequence of jobs satisfying operational constraints for the TCM process. We formulate the problem as a constraint satisfaction problem and employ the backtracking technique combined with looking ahead features in order to generate a feasible solution within a reasonable time. Our system is implemented in C language on 80486-based IBM PC. Some tests based on the real data show that our system is adequate with respect to search time and that it consistantly generates a good feasible solution.

  • PDF

Modified Genetic Operators for the TSP

  • Soak Sang Moon;Yang Yeon Mo;Lee Hong Girl;Ahn Byung Ha
    • Journal of Navigation and Port Research
    • /
    • v.29 no.2
    • /
    • pp.141-146
    • /
    • 2005
  • For a long time, genetic algorithms have been recognized as a new method to solve difficult and complex problems and the performance of genetic algorithms depends on genetic operators, especially crossover operator. Various problems like the traveling salesman problem, the transportation problem or the job shop problem, in logistics engineering can be modeled as a sequencing problem This paper proposes modified genetic crossover operators to be used at various sequencing problems and uses the traveling salesman problem to be applied to a real world problem like the delivery problem and the vehicle routing problem as a benchmark problem Because the proposed operators use parental information as well as network information, they could show better efficiency in performance and computation time than conventional operators.

A Heuristic for Efficient Scheduling of Ship Engine Assembly Shop with Space Limit (공간제약을 갖는 선박용 엔진 조립공장의 효율적인 일정계획을 위한 발견적 기법)

  • Lee, Dong-Hyun;Lee, Kyung-Keun;Kim, Jae-Gyun;Park, Chang-Kwon;Jang, Gil-Sang
    • IE interfaces
    • /
    • v.12 no.4
    • /
    • pp.617-624
    • /
    • 1999
  • In order to maximize an availability of machine and utilization of space, the parallel machines scheduling problem with space limit is frequently discussed in the industrial field. In this paper, we consider a scheduling problem for assembly machine in ship engine assembly shop. This paper considers the parallel machine scheduling problem in which n jobs having different release times, due dates and space limits are to be scheduled on m parallel machines. The objective function is to minimize the sum of earliness and tardiness. To solve this problem, a heuristic is developed. The proposed heuristic is divided into three modules hierarchically: job selection, machine selection and job sequencing, solution improvement. To illustrate its effectiveness, a proposed heuristic is evaluated with a large number of randomly generated test problems based on the field situation. Through the computational experiment, we determine the job selection rule that is suitable to the problem situation considered in this paper and show the effectiveness of our heuristic.

  • PDF

A Study on Scheduling Considering Delivery and Production Efficiency in the JIT Systems (적시생산시스템에서 납기와 생산효율성을 고려한 Scheduling)

  • Kim, Jung
    • Journal of Industrial Convergence
    • /
    • v.5 no.2
    • /
    • pp.21-32
    • /
    • 2007
  • This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

  • PDF

A Sequencing Considering Delivery and Machine Idle time in Production System with Buffer Constrained (버퍼용량제한이 있는 생산시스템에서 납기와 기계유휴시간을 고려한 Sequencing)

  • Kim, Jung
    • Journal of Industrial Convergence
    • /
    • v.3 no.1
    • /
    • pp.19-31
    • /
    • 2005
  • This paper deals with the sequencing problem in the operation of the manufacturing systems with the constraint of buffer capacity. Some of studies for this theme have been progressed for several years. And then most of them considered only one objective, such as maximum lateness, machine utilization, makespan, mean flowtime and so on. This study deal with two objectives of the delivery for customers and the idle time of machines for producers. For the decision of sequence, the utility function is used. The developed heuristic algorithm presents a good solution. Through a numerical example, the procedures of the job sequencing is explained.

  • PDF

Common Due-Data Determination and Sequencing on Parallel Processors (병렬 기계에 있어서 공통 납기 결정과 일정 계획)

  • 오명진;이상도
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.14 no.23
    • /
    • pp.27-36
    • /
    • 1991
  • This paper considers scheduling a set of n-jobs on m-paraller identical processors in which all jobs have the common due date. The objective of the problem is to minimize the weighted mean absolute deviation of job completion times about such common due dates under the assumption that each job has a different weight. and to determine the optimal value of a common due date. We propose four heuristic solution methods based on several dominance conditions, and its solution procedure is illustrated with numerical examples. The Performance comparison is made among four heuristic scheduling procedures.

  • PDF

A study on sequencing of Mixed Model Assembly Line for increasing productivity (혼합모델조립라인의 생산성 제고를 위한 작업순서 결정)

  • 최종열
    • Korean Management Science Review
    • /
    • v.13 no.2
    • /
    • pp.25-48
    • /
    • 1996
  • Mixed Model Assembly Lines (MMALs) are increasingly used to produce differentiated products on a single assembly line without work-in-process storage, Usually, a typical MMAL consists of a number of (1) stations doing exactly the same operation on every job, (2) stations involving operations with different choices, and (3) stations offering operations that are not performed on every job, or that are performed on every job but with many options. For stations of the first type there is no sequencing problem at all. However, for the second type a set-up cost is incurred each time the operation switches from one choice to another. At the third type of stations, different models, requring different amounts and choices of assembly work, creates an uneven flow of work along the line and variations in the work load at these stations. When a subsequence of jobs requires more work load than the station can handle, it is necessary to help the operations at the station or to complete the work elsewhere. Therefore, a schedule which minimize the sum of set-up cost and utility work cost is desired. So this study has developed Fixed Random Ordering Rule (FROR), Fixed Ascending Ordering Rule (FAOR), Fixed Descending Ordering Rule, and Extended NHR (ENHR). ENHR is to choose optimal color ordering of each batch with NHR, and to decide job sequence of the batch with it, too. As the result of experiments, ENHR was the best heuristic algorithm. NHR is a new heuristic rule in which only the minimum addition of violations from both partial sequence and unassigned sequence at every branch could be considered. And this is a heuristic sequencing rule for the third type of stations at MMAL. This study developed one more heuristic algorithm to test the performance of NHR, which is named as Practical Heuristic Rule (PHR).

  • PDF

A Study on the Heuristic Solution for n/m Job-Shop Scheduling Problems of Slack Degree (Slack Degree에 의한 n/m Job-Shop 스케줄링 문제의 발견적 해법에 관한 연구)

  • 김제홍;조남호
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.19 no.39
    • /
    • pp.275-284
    • /
    • 1996
  • 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.

  • 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.

Single Machine Sequencing With Random Processing Times and Random Deferral Costs

  • Park, Sung H.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.4 no.1
    • /
    • pp.69-77
    • /
    • 1979
  • A single machine stochastic scheduling problem is considered. Associated with each job is its random processing time and random deferral cost. The criterion is to order the jobs so as to minimize the sum of the deferral costs. The expected sum of the deferral costs is theroretically derived under the stochastic situation for each of several scheduling decision rules which are well known for the deterministic environment. It is also shown that certain stochastic problems can be reduced to equivalent deterministic problems. Two examples are illustrated to show the expected total deferral costs.

  • PDF