Abstract
This article overviews a recent PhD dissertation representing the first effort at many-objective optimization in job shop scheduling (JSS). The thesis develops genetic programming hyperheuristic (GP-HH) approaches to evolve effective dispatching rules for many conflicting objectives in JSS problems. The aim is to develop GP-HH methods that alleviate issues related to many-objective optimization in JSS problems and evolve new effective dispatching rules capable of enhancing job shops' productivity.
- Branke, J., Nguyen, S., Pickardt, C., Zhang, M.: Automated Design of Production Scheduling Heuristics: A Review. IEEE Trans. Evolutionary Computation 20(1), 110--124 (2016)Google ScholarDigital Library
- Deb, K., Jain, H.: An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraints. IEEE Transactions on Evolutionary Computation 18(4), 577--601 (2014)Google ScholarCross Ref
- Hildebrandt, T., Heger, J., Scholz-Reiter, B.: Towards improved dispatching rules for complex shop floor scenarios: A genetic programming approach. In: Proceedings of Genetic and Evolutionary Computation Conference. pp. 257--264. ACM (2010)Google ScholarDigital Library
- Ishibuchi, H., Murata, T.: A multi-objective genetic local search algorithm and its application to flowshop scheduling. IEEE Transactions on Systems, Man, and Cybernetics, Part C: Applications and Reviews, 28(3), 392--403 (1998)Google ScholarDigital Library
- Jones, A., Rabelo, L.C., Sharawi, A.T.: Survey of job shop scheduling techniques. Wiley encyclopedia of electrical and electronics engineering (2001)Google Scholar
- Leung, J.Y.T. (ed.): Handbook of Scheduling - Algorithms, Models, and Performance Analysis. Chapman and Hall/CRC (2004)Google Scholar
- Pinedo, M.L.: Scheduling: theory, algorithms, and systems. Springer Science & Business Media (2012)Google ScholarCross Ref
- Tsai, C.W., Rodrigues, J.J.P.C.: Metaheuristic Scheduling for Cloud: A Survey. IEEE Systems Journal 8(1), 279--291 (2014)Google Scholar
Recommendations
Many-objective genetic programming for job-shop scheduling
2016 IEEE Congress on Evolutionary Computation (CEC)In Job Shop Scheduling (JSS) problems, there are usually many conflicting objectives to consider, such as the makespan, mean flowtime, maximal tardiness, number of tardy jobs, etc. Most studies considered these objectives separately or aggregated them ...
Parallel Multi-objective Job Shop Scheduling Using Genetic Programming
Proceedings of the Second Australasian Conference on Artificial Life and Computational Intelligence - Volume 9592In recent years, multi-objective optimization for job shop scheduling has become an increasingly important research problem for a wide range of practical applications. Aimed at effectively addressing this problem, the usefulness of an evolutionary hyper-...
Effective ensembles of heuristics for scheduling flexible job shop problem with new job insertion
Flexible job shop scheduling problem.Ensembles of heuristics.Re-scheduling for new job insertion.Multiple objectives scheduling problem. This study investigates the flexible job shop scheduling problem (FJSP) with new job insertion. FJSP with new job ...
Comments