Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
167 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
42 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Solving Distributed Flexible Job Shop Scheduling Problems in the Wool Textile Industry with Quantum Annealing (2403.06699v1)

Published 11 Mar 2024 in quant-ph and cs.ET

Abstract: Many modern manufacturing companies have evolved from a single production site to a multi-factory production environment that must handle both geographically dispersed production orders and their multi-site production steps. The availability of a range of machines in different locations capable of performing the same operation and shipping times between factories have transformed planning systems from the classic Job Shop Scheduling Problem (JSSP) to Distributed Flexible Job Shop Scheduling Problem (DFJSP). As a result, the complexity of production planning has increased significantly. In our work, we use Quantum Annealing (QA) to solve the DFJSP. In addition to the assignment of production orders to production sites, the assignment of production steps to production sites also takes place. This requirement is based on a real use case of a wool textile manufacturer. To investigate the applicability of this method to large problem instances, problems ranging from 50 variables up to 250 variables, the largest problem that could be embedded into a D-Wave quantum annealer Quantum Processing Unit (QPU), are formulated and solved. Special attention is dedicated to the determination of the Lagrange parameters of the Quadratic Unconstrained Binary Optimization (QUBO) model and the QPU configuration parameters, as these factors can significantly impact solution quality. The obtained solutions are compared to solutions obtained by Simulated Annealing (SA), both in terms of solution quality and calculation time. The results demonstrate that QA has the potential to solve large problem instances specific to the industry.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (29)
  1. A. Baskar and M. A. Xavior. A Simple Model to Optimize General Flow-Shop Scheduling Problems With Known Break Down Time And Weights Of Jobs. Procedia Engineering, 38:191–196, 2012. ISSN 1877-7058. URL https://doi.org/10.1016/j.proeng.2012.06.026.
  2. Quantum Annealing as an Optimized Simulated Annealing: A Case Study, 2018. URL https://doi.org/10.13140/RG.2.2.33538.53448.
  3. Michael Brooks. Beyond quantum supremacy: the hunt for useful quantum computers. Nature, 574(7776):19–21, 2019. ISSN 1476-4687. URL https://doi.org/10.1038/d41586-019-02936-3.
  4. Evaluating the job shop scheduling problem on a D-wave quantum annealer. Scientific Reports, 12(1), 2022. ISSN 2045-2322. URL https://doi.org/10.1038/s41598-022-10169-0.
  5. D-Wave Systems Inc. What is Quantum Annealing? (D-Wave System Documentation), a. URL https://docs.dwavesys.com/docs/latest/c_gs_2.html. Last accessed 09 February 2024.
  6. D-Wave Systems Inc. Solver Properties and Parameters (D-Wave System Documentation), b. URL https://docs.dwavesys.com/docs/latest/c_solver_summary.html. Last accessed 09 February 2024.
  7. D-Wave Systems Inc. Chain Strength (D-Wave System Documentation), c. URL https://docs.ocean.dwavesys.com/projects/system/en/latest/reference/generated/dwave.embedding.chain_strength.uniform_torque_compensation.html. Last accessed 09 February 2024.
  8. What is the Computational Value of Finite-Range Tunneling? Phys. Rev. X, 6:031015, 2016. URL https://link.aps.org/doi/10.1103/PhysRevX.6.031015.
  9. Quantum algorithms for process parallel flexible job shop scheduling. CIRP Journal of Manufacturing Science and Technology, 33:100–114, 2021. ISSN 1755-5817. URL https://doi.org/10.1016/j.cirpj.2021.03.006.
  10. Tabu search algorithms for job-shop problems with a single transport robot. Eur. J. Oper. Res., 162(1):99–111, 2005. URL https://doi.org/10.1016/j.ejor.2003.10.034.
  11. Scheduling flexible job-shops with transportation times: Mathematical models and a hybrid imperialist competitive algorithm. Applied Mathematical Modelling, 41:667–682, 2017. ISSN 0307-904X. URL https://doi.org/10.1016/j.apm.2016.09.022.
  12. Quadratic unconstrained binary optimization problem preprocessing: Theory and empirical analysis. Networks, 70(2):79–97, 2017. URL https://doi.org/10.1002/net.21751.
  13. Solving Distributed and Flexible Job-Shop Scheduling Problems for a Real-World Fastener Manufacturer. IEEE Access, 2:1598–1606, 2014. URL https://doi.org/10.1109/ACCESS.2015.2388486.
  14. Andrew Lucas. Ising formulations of many NP problems. Frontiers in Physics, 2, 2014. ISSN 2296-424X. URL https://doi.org/10.3389/fphy.2014.00005.
  15. Solving Distributed and Flexible Job shop Scheduling Problem using a Chemical Reaction Optimization metaheuristic. In Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 22nd International Conference KES-2018, Belgrade, Serbia, 3-5 September 2018, volume 126 of Procedia Computer Science, pages 1424–1433. Elsevier, 2018. URL https://doi.org/10.1016/j.procs.2018.08.114.
  16. S. Mukherjee and B.K. Chakrabarti. Multivariable optimization: Quantum annealing and computation. The European Physical Journal Special Topics, 224(1):17–24, 2015. ISSN 1951-6401. URL https://doi.org/10.1140/epjst/e2015-02339-y.
  17. An improved simulated annealing for hybrid flowshops with sequence-dependent setup and transportation times to minimize total completion time and total tardiness. Expert Systems with Applications, 36(6):9625–9633, 2009. ISSN 0957-4174. URL https://doi.org/10.1016/j.eswa.2008.09.063.
  18. Permutation flowshops with transportation times: Mathematical models and solution methods. The International Journal of Advanced Manufacturing Technology, 46:631–647, 2010. URL https://doi.org/10.1007/S00170-009-2122-8.
  19. Solving the flexible job shop problem by hybrid metaheuristics-based multiagent model. Journal of Industrial Engineering International, 14(1):1–14, 2017. ISSN 2251-712X. URL https://doi.org/10.1007/s40092-017-0204-z.
  20. Solving workflow scheduling problems with QUBO modeling, 2022. URL https://arxiv.org/abs/2205.04844v1.
  21. Solving flexible job shop scheduling problems in manufacturing with quantum annealing. Production Engineering, 17(1):105–115, 2022. ISSN 1863-7353. URL https://doi.org/10.1007/s11740-022-01145-8.
  22. El-Ghazali Talbi. Metaheuristics - From Design to Implementation. Wiley, 2009. ISBN 978-0-470-27858-1.
  23. Kasirajan Venkateswaran. Adiabatic Optimization and Quantum Annealing, pages 365–373. Springer International Publishing, 2021. ISBN 978-3-030-63689-0. URL https://doi.org/10.1007/978-3-030-63689-0_8.
  24. Quantum Annealing Implementation of Job-Shop Scheduling, 2016. URL https://arxiv.org/abs/1506.08479v2.
  25. Embedding Equality Constraints of Optimization Problems into a Quantum Annealer. Algorithms, 12(4):77, 2019. URL https://doi.org/10.3390/a12040077.
  26. Quantum annealing for industry applications: introduction and review. Reports on Progress in Physics, 85(10):104001, 2022. ISSN 1361-6633. URL https://doi.org/10.1088/1361-6633/ac8c54.
  27. PyQUBO: Python Library for Mapping Combinatorial Optimization Problems to QUBO Form. IEEE Trans. Computers, 71(4):838–850, 2022. URL https://doi.org/10.1109/TC.2021.3063618.
  28. Solving flexible job shop scheduling problems with transportation time based on improved genetic algorithm. Mathematical biosciences and engineering : MBE, 16(3):1334—1347, 2019. ISSN 1547-1063. URL https://doi.org/10.3934/mbe.2019065.
  29. Improving Quantum Annealing Performance on Embedded Problems. Supercomput. Front. Innov., 7(4):32–48, 2020. URL https://doi.org/10.14529/jsfi200403.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
X Twitter Logo Streamline Icon: https://streamlinehq.com

Tweets