Thomas Weise
Xinlu Li
ABSTRACT
The most basic concept of (meta-)heuristic optimization is to prefer better solutions over worse ones. Algorithms utilizing Frequency Fitness Assignment (FFA) break with this idea and instead move towards solutions whose objective value has been encountered less often so far. We investigate whether this approach can be applied to solve the classical Job Shop Scheduling Problem (JSSP) by plugging FFA into the (1+1)-EA, i.e., the most basic local search. As representation, we use permutations with repetitions. Within the budget chosen in our experiments, the resulting (1+1)-FEA can obtain better solutions in average on the Fisher-Thompson, Lawrence, Applegate-Cook, Storer-Wu-Vaccari, and Yamada-Nakano benchmark sets, while performing worse on the larger Taillard and Demirkol-Mehta-Uzsoy benchmarks. We find that while the simple local search with FFA does not outperform the pure algorithm, it can deliver surprisingly good results, especially since it is not directly biased towards searching for them.
- Tamer F. Abdelmaguid. 2010. Representations in Genetic Algorithm for the Job Shop Scheduling Problem: A Computational Study. Journal of Software Engineering and Applications 3, 12 (2010), 1155--1162. Google Scholar
Cross Ref
- Joseph Adams, Egon Balas, and Daniel Zawack. 1988. The Shifting Bottleneck Procedure for Job Shop Scheduling. Management Science 34, 3 (1988), 391--401. Google ScholarDigital Library
- Denis Antipov and Benjamin Doerr. 2018. Precise Runtime Analysis for Plateaus. In 15th Intl. Conf. on Parallel Problem Solving from Nature (PPSN XV), Part II, Sept. 8--12, 2018, Coimbra, Portugal. Springer, Cham, Switzerland, 117--128. Google ScholarCross Ref
- David Lee Applegate and William John Cook. 1991. A Computational Study of the Job-Shop Scheduling Problem. ORSA Journal on Computing 3, 2 (1991), 149--156. Google ScholarCross Ref
- Leila Asadzadeh. 2015. A Local Search Genetic Algorithm for the Job Shop Scheduling Problem with Intelligent Agents. Computers & Industrial Engineering85 (2015), 376--383. Google ScholarDigital Library
- Thomas Bäck, David B. Fogel, and Zbigniew Michalewicz (Eds.). 1997. Handbook of Evolutionary Computation. Bristol, UK: Institute of Physics Publishing and New York, NY, USA: Oxford University Press.Google Scholar
- Christian Bierwirth. 1995. A Generalized Permutation Approach to Job Shop Scheduling with Genetic Algorithms. The Journal of the Operational Research Society 17, 2--3 (1995), 87--92. Google ScholarCross Ref
- Jacek Błażewicz, Wolfgang Domschke, and Erwin Pesch. 1996. The Job Shop Scheduling Problem: Conventional and New Solution Techniques. European Journal of Operational Research 93, 1 (1996), 1--33. Google ScholarCross Ref
- Bo Chen, Chris N. Potts, and Gerhard J. Woeginger. 1998. A Review of Machine Scheduling: Complexity, Algorithms and Approximability. In Handbook of Combinatorial Optimization, Ding-Zhu Du and Panos M. Pardalos (Eds.). Springer, Boston, MA, USA, 1493--1641. Google ScholarCross Ref
- Antoine Cully and Yiannis Demiris. 2018. Quality and Diversity Optimization: A Unifying Modular Framework. IEEE Transactions on Evolutionary Computation 22, 2 (2018), 245--259. Google ScholarCross Ref
- Ebru Demirkol, Sanjay V. Mehta, and Reha Uzsoy. 1998. Benchmarks for Shop Scheduling Problems. European Journal of Operational Research 109, 1 (1998), 137--141. Google ScholarCross Ref
- Henry Fisher and Gerald L. Thompson. 1963. Probabilistic Learning Combinations of Local Job-Shop Scheduling Rules. In Industrial Scheduling, John F. Muth and Gerald L. Thompson (Eds.). Prentice-Hall, Englewood Cliffs, NJ, USA, 225--251.Google Scholar
- Philip J. Fleming and John J. Wallace. 1986. How Not to Lie with Statistics: The Correct Way to Summarize Benchmark Results. Commun. ACM 29, 3 (1986), 218--221. Google ScholarDigital Library
- Edson Flórez, Wilfredo Gómez, and Lola Bautista. 2013. An Ant Colony Optimization Algorithm for Job Shop Scheduling Problem. Computing Research Repository (CoRR) abs/1309.5110. arxiv. https://arxiv.org/pdf/1309.5110.pdfGoogle Scholar
- Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York, NY, USA.Google ScholarDigital Library
- Mitsuo Gen, Yasuhiro Tsujimura, and Erika Kubota. 1994. Solving Job-Shop Scheduling Problems by Genetic Algorithm. In Humans, Information and Technology: IEEE Intl. Conf. on Systems, Man and Cybernetics, Oct. 2--5, 1994, San Antonio, TX, USA, Vol. 2. IEEE. Google ScholarCross Ref
- Fred W. Glover, Éric D. Taillard, and Dominique de Werra. 1993. A User's Guide to Tabu Search. Annals of Operations Research 41, 1 (1993), 3--28. Google ScholarCross Ref
- Daniele Gravina, Antonios Liapis, and Georgios N. Yannakakis. 2019. Quality Diversity Through Surprise. IEEE Transactions on Evolutionary Computation 23, 4 (2019), 603--616. Google ScholarCross Ref
- Nikolaus Hansen, Raymond Ros, Nikolas Mauny, Marc Schoenauer, and Anne Auger. 2011. Impacts of Invariance in Search: When CMA-ES and PSO Face Ill-Conditioned and Non-Separable Problems. Applied Soft Computing 11, 8 (2011), 5755--5769. Google ScholarDigital Library
- Tianhua Jiang and Chao Zhang. 2018. Application of Grey Wolf Optimization for Solving Combinatorial Problems: Job Shop and Flexible Job Shop Scheduling Cases. IEEE Access 6 (2018), 26231--26240. Google ScholarCross Ref
- Vedavyasrao Jorapur, V. S. Puranik, A. S. Deshpande, and M. R. Sharma. 2014. Comparative Study of Different Representations in Genetic Algorithms for Job Shop Scheduling Problem. Journal of Software Engineering and Applications 7, 7 (2014), 571--580. Google ScholarCross Ref
- Scott Kirkpatrick, C. Daniel Gelatt, Jr., and Mario P. Vecchi. 1983. Optimization by Simulated Annealing. Science Magazine 220, 4598 (1983), 671--680. Google ScholarCross Ref
- Eugene Leighton Lawler, Jan Karel Lenstra, Alexander Hendrik George Rinnooy Kan, and David B. Shmoys. 1993. Sequencing and Scheduling: Algorithms and Complexity. In Handbook of Operations Research and Management Science, Stephen C. Graves, Alexander Hendrik George Rinnooy Kan, and Paul H. Zipkin (Eds.). Vol. IV. North-Holland Scientific Publishers Ltd., Amsterdam, The Netherlands, 445--522. Google ScholarCross Ref
- Stephen R. Lawrence. 1984. Resource Constrained Project Scheduling: An Experimental Investigation of Heuristic Scheduling Techniques (Supplement). Ph.D. Dissertation. Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA, USA.Google Scholar
- Joss Miller-Todd, Kathleen Steinhöfel, and Patrick Veenstra. 2018. Firefly-Inspired Algorithm for Job Shop Scheduling. In Adventures Between Lower Bounds and Higher Altitudes - Essays Dedicated to Juraj Hromkovič on the Occasion of His 60th Birthday, Hans-Joachim Böckenhauer, Dennis Komm, and Walter Unger (Eds.). Springer, 423--433. Google ScholarCross Ref
- S. Narendhar and T. Amudha. 2012. A Hybrid Bacterial Foraging Algorithm For Solving Job Shop Scheduling Problems. Intl. Journal of Programming Languages and Applications 2, 4 (2012), 1--11. Google ScholarCross Ref
- Yann Ollivier, Ludovic Arnold, Anne Auger, and Nikolaus Hansen. 2017. Information-Geometric Optimization Algorithms: A Unifying Picture via Invariance Principles. Journal of Machine Learning Research 18 (2017), 1--65. http://jmlr.org/papers/v18/14-467.htmlGoogle ScholarDigital Library
- Guoyong Shi, Hitoshi Iima, and Nobuo Sannomiya. 1997. New Encoding Scheme for Solving Job Shop Problems by Genetic Algorithm. In 35th IEEE Conf. on Decision and Control (CDC'96), Dec. 11--13, 1996, Kobe, Japan, Vol. 4. IEEE, 4395--4400. Google ScholarCross Ref
- Oleg V. Shylo. 2019. Job Shop Scheduling. http://optimizizer.com/jobshop.phpGoogle Scholar
- Robert H. Storer, S. David Wu, and Renzo Vaccari. 1992. New Search Spaces for Sequencing Problems with Application to Job Shop Scheduling. Management Science 38, 10 (1992), 1495--1509. Google ScholarDigital Library
- Éric D. Taillard. 1993. Benchmarks for Basic Scheduling Problems. European Journal of Operational Research 64, 2 (1993), 278--285. Google ScholarCross Ref
- Jelke Jeroen van Hoorn. 2016. Job Shop Instances and Solutions. http://jobshop.jjvh.nlGoogle Scholar
- Shao-Juan Wang, Chun-Wei Tsai, and Ming-Chao Chiang. 2018. A High Performance Search Algorithm for Job-Shop Scheduling Problem. In 9th Intl. Conf. on Emerging Ubiquitous Systems and Pervasive Networks (EUSPN'18) / 8th Intl. Conf. on Current and Future Trends of Information and Communication Technologies in Healthcare (ICTH'18) /Affiliated Workshops, Nov. 5--8, 2018, Leuven, Belgium. Elsevier, 119--126. Google ScholarCross Ref
- Thomas Weise. 2019--2020. jsspInstancesAndResults: Results, Data, and Instances of the Job Shop Scheduling Problem. https://github.com/thomasWeise/jsspInstancesAndResults as viewed on 2020-11-25.Google Scholar
- Thomas Weise, Mingxu Wan, Ke Tang, Pu Wang, Alexandre Devert, and Xin Yao. 2014. Frequency Fitness Assignment. IEEE Transactions on Evolutionary Computation 18, 2 (2014), 226--243. Google ScholarDigital Library
- Thomas Weise, Zhize Wu, Xinlu Li, and Yan Chen. 2021. Frequency Fitness Assignment: Making Optimization Algorithms Invariant under Bijective Transformations of the Objective Function Value. IEEE Transactions on Evolutionary Computation 25, 2 (April 2021). preprint available at arXiv:2001.01416v5 [cs.NE] 15 Oct 2020. Google ScholarCross Ref
- L. Darrell Whitley. 1989. The GENITOR Algorithm and Selection Pressure: Why Rank-Based Allocation of Reproductive Trials is Best. In 3rd Intl. Conf. on Genetic Algorithms (ICGA'89), June 4--7, 1989, Fairfax, VA, USA. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 116--121.Google Scholar
- Takeshi Yamada and Ryohei Nakano. 1992. A Genetic Algorithm Applicable to Large-Scale Job-Shop Instances. In Parallel Problem Solving from Nature 2 (PPSN II), Sept. 28--30, 1992, Brussels, Belgium. Elsevier, Amsterdam, The Netherlands, 281--290.Google Scholar
Index Terms
- Solving job shop scheduling problems without using a bias for good solutions
Recommendations
A neighborhood for complex job shop scheduling problems with regular objectives
Due to the limited applicability in practice of the classical job shop scheduling problem, many researchers have addressed more complex versions of this problem by including additional process features, such as time lags, setup times, and buffer ...
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