A New Combined Approach for Optimizing Makespan in Job Shop Scheduling Problem

International Journal of Innovative Research in Science, Engineering and Technology
doi 10.15680/ijirset.2015.0412024
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Ess & Ess Research Publications

Related search

A Memetic Algorithm for Minimizing the Makespan in the Job Shop Scheduling Problem

Revista Facultad de Ingeniería
2017English

Flow Shop Scheduling Problem With Four Machines N-Job for Minimizing Makespan

International Journal of Engineering Research and
2017English

Hybrid Evolutionary Approach for Multi-Objective Job-Shop Scheduling Problem

Malaysian Journal of Computer Science
Computer Science
2007English

Discrepancy Search for the Flexible Job Shop Scheduling Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2010English

Convergence Analysis of the New Hybrid Genetic Algorithm for Job Shop Scheduling Problem

Journal of Computer Science and Cybernetics
2013English

Optimization of Scheduling in Job Shop Through Minimization of Makespan Using Cpso and Ga

International journal of Latest Trends in Engineering & Technology
2016English

Multiple Exchanges of Job Orders for No-Buffer Job Shop Scheduling Problem

Journal of Advanced Mechanical Design, Systems and Manufacturing
IndustrialMechanical EngineeringManufacturing Engineering
2012English

A Hybrid Evolutionary Algorithm for Solving Flexible Job Shop Scheduling Problem

IJCI. International Journal of Computers and Information
2009English

An Intelligent Method for Solving Flexible Job Shop Scheduling Problem

2017English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy