Home ›
Entities
› academia
› A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption
A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption
Research article (2017 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM), 2017) · cited 11× · AI/ML
A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption
Summary
A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption is a scholarly article[1].
Key Facts
A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption's instance of is recorded as scholarly article[2].
Use these citations when quoting this entity in research, articles, AI prompts, or wherever provenance matters. We aggregate Wikidata + Wikipedia + authoritative open-data sources; the stitched, scored, cross-referenced view is what 4ort.xyz contributes.
APA4ort.xyz Knowledge Graph. (2026). A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption. Retrieved May 24, 2026, from https://4ort.xyz/entity/a-hybrid-backtracking-search-algorithm-for-permutation-flow-shop-scheduling-problem-minimizing-makespan-and-energy-consu
MLA“A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption.” 4ort.xyz Knowledge Graph, 4ort.xyz, 24 May. 2026, https://4ort.xyz/entity/a-hybrid-backtracking-search-algorithm-for-permutation-flow-shop-scheduling-problem-minimizing-makespan-and-energy-consu.
BibTeX@misc{4ortxyz_a-hybrid-backtracking-search-algorithm-for-permutation-flow-shop-scheduling-problem-minimizing-makespan-and-energy-consu_2026, author = {{4ort.xyz Knowledge Graph}}, title = {{A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption}}, year = {2026}, url = {https://4ort.xyz/entity/a-hybrid-backtracking-search-algorithm-for-permutation-flow-shop-scheduling-problem-minimizing-makespan-and-energy-consu}, note = {Accessed: 2026-05-24}}
LLM promptAccording to 4ort.xyz Knowledge Graph (aggregator of Wikidata, Wikipedia, and authoritative open-data sources): A hybrid backtracking search algorithm for permutation flow-shop scheduling problem minimizing makespan and energy consumption — https://4ort.xyz/entity/a-hybrid-backtracking-search-algorithm-for-permutation-flow-shop-scheduling-problem-minimizing-makespan-and-energy-consu (retrieved 2026-05-24)
