List of Journals    /    Call For Papers    /    Subscriptions    /    Login
 
 
 
 
 SEARCH
By Author By Title
 
 
ABOUT CSC
 About CSC Journals
 CSC Journals Objectives
 List of Journals
 CALL FOR PAPERS
 Call For Papers CFP
 Special Issue CFP
AUTHOR GUIDELINES
 Submission Guidelines
 Peer Review Process
 Helpful Hints For Getting Published
 Plagiarism Policies
 Abstracting & Indexing
 Open Access Policy
 Submit Manuscript
 FOR REVIEWERS
 Reviewer Guidelines
 FOR EDITORIAL
 Editor Guidelines
 Join Us As Editor
 Launch Special Issue
 Suggest New Journal
 CSC LIBRARY
 Browse CSC Library
 Open Access Policy
  SERVICES
 Conference Partnership Program (CPP)
 Abstracting & Indexing
 SUBSCRIPTIONS
 Subscriptions
 Discounted Packages
 Archival Subscriptions
 How to Subscribe
 Librarians
 Subscriptions Agents
 Order Form
 DOWNLOADS
 
 
 
 
Hybrid Genetic Algorithm for Multicriteria Scheduling with Sequence Dependent Set up Time
Full text
 PDF(144.1KB)
Source 
International Journal of Engineering (IJE)
Table of Contents
Download Complete Issue    PDF(2.82MB)
Volume:  3    Issue:  5
Pages:  413-520
Publication Date:   November 2009
ISSN (Online): 1985-2312
Pages 
510 - 520
Author(s)  
 
Published Date   
30-11-2009 
Publisher 
CSC Journals, Kuala Lumpur, Malaysia
ADDITIONAL INFORMATION
Keywords   Abstract   References   Cited by   Related Articles   Collaborative Colleague
 
KEYWORDS:   UWB, Indoor wireless systems, Keil IDE 
 
 
This Manuscript is indexed in the following databases/websites:-
1. Directory of Open Access Journals (DOAJ)
2. Academic Journals Database
3. Docstoc
4. Scribd
5. PDFCAST
6. WorldCat
7. CiteSeerX
8. Google Scholar
9. ScientificCommons
10. Academic Index
11. ResearchGATE
12. Bielefeld Academic Search Engine (BASE)
13. Libsearch
14. slideshare
15. Chinese Directory Of Open Access
 
 
In this work, multicriteria decision making objective for flow shop scheduling with sequence dependent set up time and due dates have been developed. Multicriteria decision making objective includes total tardiness , total earliness and makespan simultaneously which is very effective decision making for scheduling jobs in modern manufacturing environment. As problem of flow shop scheduling is NP hard and to solve this in a reasonable time, four Special heuristics (SH) based Hybrid Genetic Algorithm (HGA) have also been developed for proposed multicriteria objective function. A computational analysis upto 200 jobs and 20 machines problems has been conducted to evaluate the performance of four HGA’s. The analysis showed the superiority of SH1 based HGA for small size and SH3 based HGA for large size problem for multicriteria flow shop scheduling with sequence dependent set up time and due dates. Keywords: Flow shop scheduling, Genetic algorithm, Sequence dependent set up time, Total tardiness, Total earliness, makespan 
 
 
 
1 Allahverdi A., Ng C.T., Cheng T.C.E. and Kovalyov M.Y. “A survey of scheduling problems with setup times or costs”. European Journal of Operation Research, 187(3):985–1032,2008
2 Rajendran C. “Theory and methodology heuristics for scheduling in flow shop with multiple objectives” .European Journal of Operation Research , 82 (3):540 ?555,1995
3 Ravindran D., Noorul Haq A., Selvakuar S.J. and Sivaraman R. “ Flow shop scheduling with multiple objective of minimizing makespan and total flow time”. International Journal of Advanced Manufacturing Technology, 25:1007–1012,2005
4 Gupta J.N.D., Venkata G., Neppalli R. and Werner F. “Minimizing total flow time in a two-machine flowshop problem with minimum makespan”. International Journal of Production Economics, 69:323–338,2001
5 Sayin S. and Karabati S. “A bicriteria approach to the two-machine flow shop scheduling problem”. European Journal of Operation Research, 113:435–449,1999
6 Danneberg D., Tautenhahn T., Werner F. “A comparison of heuristic algorithms for flow shop scheduling problems with setup times and limited batch size”. Mathematical and Computer Modelling, 29 (9):101–126,1999
7 Toktas B., Azizoglu M. and Koksalan S.K. “Two-machine flow shop scheduling with two criteria: Maximum earliness and makespan”. European Journal of Operation Research, 157(2): 286–295,2004
8 Ponnambalam S. G., Jagannathan H., Kataria M. and Gadicherla A. “A TSP-GA multi-objective algorithm for flow shop scheduling”. International Journal of Advanced Manufacturing Technology, 23: 909–915,2004
9 Loukil T., Teghem J. and Tuyttens D. “Solving multi-objective production scheduling problems using metaheuristics”. European Journal of Operation Research , 161(1) :42–61,2005
10 Fred Choobineh F., Mohebbi E. and Khoo, H. “A multi-objective tabu search for a single-machine scheduling problem with sequence dependent setup times”. European Journal of Operational Research, 175, 318–337,2006
11 Rahimi Vahed R and Mirghorbani S. M. “A multi-objective particle swarm for a flow shop scheduling problem”. Combinatorial Optimization, 13 (1):79–102,2007
12 Noorul Haq and Radha Ramanan T. “A bicriterian flow shops scheduling using artificial neural network”. International Journal of Advanced Manufacturing Technology, 30: 1132–1138, 2006
13 Lockett A. G. and Muhlemann A. P. “Technical notes: a scheduling problem involving sequence dependent changeover times”.Operation Research, 20: 895-902,1972
14 Gowrisankar K, Chandrasekharan Rajendran and Srinivasan G. “Flow shop scheduling algorithm for minimizing the completion time variance and the sum of squares of completion time deviations from a common due date”. European Journal of Operation Research, 132:643–665,2001
15 Blazewicz J, Pesch E, Sterna M and Werner F. “ A comparison of solution procedures for two-machine flow shop scheduling with late work criterion”. Computers and Industrial Engineering, 49:611–624,2005
16 Eren, T. “A bicriteria m-machine flow shop scheduling with sequence-dependent setup times”. Applied Mathematical Modelling,2009 (In press), doi: 10.1016/j.apm.2009.04.005
17 Erenay F.S., et al. “New solution methods for single machine bicriteria Scheduling problem: Minimization of average flow time and number of tardy jobs”. European Journal of Operational Research,2009 (In press), doi:10.1016/j.ejor.2009.02.014
18 Naderi B., Zandieh M. and Roshanaei V. “Scheduling hybrid flowshops with sequence dependent setup times to minimize makespan and maximum tardiness”. International Journal of Advanced Manufacturing Technology, 41:1186–1198,2009
19 Nawaz M., Enscore E. and Ham I. “Heuristic Algorithm for the M-Machine N-Job Flow Shop Sequencing Problem”. Omega, 11: 91–95,1983
20 Taillard E. “Benchmarks of basic scheduling problems”. European Journal of Operation Research, 64:278–285, 1993
 
 
 
1 A. Dhingra and P. Chandna, “A bi-criteria M-machine SDST flow shop scheduling using modified heuristic genetic algorithm”, International Journal of Engineering, Science and Technology, 2(5), pp. 216-225, 2010.
2 S. Najafi, V. M. Dalfard and G. Mohammadi, “Hybrid genetic algorithm for network locating problem by considering multi-purpose trip in stochastic state”, Indian Journal of Science and Technology , 4(9), pp. 1109-1112, Sep. 2011.
3 F. Werner, “Genetic Algorithms for Shop Scheduling Problems: A Survey”, Chapter 1, pp. 1-12.
4 K. M. Senthilkuma, V. Selladurai, K. Raja and V. Thirunavukkarasu, “A Hybrid Algorithm Based on PSO and ACO Approach for Solving Combinatorial Fuzzy Unrelated Parallel Machine Scheduling Problem”, European Journal of Scientific Research, 64(2), pp. 293-313, 2011.
5 V. M. Dalfard, M. Ahmadpour, O. Jalilian and H. Jalilian, “Optimization of net present value of total net profits of client and contractor in payments of client to contactor by the use of hybrid genetic algorithm”, African Journal of Business Management, 6(5), pp. 2034-2042, Feb. 2012.
6 P. Arikaran , Dr. V. Jayabalan and R. Senthilkumar, “Analysis of Unequal Areas Facility Layout Problems”, International Journal of Engineering (IJE), 4(1), pp. 44 – 51, Mar. 2010.
 
 
 
1 docin
 
2 yasni
 
3 pipl
 
 
 
Ashwani Dhingra : Colleagues
Pankaj Chandna : Colleagues  
 
 
 
  Untitled Document
 
Copyrights (c) 2012 Computer Science Journals. All rights reserved.
Best viewed at 1152 x 864 resolution. Microsoft Internet Explorer.
 
  
 
Copyrights & Usage: Articles published by CSC Journals are Open Access. Permission to copy and distribute any other content, images, animation and other parts of this website is prohibited. CSC Journals has the rights to take action against individual/group if they are found victim of copying these parts of the website.