• Industrial Engineering and Management Systems
• /
• 제4권1호
• /
• pp.1-22
• /
• 2005

This paper presents new scheduling heuristics, namely Mean Progressive Weighted Tardiness Estimator (MPWT) Heuristic Method and modified priority rules with sequence-dependent setup times consideration. These are designed to solve job shop scheduling problems with new performance measures - progressive weighted tardiness penalties. More realistic constraints, which are inter-machine overlapping sequence-dependent setup times, are considered. In real production environments, inter-machine overlapping sequence-dependent setups are significant. Therefore, modified scheduling generation algorithms of active and nondelay schedules for job shop problems with inter-machine overlapping sequence-dependent setup times are proposed in this paper. In addition, new customer-based measures of performance, which are total earliness and progressive weighted tardiness, and total progressive weighted tardiness, are proposed. The objective of the first experiment is to compare the proposed priority rules with the consideration of sequence-dependent setup times and the standard priority rules without setup times consideration. The results indicate that the proposed priority rules with setup times consideration are superior to the standard priority rules without the consideration of setup times. From the second experiment and the third experiment to compare the proposed MPWT heuristic approach with the efficient priority rules with setup times consideration, the MPWT heuristic method is significantly superior to the Batched Apparent Tardiness Cost with Sequence-dependent Setups (BATCS) rule, and other priority rules based on total earliness and progressive weighted tardiness, and total earliness and tardiness.

• 한국경영과학회지
• /
• 제38권2호
• /
• pp.141-157
• /
• 2013

In this paper, we consider the minimization of the total weighted earliness-tardiness penalty of jobs, regarding the partial precedences between jobs. We present an optimal scheduling algorithm in O(n(n+m log m)) where n is the number of jobs and m is the number of partial precedences. In the algorithm, the optimal schedule is constructed iteratively by considering each group of contiguous jobs as a block that is represented by a tree.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1998년도 추계학술대회 논문집
• /
• pp.216-219
• /
• 1998

This study proposes JPT(Job-Pair Tardiness) that choose operation to be expected to generate better schedule consequence in comparing schedulable operation sets in pair to minimize total tardiness evaluation function in performing scheduling. In result of comparison with existing assignment rules. JPT generates better solution than most other rules in all kinds of problems. So it is anticipated that this is used for initial solution of heuristic and is used for finding more improved solution.

• 산업기술연구
• /
• 제28권A호
• /
• pp.51-61
• /
• 2008

In these days, domestic manufacturers are faced with managerial difficulties such as the increasing competition in their industry and the increasing power of customers. In this situation, they have to satisfy their customers with high quality of their products and meeting due date of their orders. Production of the order within due date is an important factor for improving enterprise competitiveness. The causes of occurrence of tardiness may be wrong product scheduling, unexpected events in field and so on, a way to minimize tardiness is use of alternative machines, overwork, outsourcing and etc.. In this study, we deal with a scheduling problem that can minimize tardiness using alternative machines. This paper provides a mathematical program and a heuristic method for job shop scheduling for minimizing tardiness with alternative machines. And a proposed heuristic method is verified comparing with optimal solution obtained by ILOG CPLEX.

• 한국경영과학회지
• /
• 제21권3호
• /
• pp.75-88
• /
• 1996

This paper presents an efficient heuristic technique for minimizing the objectives related to tardiness such as total tardiness, maximum tardiness and root mean of tardiness in the job shop scheduling. The heuristic technique iteratively improves an active schedule through exploring the schedule's neighborrhood, using operation move methods. The move operatio is defined on an active chain of tardy jobs in the active schedule. To find the move operations which have a high probability of reducing tardiness, we develop move methods by exploiting the properties of active chains. Our technique is compared with the two existing heuristic techniques, that is, MEHA(Modified Exchange Heuristic Algorithm) and GSP(Global Scheduling Procedure) under the various environmental with the three levels of due date tightness and several sized problems. The experimental results show that the proposed technique outperforms the two exissting techiques in terms of solution quality and computation time.

• 대한산업공학회지
• /
• 제18권1호
• /
• pp.91-104
• /
• 1992

Flowshop scheduling problem is known to be NP-complete. Since the optimization apporach like branch-and-bound is limited by exponentially growing computation time, many heuristic methods have been developed. Total tardiness is one of the criteria that the researchers have recently considered in flowshop scheduling. There, however, are few literatures which studied the general (m machine)-flowshop scheduling under the total tardiness criterion. In this paper, a heuristic scheduling method to minimize total tardiness at the (m machine, n job)-flowshop is presented. A heuristic value function is proposed to be used as a dispatching criterion in initial schedule generation. And the schedule improving procedure, by pairwise interchange of tardy job with the job right ahead of it, is introduced. Illustrative examles and simulated results are presented.

• 산업경영시스템학회지
• /
• 제42권1호
• /
• pp.33-40
• /
• 2019

This study focuses on a job-shop scheduling problem with the objective of minimizing total tardiness for the job orders that have different due dates and different process flows. We suggest the dispatching rule based scheduling algorithm to generate fast and efficient schedule. First, we show the delay schedule can be optimal for total tardiness measure in some cases. Based on this observation, we expand search space for selecting the job operation to explore the delay schedules. That means, not only all job operations waiting for process but also job operations not arrived at the machine yet are considered to be scheduled when a machine is available and it is need decision for the next operation to be processed. Assuming each job operation is assigned to the available machine, the expected total tardiness is estimated, and the job operation with the minimum expected total tardiness is selected to be processed in the machine. If this job is being processed in the other machine, then machine should wait until the job arrives at the machine. Simulation experiments are carried out to test the suggested algorithm and compare with the results of other well-known dispatching rules such as EDD, ATC and COVERT, etc. Results show that the proposed algorithm, MET, works better in terms of total tardiness of orders than existing rules without increasing the number of tardy jobs.

• 한국경영과학회지
• /
• 제33권2호
• /
• pp.87-101
• /
• 2008

This paper considers an order scheduling model to minimize the total weighted tardiness of orders. Each order requires different types of products. Each type of product is manufactured on its dedicated machine specified in advance. The completion time of each order is represented by the time when all the products belonging to the order are completed. The objective of this paper is to find the optimal production schedule minimizing the total weighted tardiness of a finite number of orders. In the problem analysis, we first derive a powerful solution property to determine the sequence of two consecutive orders. Moreover, two lower bounds of objective are derived and tested along with the derived property within a branch-and-bound scheme. Two efficient heuristic algorithms are also developed. The overall performances of the proposed property, branch-and-bound and heuristic algorithms are evaluated through various numerical experiments.

• 산업공학
• /
• 제10권2호
• /
• pp.57-67
• /
• 1997

This paper is a report of a simulation study that investigates a dynamic approach to scheduling jobs in a conventional shop floor, especially in an assemoly-type welding process. We consider both JIT arrival and JIT delivery. Various dispatching rules are tested for the following performance measures; mean flow time, rate of tardy jobs, mean tardiness, sum of mean tardiness and mean earliness. The results indicate that SPT rule is the best for the mean flow time. MSLACK that we suggest in this paper, is the best for the mean tardiness and the sum of mean tardiness and mean earliness. However, it is not clear that which rule is the best for the rate of tardy jobs.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.295-298
• /
• 1996

We consider a nonpreemptive single-machine scheduling problem to minimize the mean squared deviation(MSD) of job completion times about a common due date d with a maximum tardiness constraint, i.e., maximum tardiness is less than or equal to the given allowable amount, .DELTA.(MSD/T$_{max}$ problem). We classify the .DELTA.-unconstrained cases in the MSD/T$_{max}$ problem. We provide bounds to discern each case for the problem. It is also shown that the .DELTA.-unconstrained MSD/T$_{max}$ problem is equivalent to the unconstrained MSD problem and the tightly .DELTA.-constrained MSD/T$_{max}$ problem with n jobs and a maximum allowable tardiness .DELTA. can be converted into the constrained MSD problem with a common due date .DELTA. and n-1 jobs. Finally, the solution procedure for MSD/T$_{max}$ problem is provided. provided.