共查询到20条相似文献,搜索用时 31 毫秒
1.
In this article, scheduling and rescheduling problems with increasing processing time and new job insertion are studied for reprocessing problems in the remanufacturing process. To handle the unpredictability of reprocessing time, an experience-based strategy is used. Rescheduling strategies are applied for considering the effect of increasing reprocessing time and the new subassembly insertion. To optimize the scheduling and rescheduling objective, a discrete harmony search (DHS) algorithm is proposed. To speed up the convergence rate, a local search method is designed. The DHS is applied to two real-life cases for minimizing the maximum completion time and the mean of earliness and tardiness (E/T). These two objectives are also considered together as a bi-objective problem. Computational optimization results and comparisons show that the proposed DHS is able to solve the scheduling and rescheduling problems effectively and productively. Using the proposed approach, satisfactory optimization results can be achieved for scheduling and rescheduling on a real-life shop floor. 相似文献
2.
I. A. Kattan 《国际生产研究杂志》2013,51(5):1239-1257
The objective of this paper is to minimize machine duplication by increasing its utilization, minimize intercell moves, simplify the scheduling problem and increase the flexibility of the manufacturing system. An integrated approach of design and scheduling alternative hybrid multi-cell flexible manufacturing systems (MCFMSs) in four steps will be presented in this paper. The first step is the implementation of branch and bound techniques which provide tools to design group technology (GT) cells. The second step is balancing the inter-cell workload of GT cells which leads to a hybrid MCFMS with better utilization of the machines. The problem of the exception machines and their utilization and workload balance will be solved within the MCFMScentre. Thus the performance of GT cells can be improved by transferring workloads from a congested (bottleneck) machine in one cell to an alternative one, a less congested (exception) machine in another cell within a group of GT cells forming a MCFMS centre. The third step is the group scheduling; a proposed heuristic method will be used for the scheduling of a family of parts with the objective of minimizing the maximum completion time of each part. The problem of scheduling under MCFMS can be reduced by considering the scheduling of each family of parts. Finally, the flexibility of the system will be enhanced by selecting appropriate machine tools and flexible material handling equipments. This approach is both effective and efficient-it has generated a hybrid MCFMS centre which includes several alternatives, for some benchmark problems in much shorter time than algorithms previously reported in the literature. In addition, the method is conceptually simple and easy to implement. 相似文献
3.
为了识别出适用于具有公有资源与私有资源约束的多项目调度问题的优先规则,基于标准测试集MPSPLIB进行计算实验,并基于相对偏差指标对比分析25种经典优先规则在最小化最大完工时间、最小化总拖期、最小化加权总拖期3种决策目标下的表现。实验结果表明,优先规则的表现与决策目标、单项目任务数、并行项目数、资源利用系数等因素之间具有显著相关性。在最小化总拖期目标下,尽管大多数规则的表现与现有文献总体一致,但是MAXTWK和MINSLK规则的表现有着显著差异。所得实验结论对于工程实际多项目调度决策具有指导意义。 相似文献
4.
This paper addresses an operation scheduling problem with the objective of minimizing total tardiness in a flexible manufacturing system with setup time consideration. The addressed problem is first described as a 0?1 integer programming model, and is then solved optimally. Subsequently, a heuristic is proposed to solve the problem in an acceptable running time. The heuristic begins on a schedule generator called ESCH to obtain an initial solution; then two procedures are designed to improve the solution quality. One is a sequence-improving procedure (SIP) for determining a better performance schedule from a certain routing plan; the other is a routing-exchanging procedure (REP) for selecting a good routing plan. Both procedures are achieved by simulated annealing. Computational experiments show that the proposed simulated annealing based heuristic performs well with respect to solution accuracy and efficiency. 相似文献
5.
A two‐phase approach for single machine scheduling problems: Minimizing the total absolute deviation
Abstract This paper presents a heuristic for solving a single machine scheduling problem with the objective of minimizing the total absolute deviation. The job to be scheduled on the machine has a processing time, pi , and a preferred due date, di . The total absolute deviation is defined as the sum of the earliness or tardiness of each job on a schedule 5. This problem is proved to be NP‐complete by Garey et al. [8]. As a result, we developed a two‐phase procedure to provide a near‐optimal solution to this problem. The two‐phase procedure includes the following steps: First, a greedy heuristic is applied to the set of jobs, N, to generate a “good” initial sequence. According to this initial sequence, we run Garey's local optimization algorithm to provide an initial schedule. Then, a pairwise switching algorithm is adopted to further reduce the total deviation of the schedule. The effectiveness of the two‐phase procedure is empirically evaluated and has been found to indicate that the solutions obtained from this heuristic procedure are often better than other heuristic approaches. 相似文献
6.
Most studies on scheduling in dynamic job-shops assume that the holding cost of a job is given by the flowtime of the job and that the tardiness cost of a job is given by the tardiness of the job. In other words, unit holding and unit tardiness costs of a job are assumed. However, in reality, such an assumption need not hold, and it is quite possible that there are different costs for holding and tardiness for different jobs. In addition, most studies on job-shop scheduling assume that jobs are independent and that no assembly operations exist. The current study addresses the problem of scheduling in dynamic assembly job-shops (manufacturing multilevel jobs) with the consideration of different holding and tardiness costs for different jobs. An attempt is made to develop efficient dispatching rules by incorporating the relative costs of holding and tardiness of jobs in the form of scalar weights. The primary objective of scheduling considered here is the minimization of the total scheduling cost consisting of the sum of holding and tardiness costs. The performance of the scheduling rules in minimizing the individual components of total scheduling cost is also observed. The results of an extensive simulation study on the performance of different dispatching rules show that the proposed rules are effective in minimizing the means and maximums of the primary measure, and are quite robust with respect to different job structures and experimental settings. 相似文献
7.
The problem of scheduling in static flowshops is considered with the objective of minimizing mean or total tardiness of jobs. A heuristic algorithm based on the simulated annealing (SA) technique is developed. The salient features of the proposed SA algorithm are the development of two new perturbation schemes for use in the proposed SA algorithm and a new improvement scheme to improve the quality of the solutions. The proposed algorithm is evaluated by using the benchmark problems available in the literature. The performance of the proposed SA algorithm is found to be very good, and the proposed heuristic performs better than the existing heuristics. 相似文献
8.
This paper considers the single machine scheduling problem with independent family (group) setup times where jobs in each family are processed together. A sequence-independent setup is required to process a job from a different family. The objective is to minimize total tardiness. A mixed-integer linear programming model capable of solving small-sized problems is described. In view of the NP-hard nature of the problem, two-phase heuristics including simulated annealing algorithms are proposed to find optimal or near-optimal schedules. Empirical results show that the proposed heuristic algorithms are quite effective in minimizing total tardiness for a single machine group scheduling problem with family setup times. 相似文献
9.
The paper considers the problem of scheduling nindependent and simultaneously available jobs on a single machine, where the job processing times are compressible as a linear cost function. The objective is to find an optimal permutation of the jobs, an optimal due date and the optimal processing times which jointly minimize a cost function consisting of the earliness, tardiness, completion time and compressing costs. It shows that the problem can be solved as an assignment problem. 相似文献
10.
This paper addresses a two-stage assembly flowshop scheduling problem with the objective of minimising maximum tardiness where set-up times are considered as separate from processing times. The performance measure of maximum tardiness is important for some scheduling environments, and hence, it should be taken into account while making scheduling decisions for such environments. Given that the problem is strongly NP-hard, different algorithms have been proposed in the literature. The algorithm of Self-Adaptive Differential Evolution (SDE) performs as the best for the problem in the literature. We propose a new hybrid simulated annealing and insertion algorithm (SMI). The insertion step, in the SMI algorithm, strengthens the exploration step of the simulated annealing algorithm at the beginning and reinforces the exploitation step of the simulated annealing algorithm towards the end. Furthermore, we develop several dominance relations for the problem which are incorporated in the proposed SMI algorithm. We compare the performance of the proposed SMI algorithm with that of the best existing algorithm, SDE. The computational experiments indicate that the proposed SMI algorithm performs significantly better than the existing SDE algorithm. More specifically, under the same CPU time, the proposed SMI algorithm, on average, reduces the error of the best existing SDE algorithm over 90%, which indicates the superiority of the proposed SMI algorithm. 相似文献
11.
The twofold look-ahead search ((TLAS) was proposed as a general purpose search technique and applied to single-criterion job shop scheduling. In the present study, this method is applied to multi-criterion scheduling problems with some modification and illustrated by bi-criterion scheduling with mean tardiness and mean flowtime. Application circumstances are divided into two situations according to the scheduling objective and TLAS is tested for each situation. From the computational results, the proposed method is found to generate higher performance schedules in comparison with other methods. Its algorithmic features and applicability to other problems are also discussed based on several experimental results. 相似文献
12.
Some of the important characteristics of the semiconductor wafer fabrication factories are re-entrant process flows, a dynamic and uncertain environment, stringent production control requirements, etc. that pose a major challenge to the scheduling decisions in integrated circuit wafer fabrication process. Keeping in view the high capital investment and quick response to the market changes, it is essential for the integrated circuit fabrication process to exercise effective control on its production operations so that production resources can be employed in a flexible and efficient manner. The present research has focussed on the development of a generalized stochastic Petri net model that faithfully captures dynamic behaviours such as re-entrant processing, machine failures, loading and unloading, etc., pertaining to wafer fabrication. A simulated annealing-based scheduling strategy using mean cycle time and tardiness as performance measures was also developed to obtain an efficient and robust schedule for a known hard problem. Analysis of variance was applied to examine the interaction effects of various scheduling rules and to identify the main as well as the interaction effects of dispatching rules, dispatching rules and set-up rules, and set-up rules and batching rules. Paired t-tests were applied to assess the performance of rule combinations for lot and batch scheduling. The proposed simulated annealing-based solution methodology was tested on a well-known data set adopted from the literature and its performance reveals that simulated annealing-based scheduling rules work better than existing rules in terms of the two performance measures mean cycle time and tardiness. 相似文献
13.
14.
The flow shop problem as a typical manufacturing challenge has gained wide attention in academic fields. This article considers a bi-criteria no-wait flow shop scheduling problem (FSSP) in which weighted mean completion time and weighted mean tardiness are to be minimized simultaneously. Since a FSSP has been proved to be NP-hard in a strong sense, a new multi-objective scatter search (MOSS) is designed for finding the locally Pareto-optimal frontier of the problem. To prove the efficiency of the proposed algorithm, various test problems are solved and the reliability of the proposed algorithm, based on some comparison metrics, is compared with a distinguished multi-objective genetic algorithm (GA), i.e. SPEA-II. The computational results show that the proposed MOSS performs better than the above GA, especially for the large-sized problems. 相似文献
15.
This paper investigates a meta-heuristic solution approach to the early/tardy single machine scheduling problem with common due date and sequence-dependent setup times. The objective of this problem is to minimise the total amount of earliness and tardiness of jobs that are assigned to a single machine. The popularity of just-in-time (JIT) and lean manufacturing scheduling approaches makes the minimisation of earliness and tardiness important and relevant. In this research the early/tardy problem is solved by Meta-RaPS (meta-heuristic for randomised priority search). Meta-RaPS is an iterative meta-heuristic which is a generic, high level strategy used to modify greedy algorithms based on the insertion of a random element. In this case a greedy heuristic, the shortest adjusted processing time, is modified by Meta-RaPS and the good solutions are improved by a local search algorithm. A comparison with the existing ETP solution procedures using well-known test problems shows Meta-RaPS produces better solutions in terms of percent difference from optimal. The results provide high quality solutions in reasonable computation time, demonstrating the effectiveness of the simple and practical framework of Meta-RaPS. 相似文献
16.
This study focuses on a hybrid flowshop scheduling problem, in which there are serial stages, each with identical parallel machines. In the hybrid flowshop, each order is composed of multiple lots with the same due date, and each lot can be processed on any one of parallel machines at each stage. In addition, there are reentrant flows since lots of certain orders have to visit the stages twice. Heuristic algorithms are suggested for the scheduling problem with the objective of minimizing total tardiness of a given set of orders. In these algorithms, the list-scheduling method is employed, and lots are scheduled with priorities determined with a construction method. Computational experiments are performed on randomly generated test problems. Results show that the suggested algorithms perform better than well-known dispatching rules for various scheduling problems and an algorithm that is used in a real system. 相似文献
17.
This paper focuses on the problem of scheduling jobs on parallel machines considering a job-splitting property. In this problem, it is assumed that a job can be split into a discrete number of subjobs and they are processed on parallel machines independently. A two-phase heuristic algorithm is suggested for the problem with the objective of minimizing total tardiness. In the first phase, an initial sequence is constructed by an existing heuristic method for the parallel-machine scheduling problem. In the second phase, each job is split into subjobs considering possible results of the split, and then jobs and subjobs are rescheduled on the machines using a certain method. To evaluate performance of the suggested algorithm, computational experiments are performed on randomly generated test problems. Results of the experiments show that the suggested algorithm performs better than an existing one. 相似文献
18.
Single machine batch scheduling with sequential job processing 总被引:1,自引:0,他引:1
The problem of scheduling n jobs on a single machine in batches to minimize some regular cost functions is studied. Jobs within each batch are processed sequentially so that the processing time of a batch is equal to the sum of the processing times of the jobs contained in it. Jobs in the same batch are completed at the same time when the last job of the batch has finished its processing. A constant set-up time precedes the processing of each batch. The number of jobs in each batch is bounded by some value b. If b < n, then the problem is called bounded. Otherwise, it is unbounded. For both the bounded and unbounded problems, dynamic programming algorithms are presented for minimizing the maximum lateness, the number of late jobs, the total tardiness, the total weighted completion time, and the total weighted tardiness when all due dates are equal, which are polynomial if there is a fixed number of distinct due dates or processing times. More efficient algorithms are derived for some special cases of both the bounded and unbounded problems in which all due dates and/or processing times are equal. Several special cases of the bounded problem are shown to be NP-hard. Thus, a comprehensive classification of the computational complexities of the special cases is provided. 相似文献
19.
This paper addresses the problem of scheduling jobs in a permutation flowshop with the objective of minimizing the total tardiness of jobs. To tackle this problem, it is suggested that a procedure based on a greedy algorithm is employed that successively iterates over an increasing number of candidate solutions. The computational experiments carried out show this algorithm outperforms the best existing one for the problem under consideration. In addition, out some tests are carried out to analyse the efficiency of the adopted design. 相似文献
20.
Cheng-Hsiung Lee 《国际生产研究杂志》2018,56(6):2292-2308
This paper addresses a real-life production scheduling problem with identical parallel machines, originating from a plant producing Acrylonitrile-Butadiene-Styrene (ABS) plate products. In the considered practical scheduling problem, ABS plate has some specific specifications and each specification has several different levels. Because there is at least one different level of specification between two ABS plate products, it is necessary to make a set-up adjustment on each machine whenever a switch occurs from processing one ABS plate product to another product. As tardiness leads to extra penalty costs and opportunity losses, the objective of minimising total tardiness has become one of the most important tasks for the schedule manager in the plant. The problem can be classified as an identical parallel machine scheduling problem to minimise the total tardiness. A dispatching rule is proposed for this problem and evaluated by comparing it with the current scheduling method and several existing approaches. Moreover, an iterated greedy-based metaheuristic is developed to further improve the initial solution. The experimental results show that the proposed metaheuristic can perform better than an existing tabu search algorithm, and obtain the optimal solution for small-sized problems and significantly improve the initial solutions for large-sized problems. 相似文献