Scheduling of Discrete Manufacturing Process for Energy Saving

2014 ◽  
Vol 556-562 ◽  
pp. 4248-4254 ◽  
Author(s):  
Long Tuo ◽  
Lu Dai ◽  
Xiong Chen
Keyword(s):  
Manufacturing Process ◽  
Ant Colony Algorithm ◽  
Flow Shop ◽  
Machining Process ◽  
Flow Shop Scheduling ◽  
Intelligent Algorithm ◽  
Total Energy Consumption ◽  
Scheduling Model ◽  
Discrete Manufacturing ◽  
Np Hard Problem

Rotor machining is a traditional discrete manufacturing process, among which large amount of non-essential energy is being wasted. The machining process belongs to pipeline production, so a flow-shop scheduling model is built to optimize it. But when there are over three machines, this will be an NP-hard problem. We introduce an improved ant-colony algorithm to find the best solution and then use the real machining data to test it. The total energy consumption is reduced by over 10% and this shows the model and intelligent algorithm work well.

scholarly journals Inventory Based Bi-Objective Flow Shop Scheduling Model and Its Hybrid Genetic Algorithm

2013 ◽  
Vol 2013 ◽  
pp. 1-7 ◽  
Author(s):  
Ren Qing-dao-er-ji ◽  
Yuping Wang
Keyword(s):  
Genetic Algorithm ◽  
Local Search ◽  
Flow Shop ◽  
Hybrid Genetic Algorithm ◽  
Flow Shop Scheduling ◽  
Benchmark Problems ◽  
Shop Scheduling ◽  
Scheduling Model ◽  
Proposed Model ◽  
Np Hard Problem

Flow shop scheduling problem is a typical NP-hard problem, and the researchers have established many different multi-objective models for this problem, but none of these models have taken the inventory capacity into account. In this paper, an inventory based bi-objective flow shop scheduling model was proposed, in which both the total completion time and the inventory capacity were as objectives to be optimized simultaneously. To solve the proposed model more effectively, we used a tailor-made crossover operator, and mutation operator, and designed a new local search operator, which can improve the local search ability of GA greatly. Based on all these, a hybrid genetic algorithm was proposed. The computer simulations were made on a set of benchmark problems, and the results indicated the effectiveness of the proposed algorithm.

Research on a Main-Branch Hybrid Flow Shop Scheduling Problem in Production Manufacturing System

2012 ◽  
Vol 252 ◽  
pp. 354-359
Author(s):  
Xin Min Zhang ◽  
Meng Yue Zhang
Keyword(s):  
Manufacturing System ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Hybrid Flow Shop ◽  
Scheduling Problem ◽  
Quantum Genetic Algorithm ◽  
Shop Scheduling ◽  
Scheduling Model ◽  
Hybrid Flow Shop Scheduling ◽  
Two Stages

A main-branch hybrid Flow shop scheduling problem in production manufacturing system is studied. Under the premise of JIT, targeting of smallest cost, a Flow-Shop production line scheduling model is built in cycle time of buffer. Two stages Quantum Genetic Algorithm (QGA) is proposed. By the results of numerical example, the effective and advantageous of QGA was shown.

An Optimization Approach for Surgery Scheduling under Multi-Resource Constraints

2012 ◽  
Vol 201-202 ◽  
pp. 943-946
Author(s):  
Jiao Yin ◽  
Wei Xiang ◽  
Sai Feng Chen
Keyword(s):  
Resource Selection ◽  
Ant Colony Algorithm ◽  
Resource Constraints ◽  
Flow Shop ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Optimization Approach ◽  
Surgery Scheduling ◽  
Shop Scheduling ◽  
Flexible Flow Shop Scheduling

Surgery scheduling under upstream and downstream resource constraints was described as a three-stage multi-resource constrained flexible flow-shop scheduling problem in this study and an optimization approach based on ant colony algorithm was proposed for obtaining an optimal surgery schedule with respect to minimizing the makespan. A resource selection rule and strategy of overtime judging and adjusting was designed to allocate the resources reasonably and to make the scheduling results closer to reality. Compared to actual scheduling, the computerized result shows that the improved ant colony algorithm proposed in this paper achieved good results in shortening total time and allocating resources for surgery scheduling.

USING ANT COLONY OPTIMIZATION TO MINIMIZE THE FUZZY MAKESPAN AND TOTAL WEIGHTED FUZZY COMPLETION TIME IN FLOW SHOP SCHEDULING PROBLEMS

2009 ◽  
Vol 17 (04) ◽  
pp. 559-584 ◽  
Author(s):  
PENG-JEN LAI ◽  
HSIEN-CHUNG WU
Keyword(s):  
Completion Time ◽  
Ant Colony Algorithm ◽  
Fuzzy Numbers ◽  
Flow Shop ◽  
Computational Procedure ◽  
Ant Colony ◽  
Flow Shop Scheduling ◽  
Scheduling Problems ◽  
Shop Scheduling ◽  
Processing Times

The flow shop scheduling problems with fuzzy processing times are investigated in this paper. For some special kinds of fuzzy numbers, the analytic formulas of the fuzzy compltion time can be obtained. For the general bell-shaped fuzzy numbers, we present a computational procedure to obtain the approximated membership function of the fuzzy completion time. We define a defuzzification function to rank the fuzzy numbers. Under this ranking concept among fuzzy numbers, we plan to minimize the fuzzy makespan and total weighted fuzzy completion time. Because the ant colony algorithm has been successfully used to solve the scheduling problems with real-valued processing times, we shall also apply the ant colony algorithm to search for the best schedules when the processing times are assumed as fuzzy numbers. Numerical examples are also provided and solved by using the commercial software MATLAB.

scholarly journals Minimization of Utilization Time for Specially Structured n × 3 Scheduling Model with Jobs in a String of Disjoint Job Blocks

2019 ◽  
Vol 8 (12) ◽  
pp. 3554-3558
Keyword(s):  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Scheduling Problem ◽  
Numerical Illustration ◽  
Optimal Sequence ◽  
Shop Scheduling ◽  
Elapsed Time ◽  
Processing Times ◽  
Scheduling Model ◽  
Utilization Time

The present paper investigates n×3 specially structured flow shop scheduling model with processing of jobs on given machines in a string of disjoint job blocks and with probabilities associated to the processing times of jobs. The objective is to minimize utilization time of second and third machine and also minimize the total elapsed time for processing the jobs for n×3 specially structured flow shop scheduling problem. The algorithm developed in this paper is quite straightforward and easy to understand and also present an essential way out to the decision maker for attaining an optimal sequence of jobs. The algorithm developed in this paper is validated by a numerical illustration.

scholarly journals Solving Constrained Flow-Shop Scheduling Problem through Multistage Fuzzy Binding Approach with Fuzzy Due Dates

2021 ◽  
Vol 2021 ◽  
pp. 1-8
Author(s):  
Hamiden Abd El-Wahed Khalifa ◽  
Sultan S. Alodhaibi ◽  
Pavan Kumar
Keyword(s):  
Fuzzy Numbers ◽  
Flow Shop ◽  
Flow Shop Scheduling ◽  
Due Dates ◽  
Optimal Sequence ◽  
Elapsed Time ◽  
Processing Times ◽  
Scheduling Model ◽  
Interval Approximation ◽  
Real World Problems

This paper deals with constrained multistage machines flow-shop (FS) scheduling model in which processing times, job weights, and break-down machine time are characterized by fuzzy numbers that are piecewise as well as quadratic in nature. Avoiding to convert the model into its crisp, the closed interval approximation for the piecewise quadratic fuzzy numbers is incorporated. The suggested method leads a noncrossing optimal sequence to the considered problem and minimizes the total elapsed time under fuzziness. The proposed approach helps the decision maker to search for applicable solution related to real-world problems and minimizes the total fuzzy elapsed time. A numerical example is provided for the illustration of the suggested methodology.

Sign in / Sign up

Export Citation Format

Share Document