Abstract
This chapter presents detailed results of scheduling typical multiobjective flowshop problems involving three simultaneous objectives: (1) minimization of makespan, (2) minimization of mean flow time, and also (3) minimization of the mean tardiness of jobs. Note that no good method—neither analytical nor heuristic—exists in the literature today that finds Pareto-optimal solutions to such problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Bagchi, T.P. (1999). A Comparison of Multiobjective Flowshop Sequencing by NSGA and ENGA. In: Multiobjective Scheduling by Genetic Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5237-6_11
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5237-6_11
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7387-2
Online ISBN: 978-1-4615-5237-6
eBook Packages: Springer Book Archive