Multiobjective Scheduling by Genetic Algorithms
Multiobjective Scheduling by Genetic Algorithms

Multiobjective Scheduling by Genetic Algorithms

|
     0     
5
4
3
2
1




International Edition


About the Book

Multiobjective Scheduling by Genetic Algorithms describes methods for developing multiobjective solutions to common production scheduling equations modeling in the literature as flowshops, job shops and open shops. The methodology is metaheuristic, one inspired by how nature has evolved a multitude of coexisting species of living beings on earth. Multiobjective flowshops, job shops and open shops are each highly relevant models in manufacturing, classroom scheduling or automotive assembly, yet for want of sound methods they have remained almost untouched to date. This text shows how methods such as Elitist Nondominated Sorting Genetic Algorithm (ENGA) can find a bevy of Pareto optimal solutions for them. Also it accents the value of hybridizing Gas with both solution-generating and solution-improvement methods. It envisions fundamental research into such methods, greatly strengthening the growing reach of metaheuristic methods. This book is therefore intended for students of industrial engineering, operations research, operations management and computer science, as well as practitioners. It may also assist in the development of efficient shop management software tools for schedulers and production planners who face multiple planning and operating objectives as a matter of course.

Table of Contents:
1 Shop Scheduling: An Overview.- 1.1 What Is Scheduling?.- 1.2 Machine Scheduling Preliminaries.- 1.3 Intelligent Solutions to Complex Problems.- 1.4 Scheduling Techniques: Analytical, Heuristic and Metaheuristic.- 1.5 Outline of this Text.- 2 What are Genetic Algorithms?.- 2.1 Evolutionary Computation and Biology.- 2.2 Working Principles.- 2.3 The Genetic Search Process.- 2.4 The Simple Genetic Algorithm (SGA).- 2.5 An Application of GA in Numerical Optimization.- 2.6 Genetic Algorithms vs. Traditional ptimization.- 2.7 Theoretical Foundation of GAs.- 2.8 Schema Processing: An Illustration.- 2.9 Advanced Models of Genetic Algorithms.- 3 Calibration of GA Parameters.- 3.1 GA Parameters and the Control of Search.- 3.2 The Role of the “Elite” who Parent the Next Generation.- 3.3 The Factorial Parametric Study.- 3.4 Experimental Results and Their Interpretation.- 3.5 Chapter Summary.- 4 Flowshop Scheduling.- 4.1 The Flowshop.- 4.2 Flowshop Model Formulation.- 4.3 The Two-Machine Flowshop.- 4.4 Sequencing the General m-Machine Flowshop.- 4.5 Heuristic Methods for Flowshop Scheduling.- 4.6 Darwinian and Lamarckian Genetic Algorithms.- 4.7 Flowshop Sequencing by GA: An Illustration.- 4.8 Darwinian and Lamarckian Theories of Natural Evolution.- 4.9 Some Inspiring Results of using Lamarckism.- 4.10 A Multiobjective GA for Flowshop Scheduling.- 4.11 Chapter Summary.- 5 Job Shop Scheduling.- 5.1 The Classical Job Shop Problem (JSP).- 5.2 Heuristic Methods for Scheduling the Job Shop.- 5.3 Genetic Algorithms for Job Shop Scheduling.- 5.4 Chapter Summary.- 6 Multiobjective Optimization.- 6.1 Multiple Criteria Decision Making.- 6.2 A Sufficient Condition: Conflicting Criteria.- 6.3 Classification of Multiobjective Problems.- 6.4 Solution Methods.- 6.5 Multiple CriteriaOptimization Redefined.- 6.6 The Concept of Pareto Optimality and “Efficient” Solutions.- 7 Niche Formation and Speciation: Foundations of Multiobjective GAs.- 7.1 Biological Moorings of Natural Evolution.- 7.2 Evolution is also Cultural.- 7.3 The Natural World of a Thousand Species.- 7.4 Key Factors Affecting the Formation of Species.- 7.5 What is a Niche?.- 7.6 Population Diversification through Niche Compacting.- 7.7 Speciation: The Formation of New Species.- 8 The Nondominated Sorting Genetic Algorithm: NSGA.- 8.1 Genetic Drift: A Characteristic Feature of SGA.- 8.2 The Vector Evaluated Genetic Algorithm (VEGA).- 8.3 Niche, Species, Sharing and Function Optimization.- 8.4 Multiobjective Optimization Genetic Algorithm (MOGA).- 8.5 Pareto Domination Tournaments.- 8.6 A Multiobjective GA Based on the Weighted Sum.- 8.7 The Nondominated Sorting Genetic Algorithm (NSGA).- 8.8 Applying NSGA: A Numerical Example.- 8.9 Chapter Summary.- 9 Multiobjective Flowshop Scheduling.- 9.1 Traditional Methods to Sequence Jobs in the Multiobjective Flowshop.- 9.2 Disadvantages of Classical Methods.- 9.3 Adaptive Random Search Optimization.- 9.4 Recollection of the Concept of Pareto Optimality.- 9.5 NSGA Solutions to the Multiobjective Flowshop.- 9.6 How NSGA Produced Pareto Optimal Sequences.- 9.7 The Quality of the Final Solutions.- 9.8 Chapter Summary.- 10 A New Genetic Algorithm for Sequencing the Multiobjective Flowshop.- 10.1 The Elitist Nondominated Sorting Genetic Algorithm (ENGA).- 10.2 Initialization of ENGA (Box 1).- 10.3 Performance Evaluation.- 10.4 Genetic Processing Operators.- 10.5 The Additional Nondominated Sorting and Ranking (Box 8).- 10.6 Stopping Condition and Output Module.- 10.7 Parameterization of ENGA by Design of Experiments.- 10.8 Application of ENGA tothe 49-Job.- 15-Machine Flowshop.- 10.9 Chapter Summary.- 11 A Comparison of Multiobjective Flowshop Sequencing by NSGA and ENGA.- 11.1 NSGA vs. ENGA: Computational Experience.- 11.2 Statistical Evaluation of GA Results.- 11.3 Chapter Summary.- 12 Multiobjective Job Shop Scheduling.- 12.1 Multiobjective JSP Implementation.- 12.2 NSGA vs. ENGA: Computational Experience.- 12.3 Chapter Summary.- 13 Multiobjective Open Shop Scheduling.- 13.1 An Overview of the Open Shop.- 13.2 Multiobjective GA Implementation.- 13.3 NSGA vs. ENGA: Some Computational Results.- 14 Epilog and Directions for Further Work.- · Exact solutions.- · Solving the General Job Shop.- · Seeking Pareto Optimality.- · Optimization of GA Parameters.- · ENGA vs. Other Multiobjective Solution Methods.- · Conflicting and Synergistic Optimization Objectives.- · Darwinian and Lamarckian GAs: The High Value of Hybridizing.- · Concluding Remarks.- References.


Best Sellers


Product Details
  • ISBN-13: 9780792385615
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Height: 235 mm
  • No of Pages: 358
  • Returnable: N
  • ISBN-10: 0792385616
  • Publisher Date: 31 Aug 1999
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Multiobjective Scheduling by Genetic Algorithms
Springer -
Multiobjective Scheduling by Genetic Algorithms
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Multiobjective Scheduling by Genetic Algorithms

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals

    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!