58,326 research outputs found
AIS-SFHM APPROACH FOR OPTIMIZATION OF MULTI OBJECTIVE JOB SHOP PROBLEMS
The n-job, m-machine Job shop scheduling (JSP) problem is one of the general production scheduling problems. The JSP problem is a scheduling problem, where a set of ‘n’ jobs must be processed or assembled on a set of ‘m’ dedicated machines. Each job consists of a specific set of operations, which have to be processed according to a given technical precedence order. Job shop scheduling problem is a NP-hard combinatorial optimization problem.  In this paper, optimization of three practical performance measures mean job flow time, mean job tardiness and makespan are considered. The hybrid approach of Sheep Flocks Heredity Model Algorithm (SFHM) is used for finding optimal makespan, mean flow time, mean tardiness. The hybrid SFHM approach is tested with multi objective job shop scheduling problems. Initial sequences are generated with Artificial Immune System (AIS) algorithm and results are refined using SFHM algorithm. The results show that the hybrid SFHM algorithm is an efficient and effective algorithm that gives better results than SFHM Algorithm, Genetic Algorithm (GA). The proposed hybrid SFHM algorithm is a good problem-solving technique for job shop scheduling problem with multi criteria
A MILP model for an extended version of the Flexible Job Shop Problem
A MILP model for an extended version of the Flexible Job Shop Scheduling
problem is proposed. The extension allows the precedences between operations of
a job to be given by an arbitrary directed acyclic graph rather than a linear
order. The goal is the minimization of the makespan. Theoretical and practical
advantages of the proposed model are discussed. Numerical experiments show the
performance of a commercial exact solver when applied to the proposed model.
The new model is also compared with a simple extension of the model described
by \"Ozg\"uven, \"Ozbakir, and Yavuz (Mathematical models for job-shop
scheduling problems with routing and process plan flexibility, Applied
Mathematical Modelling, 34:1539--1548, 2010), using instances from the
literature and instances inspired by real data from the printing industry.Comment: 15 pages, 2 figures, 4 tables. Optimization Letters, 201
Job shop scheduling with makespan objective: A heuristic approach
Job shop has been considered as one of the most challenging scheduling problems and there are literally tremendous efforts on reducing the complexity of solution procedure for solving job shop problem. This paper presents a heuristic method to minimize makespan for different jobs in a job shop scheduling. The proposed model is based on a constructive procedure to obtain good quality schedules, very quickly. The performance of the proposed model of this paper is examined on standard benchmarks from the literature in order to evaluate its performance. Computational results show that, despite its simplicity, the proposed heuristic is computationally efficient and practical approach for the problem
A new adaptive neural network and heuristics hybrid approach for job-shop scheduling
Copyright @ 2001 Elsevier Science LtdA new adaptive neural network and heuristics hybrid approach for job-shop scheduling is presented. The neural network has the property of adapting its connection weights and biases of neural units while solving the feasible solution. Two heuristics are presented, which can be combined with the neural network. One heuristic is used to accelerate the solving process of the neural network and guarantee its convergence, the other heuristic is used to obtain non-delay schedules from the feasible solutions gained by the neural network. Computer simulations have shown that the proposed hybrid approach is of high speed and efficiency. The strategy for solving practical job-shop scheduling problems is provided.This work is supported by the National Nature Science Foundation (No. 69684005)
and National High -Tech Program of P. R. China (No. 863-511-9609-003)
An Effective Multi-Population Based Hybrid Genetic Algorithm for Job Shop Scheduling Problem
The job shop scheduling problem is a well known practical planning problem in the manufacturing sector. We have considered the JSSP with an objective of minimizing makespan. In this paper, a multi-population based hybrid genetic algorithm is developed for solving the JSSP. The population is divided in several groups at first and the hybrid algorithm is applied to the disjoint groups. Then the migration operator is used. The proposed approach, MP-HGA, have been compared with other algorithms for job-shop scheduling and evaluated with satisfactory results on a set of JSSPs derived from classical job-shop scheduling benchmarks. We have solved 15 benchmark problems and compared results obtained with a number of algorithms established in the literature. The experimental results show that MP-HGA could gain the best known makespan in 13 out of 15 problems
An Effective Multi-Population Based Hybrid Genetic Algorithm for Job Shop Scheduling Problem
The job shop scheduling problem is a well known practical planning problem in the manufacturing sector. We have considered the JSSP with an objective of minimizing makespan. In this paper, a multi-population based hybrid genetic algorithm is developed for solving the JSSP. The population is divided in several groups at first and the hybrid algorithm is applied to the disjoint groups. Then the migration operator is used. The proposed approach, MP-HGA, have been compared with other algorithms for job-shop scheduling and evaluated with satisfactory results on a set of JSSPs derived from classical job-shop scheduling benchmarks. We have solved 15 benchmark problems and compared results obtained with a number of algorithms established in the literature. The experimental results show that MP-HGA could gain the best known makespan in 13 out of 15 problems
Development of Prototype Scheduling and Sequencing Software for Job Shop Manufacturing in Sheet Metal Fabrication
A software program has been developed to ease the process of scheduling and
sequencing number of jobs to certain number of machines for job shop
manufacturing in sheet metal fabrication. The program is designed based on the
present operation at Technology Park Malaysia (TPM) - Production Engineering
using available priority dispatching rules and multiple performance measures.
For n by m job shop scheduling problems, where n is the number of jobs and m is
the number machines, there are (n!)m possible schedules. In a typical job shop,
hundreds of scheduling decisions must be made daily. Scheduling process, which is
to organise, maintain, update and reschedule the job, is very tedious work and time
consuming. For five jobs passing through one machine, there are 120 time charts just
to show all possible sequence patterns. To plot the charts manually is not. a practical
solution and ridiculous. Identifying the performance measures to be used in selecting the schedule is important. The schedule should reflect managerially acceptable
performance measures. A logical strategy is thus to pursue methods that can
consistently generate good schedules with quantifiable quality in a computationally
efficient manner
Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production
The problem of efficiently scheduling production jobs on several machines is an important consideration when attempting to make effective use of a multimachines system such as a flexible job shop scheduling production system (FJSP). In most of its practical formulations, the FJSP is known to be NP-hard [8][9], so exact solution methods are unfeasible for most problem instances and heuristic approaches must therefore be employed to find good solutions with reasonable search time. In this paper, two closely related approaches to the resolution of the flexible job shop scheduling production system are described. These approaches combine the Ant system optimisation meta-heuristic (AS) with local search methods, including tabu search. The efficiency of the developed method is compared with others
- …