Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:(heuristic programming). Showing records 1 – 30 of 182 total matches.

[1] [2] [3] [4] [5] [6] [7]

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Victoria University of Wellington

1. Nguyen, Su. Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming.

Degree: 2013, Victoria University of Wellington

 Scheduling is an important planning activity in manufacturing systems to help optimise the usage of scarce resources and improve the customer satisfaction. In the job… (more)

Subjects/Keywords: Genetic programming; Scheduling; Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nguyen, S. (2013). Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/3018

Chicago Manual of Style (16th Edition):

Nguyen, Su. “Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming.” 2013. Doctoral Dissertation, Victoria University of Wellington. Accessed January 20, 2021. http://hdl.handle.net/10063/3018.

MLA Handbook (7th Edition):

Nguyen, Su. “Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming.” 2013. Web. 20 Jan 2021.

Vancouver:

Nguyen S. Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2013. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10063/3018.

Council of Science Editors:

Nguyen S. Automatic Design of Dispatching Rules for Job Shop Scheduling with Genetic Programming. [Doctoral Dissertation]. Victoria University of Wellington; 2013. Available from: http://hdl.handle.net/10063/3018


University of Adelaide

2. Cooper, Dale Francis. An experimental investigation of some heuristics for scheduling resource-constrained projects.

Degree: 1974, University of Adelaide

Subjects/Keywords: Heuristic programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cooper, D. F. (1974). An experimental investigation of some heuristics for scheduling resource-constrained projects. (Thesis). University of Adelaide. Retrieved from http://hdl.handle.net/2440/20711

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Cooper, Dale Francis. “An experimental investigation of some heuristics for scheduling resource-constrained projects.” 1974. Thesis, University of Adelaide. Accessed January 20, 2021. http://hdl.handle.net/2440/20711.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Cooper, Dale Francis. “An experimental investigation of some heuristics for scheduling resource-constrained projects.” 1974. Web. 20 Jan 2021.

Vancouver:

Cooper DF. An experimental investigation of some heuristics for scheduling resource-constrained projects. [Internet] [Thesis]. University of Adelaide; 1974. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/2440/20711.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Cooper DF. An experimental investigation of some heuristics for scheduling resource-constrained projects. [Thesis]. University of Adelaide; 1974. Available from: http://hdl.handle.net/2440/20711

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Simon Fraser University

3. Wu, Wuyi. Heuristic bounds for automated logic synthesis : a heuristic method for evaluating two extremal implementations for a RT level digital system design.

Degree: 1987, Simon Fraser University

Subjects/Keywords: Heuristic programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wu, W. (1987). Heuristic bounds for automated logic synthesis : a heuristic method for evaluating two extremal implementations for a RT level digital system design. (Thesis). Simon Fraser University. Retrieved from http://summit.sfu.ca/item/5437

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wu, Wuyi. “Heuristic bounds for automated logic synthesis : a heuristic method for evaluating two extremal implementations for a RT level digital system design.” 1987. Thesis, Simon Fraser University. Accessed January 20, 2021. http://summit.sfu.ca/item/5437.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wu, Wuyi. “Heuristic bounds for automated logic synthesis : a heuristic method for evaluating two extremal implementations for a RT level digital system design.” 1987. Web. 20 Jan 2021.

Vancouver:

Wu W. Heuristic bounds for automated logic synthesis : a heuristic method for evaluating two extremal implementations for a RT level digital system design. [Internet] [Thesis]. Simon Fraser University; 1987. [cited 2021 Jan 20]. Available from: http://summit.sfu.ca/item/5437.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wu W. Heuristic bounds for automated logic synthesis : a heuristic method for evaluating two extremal implementations for a RT level digital system design. [Thesis]. Simon Fraser University; 1987. Available from: http://summit.sfu.ca/item/5437

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Columbia University

4. Varley, Jacob Joseph. Learning To Grasp.

Degree: 2018, Columbia University

 Providing robots with the ability to grasp objects has, despite decades of research, remained a challenging problem. The problem is approachable in constrained environments where… (more)

Subjects/Keywords: Robotics; Computer science; Heuristic programming; Robotics – Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Varley, J. J. (2018). Learning To Grasp. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D83217FR

Chicago Manual of Style (16th Edition):

Varley, Jacob Joseph. “Learning To Grasp.” 2018. Doctoral Dissertation, Columbia University. Accessed January 20, 2021. https://doi.org/10.7916/D83217FR.

MLA Handbook (7th Edition):

Varley, Jacob Joseph. “Learning To Grasp.” 2018. Web. 20 Jan 2021.

Vancouver:

Varley JJ. Learning To Grasp. [Internet] [Doctoral dissertation]. Columbia University; 2018. [cited 2021 Jan 20]. Available from: https://doi.org/10.7916/D83217FR.

Council of Science Editors:

Varley JJ. Learning To Grasp. [Doctoral Dissertation]. Columbia University; 2018. Available from: https://doi.org/10.7916/D83217FR


Universidade Federal de Mato Grosso do Sul

5. Abe, Fabio Henrique Noboru. Problema das pseudo-arborescências capacitadas com localização de facilidades .

Degree: 2016, Universidade Federal de Mato Grosso do Sul

 Neste trabalho apresentamos o problema das pseudo-arborescências capacitadas com localização de facilidades, um problema novo e relacionado a dois outros problemas clássicos: o problema do… (more)

Subjects/Keywords: Programação Linear; Heurística; Programação Heurística; Linear Programming; Heuristic; Heuristic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Abe, F. H. N. (2016). Problema das pseudo-arborescências capacitadas com localização de facilidades . (Thesis). Universidade Federal de Mato Grosso do Sul. Retrieved from http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2887

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Abe, Fabio Henrique Noboru. “Problema das pseudo-arborescências capacitadas com localização de facilidades .” 2016. Thesis, Universidade Federal de Mato Grosso do Sul. Accessed January 20, 2021. http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2887.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Abe, Fabio Henrique Noboru. “Problema das pseudo-arborescências capacitadas com localização de facilidades .” 2016. Web. 20 Jan 2021.

Vancouver:

Abe FHN. Problema das pseudo-arborescências capacitadas com localização de facilidades . [Internet] [Thesis]. Universidade Federal de Mato Grosso do Sul; 2016. [cited 2021 Jan 20]. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2887.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Abe FHN. Problema das pseudo-arborescências capacitadas com localização de facilidades . [Thesis]. Universidade Federal de Mato Grosso do Sul; 2016. Available from: http://repositorio.cbc.ufms.br:8080/jspui/handle/123456789/2887

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Victoria University of Wellington

6. Masood, Atiya. Many-Objective Genetic Programming for Job-Shop Scheduling.

Degree: 2020, Victoria University of Wellington

 The Job Shop Scheduling (JSS) problem is considered to be a challenging one due to practical requirements such as multiple objectives and the complexity of… (more)

Subjects/Keywords: Many-objective optimization; Genetic programming; Scheduling; Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Masood, A. (2020). Many-Objective Genetic Programming for Job-Shop Scheduling. (Doctoral Dissertation). Victoria University of Wellington. Retrieved from http://hdl.handle.net/10063/9393

Chicago Manual of Style (16th Edition):

Masood, Atiya. “Many-Objective Genetic Programming for Job-Shop Scheduling.” 2020. Doctoral Dissertation, Victoria University of Wellington. Accessed January 20, 2021. http://hdl.handle.net/10063/9393.

MLA Handbook (7th Edition):

Masood, Atiya. “Many-Objective Genetic Programming for Job-Shop Scheduling.” 2020. Web. 20 Jan 2021.

Vancouver:

Masood A. Many-Objective Genetic Programming for Job-Shop Scheduling. [Internet] [Doctoral dissertation]. Victoria University of Wellington; 2020. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10063/9393.

Council of Science Editors:

Masood A. Many-Objective Genetic Programming for Job-Shop Scheduling. [Doctoral Dissertation]. Victoria University of Wellington; 2020. Available from: http://hdl.handle.net/10063/9393


Delft University of Technology

7. Doolaard, F.P. (author). Deepification: Learning Variable Ordering Heuristics in Constraint Optimization Problems.

Degree: 2020, Delft University of Technology

Constraint programming is a paradigm for solving combinatorial problems by checking whether constraints are satisfied in a constraint satisfaction problem or by optimizing an objective… (more)

Subjects/Keywords: Machine Learning; Constraint Programming; Combinatorial Optimization; Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Doolaard, F. P. (. (2020). Deepification: Learning Variable Ordering Heuristics in Constraint Optimization Problems. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:fbab3fe2-e077-4d41-ace4-e434c25ce27f

Chicago Manual of Style (16th Edition):

Doolaard, F P (author). “Deepification: Learning Variable Ordering Heuristics in Constraint Optimization Problems.” 2020. Masters Thesis, Delft University of Technology. Accessed January 20, 2021. http://resolver.tudelft.nl/uuid:fbab3fe2-e077-4d41-ace4-e434c25ce27f.

MLA Handbook (7th Edition):

Doolaard, F P (author). “Deepification: Learning Variable Ordering Heuristics in Constraint Optimization Problems.” 2020. Web. 20 Jan 2021.

Vancouver:

Doolaard FP(. Deepification: Learning Variable Ordering Heuristics in Constraint Optimization Problems. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Jan 20]. Available from: http://resolver.tudelft.nl/uuid:fbab3fe2-e077-4d41-ace4-e434c25ce27f.

Council of Science Editors:

Doolaard FP(. Deepification: Learning Variable Ordering Heuristics in Constraint Optimization Problems. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:fbab3fe2-e077-4d41-ace4-e434c25ce27f


Texas A&M University

8. Yamamoto, Hiromichi. A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure.

Degree: MS, Industrial Engineering, 2018, Texas A&M University

 A new methodology to solve the capacitated facility location problem (CFLP) is presented. This optimization problem can be explicitly formulated and solved as a mixed… (more)

Subjects/Keywords: Capacitated Facility Location Problem; Heuristic; Linear Programming; Mixed Integer Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yamamoto, H. (2018). A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/173996

Chicago Manual of Style (16th Edition):

Yamamoto, Hiromichi. “A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure.” 2018. Masters Thesis, Texas A&M University. Accessed January 20, 2021. http://hdl.handle.net/1969.1/173996.

MLA Handbook (7th Edition):

Yamamoto, Hiromichi. “A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure.” 2018. Web. 20 Jan 2021.

Vancouver:

Yamamoto H. A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure. [Internet] [Masters thesis]. Texas A&M University; 2018. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1969.1/173996.

Council of Science Editors:

Yamamoto H. A Heuristic Algorithm for Solving Capacitated Facility Location Problems Using a Greedy-Based Iterative LP Relaxation Procedure. [Masters Thesis]. Texas A&M University; 2018. Available from: http://hdl.handle.net/1969.1/173996


Delft University of Technology

9. Pohl, Franz (author). Adaptive-Critic Designs For Aircraft Control: A comparative study between Heuristic Dynamic Programming and Dual Heuristic Programming.

Degree: 2017, Delft University of Technology

 The Variable Camber Continuous Trailing Edge Flap (VCCTEF) is a novel aircraft control system that intents to prevent undesired aeroelastic deflections by precise lift tailoring… (more)

Subjects/Keywords: Heuristic Dynamic Programming; Dual Heuristic Programming; Reinforcement Learning; Aircraft Control; adaptive control; Adaptive Critic Designs; ACD; HDP; DHP

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pohl, F. (. (2017). Adaptive-Critic Designs For Aircraft Control: A comparative study between Heuristic Dynamic Programming and Dual Heuristic Programming. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:a7f6db8c-8e03-4506-a0c5-cbfa4ece5d7a

Chicago Manual of Style (16th Edition):

Pohl, Franz (author). “Adaptive-Critic Designs For Aircraft Control: A comparative study between Heuristic Dynamic Programming and Dual Heuristic Programming.” 2017. Masters Thesis, Delft University of Technology. Accessed January 20, 2021. http://resolver.tudelft.nl/uuid:a7f6db8c-8e03-4506-a0c5-cbfa4ece5d7a.

MLA Handbook (7th Edition):

Pohl, Franz (author). “Adaptive-Critic Designs For Aircraft Control: A comparative study between Heuristic Dynamic Programming and Dual Heuristic Programming.” 2017. Web. 20 Jan 2021.

Vancouver:

Pohl F(. Adaptive-Critic Designs For Aircraft Control: A comparative study between Heuristic Dynamic Programming and Dual Heuristic Programming. [Internet] [Masters thesis]. Delft University of Technology; 2017. [cited 2021 Jan 20]. Available from: http://resolver.tudelft.nl/uuid:a7f6db8c-8e03-4506-a0c5-cbfa4ece5d7a.

Council of Science Editors:

Pohl F(. Adaptive-Critic Designs For Aircraft Control: A comparative study between Heuristic Dynamic Programming and Dual Heuristic Programming. [Masters Thesis]. Delft University of Technology; 2017. Available from: http://resolver.tudelft.nl/uuid:a7f6db8c-8e03-4506-a0c5-cbfa4ece5d7a


Ryerson University

10. Kabir, Latiful. Minimizing makespan of a flexible machine under tooling contraints.

Degree: 2011, Ryerson University

 Computer Number Control (CNC) milling and lathe machines are widely used in manufacturing due to their flexibility in producing parts with a wide variety of… (more)

Subjects/Keywords: Milling machines  – Numerical control; Milling machines  – Numerical control  – Programming; Dynamic programming; Heuristic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kabir, L. (2011). Minimizing makespan of a flexible machine under tooling contraints. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A1264

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Kabir, Latiful. “Minimizing makespan of a flexible machine under tooling contraints.” 2011. Thesis, Ryerson University. Accessed January 20, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A1264.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Kabir, Latiful. “Minimizing makespan of a flexible machine under tooling contraints.” 2011. Web. 20 Jan 2021.

Vancouver:

Kabir L. Minimizing makespan of a flexible machine under tooling contraints. [Internet] [Thesis]. Ryerson University; 2011. [cited 2021 Jan 20]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1264.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Kabir L. Minimizing makespan of a flexible machine under tooling contraints. [Thesis]. Ryerson University; 2011. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A1264

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Ryerson University

11. Nematullah, Mohammad. Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement.

Degree: 2005, Ryerson University

 Some of the most frequently used scheduling heuristics for resource constrained projects are Activity Time (ACTIM), Activity Resource (ACTRES) and Resource Over Time (ROT) which… (more)

Subjects/Keywords: Heuristic programming; Production scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Nematullah, M. (2005). Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A504

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Nematullah, Mohammad. “Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement.” 2005. Thesis, Ryerson University. Accessed January 20, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A504.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Nematullah, Mohammad. “Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement.” 2005. Web. 20 Jan 2021.

Vancouver:

Nematullah M. Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement. [Internet] [Thesis]. Ryerson University; 2005. [cited 2021 Jan 20]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A504.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Nematullah M. Extension of some project scheduling heuristics and their comparison at low and high levels of resource requirement. [Thesis]. Ryerson University; 2005. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A504

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Alberta

12. Romanycia, Marc Hector Joseph. The concept of heuristic as used in the artificial intelligence community.

Degree: MA, Department of Philosophy, 1983, University of Alberta

Subjects/Keywords: Artificial intelligence.; Heuristic programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Romanycia, M. H. J. (1983). The concept of heuristic as used in the artificial intelligence community. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/79408001x

Chicago Manual of Style (16th Edition):

Romanycia, Marc Hector Joseph. “The concept of heuristic as used in the artificial intelligence community.” 1983. Masters Thesis, University of Alberta. Accessed January 20, 2021. https://era.library.ualberta.ca/files/79408001x.

MLA Handbook (7th Edition):

Romanycia, Marc Hector Joseph. “The concept of heuristic as used in the artificial intelligence community.” 1983. Web. 20 Jan 2021.

Vancouver:

Romanycia MHJ. The concept of heuristic as used in the artificial intelligence community. [Internet] [Masters thesis]. University of Alberta; 1983. [cited 2021 Jan 20]. Available from: https://era.library.ualberta.ca/files/79408001x.

Council of Science Editors:

Romanycia MHJ. The concept of heuristic as used in the artificial intelligence community. [Masters Thesis]. University of Alberta; 1983. Available from: https://era.library.ualberta.ca/files/79408001x


Hong Kong University of Science and Technology

13. Lo, Frances Man Ching. Heuristic rules' performance in course timetable scheduling.

Degree: 1999, Hong Kong University of Science and Technology

 Course timetable construction is a tedious, repetitive and time-consuming task that every timetable scheduler has to face each academic period. The conjunction of a large… (more)

Subjects/Keywords: Heuristic programming ; Schedules, School

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lo, F. M. C. (1999). Heuristic rules' performance in course timetable scheduling. (Thesis). Hong Kong University of Science and Technology. Retrieved from http://repository.ust.hk/ir/Record/1783.1-4921 ; https://doi.org/10.14711/thesis-b651879 ; http://repository.ust.hk/ir/bitstream/1783.1-4921/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lo, Frances Man Ching. “Heuristic rules' performance in course timetable scheduling.” 1999. Thesis, Hong Kong University of Science and Technology. Accessed January 20, 2021. http://repository.ust.hk/ir/Record/1783.1-4921 ; https://doi.org/10.14711/thesis-b651879 ; http://repository.ust.hk/ir/bitstream/1783.1-4921/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lo, Frances Man Ching. “Heuristic rules' performance in course timetable scheduling.” 1999. Web. 20 Jan 2021.

Vancouver:

Lo FMC. Heuristic rules' performance in course timetable scheduling. [Internet] [Thesis]. Hong Kong University of Science and Technology; 1999. [cited 2021 Jan 20]. Available from: http://repository.ust.hk/ir/Record/1783.1-4921 ; https://doi.org/10.14711/thesis-b651879 ; http://repository.ust.hk/ir/bitstream/1783.1-4921/1/th_redirect.html.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lo FMC. Heuristic rules' performance in course timetable scheduling. [Thesis]. Hong Kong University of Science and Technology; 1999. Available from: http://repository.ust.hk/ir/Record/1783.1-4921 ; https://doi.org/10.14711/thesis-b651879 ; http://repository.ust.hk/ir/bitstream/1783.1-4921/1/th_redirect.html

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Toronto

14. Shateri, Mahsa. Resource Allocation and Risk Analysis of Dialysis Centres.

Degree: PhD, 2015, University of Toronto

 The number of hemodialysis patients is growing every year. The majority of these patients visit centres at least three times a week for their treatment.… (more)

Subjects/Keywords: Heuristic; Mixed Integer Programming; Optimization; Risk Analysis; Scheduling; Tabu Search; 0537

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shateri, M. (2015). Resource Allocation and Risk Analysis of Dialysis Centres. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/71616

Chicago Manual of Style (16th Edition):

Shateri, Mahsa. “Resource Allocation and Risk Analysis of Dialysis Centres.” 2015. Doctoral Dissertation, University of Toronto. Accessed January 20, 2021. http://hdl.handle.net/1807/71616.

MLA Handbook (7th Edition):

Shateri, Mahsa. “Resource Allocation and Risk Analysis of Dialysis Centres.” 2015. Web. 20 Jan 2021.

Vancouver:

Shateri M. Resource Allocation and Risk Analysis of Dialysis Centres. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1807/71616.

Council of Science Editors:

Shateri M. Resource Allocation and Risk Analysis of Dialysis Centres. [Doctoral Dissertation]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/71616


University of Melbourne

15. Williams, David Niranjan. Machine scheduling problems with setup times.

Degree: 1993, University of Melbourne

 In this thesis the problem of scheduling a single stage flowshop with setup times is analysed. All the jobs are assumed to be divided into… (more)

Subjects/Keywords: production scheduling; heuristic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Williams, D. N. (1993). Machine scheduling problems with setup times. (Masters Thesis). University of Melbourne. Retrieved from http://hdl.handle.net/11343/36982

Chicago Manual of Style (16th Edition):

Williams, David Niranjan. “Machine scheduling problems with setup times.” 1993. Masters Thesis, University of Melbourne. Accessed January 20, 2021. http://hdl.handle.net/11343/36982.

MLA Handbook (7th Edition):

Williams, David Niranjan. “Machine scheduling problems with setup times.” 1993. Web. 20 Jan 2021.

Vancouver:

Williams DN. Machine scheduling problems with setup times. [Internet] [Masters thesis]. University of Melbourne; 1993. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/11343/36982.

Council of Science Editors:

Williams DN. Machine scheduling problems with setup times. [Masters Thesis]. University of Melbourne; 1993. Available from: http://hdl.handle.net/11343/36982


Georgia Tech

16. Culver, William Daniel. Heuristic workforce scheduling.

Degree: MS, Industrial engineering, 1975, Georgia Tech

Subjects/Keywords: Production scheduling; Heuristic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Culver, W. D. (1975). Heuristic workforce scheduling. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/25489

Chicago Manual of Style (16th Edition):

Culver, William Daniel. “Heuristic workforce scheduling.” 1975. Masters Thesis, Georgia Tech. Accessed January 20, 2021. http://hdl.handle.net/1853/25489.

MLA Handbook (7th Edition):

Culver, William Daniel. “Heuristic workforce scheduling.” 1975. Web. 20 Jan 2021.

Vancouver:

Culver WD. Heuristic workforce scheduling. [Internet] [Masters thesis]. Georgia Tech; 1975. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/1853/25489.

Council of Science Editors:

Culver WD. Heuristic workforce scheduling. [Masters Thesis]. Georgia Tech; 1975. Available from: http://hdl.handle.net/1853/25489


Northeastern University

17. Karbeyaz, Ceyhun Efe. Optimized participant assignment for an online experimental framework.

Degree: PhD, Department of Electrical and Computer Engineering, 2015, Northeastern University

 Experimental research is being transformed from being based in physical laboratories centered in research universities into web-based experimental platforms. Our group has built a web-based… (more)

Subjects/Keywords: job scheduling; optimization; participant assignment; Heuristic algorithms; Computer algorithms; Dynamic programming; Linear programming; Integer programming; Scheduling; Mathematical models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Karbeyaz, C. E. (2015). Optimized participant assignment for an online experimental framework. (Doctoral Dissertation). Northeastern University. Retrieved from http://hdl.handle.net/2047/D20193938

Chicago Manual of Style (16th Edition):

Karbeyaz, Ceyhun Efe. “Optimized participant assignment for an online experimental framework.” 2015. Doctoral Dissertation, Northeastern University. Accessed January 20, 2021. http://hdl.handle.net/2047/D20193938.

MLA Handbook (7th Edition):

Karbeyaz, Ceyhun Efe. “Optimized participant assignment for an online experimental framework.” 2015. Web. 20 Jan 2021.

Vancouver:

Karbeyaz CE. Optimized participant assignment for an online experimental framework. [Internet] [Doctoral dissertation]. Northeastern University; 2015. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/2047/D20193938.

Council of Science Editors:

Karbeyaz CE. Optimized participant assignment for an online experimental framework. [Doctoral Dissertation]. Northeastern University; 2015. Available from: http://hdl.handle.net/2047/D20193938


Anna University

18. Malairajan, R A. Models and heuristics for a class of resource allocation problems in supply chain; -.

Degree: Mechanical Engineering, 2014, Anna University

Resource Allocation involves the distribution and utilization of available resources in the system Because resource availability is usually scarce and expensive it becomes important to… (more)

Subjects/Keywords: Genetic Algorithms; Heuristic; Mathematical programming model; Mechanical engineering; Meta heuristic; Resource allocation problems; Simulated Annealing; Simulated Modeling; Supply chain

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Malairajan, R. A. (2014). Models and heuristics for a class of resource allocation problems in supply chain; -. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/25345

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Malairajan, R A. “Models and heuristics for a class of resource allocation problems in supply chain; -.” 2014. Thesis, Anna University. Accessed January 20, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/25345.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Malairajan, R A. “Models and heuristics for a class of resource allocation problems in supply chain; -.” 2014. Web. 20 Jan 2021.

Vancouver:

Malairajan RA. Models and heuristics for a class of resource allocation problems in supply chain; -. [Internet] [Thesis]. Anna University; 2014. [cited 2021 Jan 20]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/25345.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Malairajan RA. Models and heuristics for a class of resource allocation problems in supply chain; -. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/25345

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


NSYSU

19. Chan, Huang-Ting. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.

Degree: Master, Computer Science and Engineering, 2016, NSYSU

 The traditional longest common subsequence (LCS) problem is to find the maximum number of ordered matches in two sequences. The similarity of two one-dimensional sequences… (more)

Subjects/Keywords: Longest Common Subsequence; Similarity; NP-hard; Matrices; Integer Linear Programming; Heuristic Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chan, H. (2016). The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chan, Huang-Ting. “The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.” 2016. Thesis, NSYSU. Accessed January 20, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chan, Huang-Ting. “The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems.” 2016. Web. 20 Jan 2021.

Vancouver:

Chan H. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. [Internet] [Thesis]. NSYSU; 2016. [cited 2021 Jan 20]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chan H. The Definitions and Computation of the Two Dimensional Largest Common Substructure Problems. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0031116-004017

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Ryerson University

20. Batusov, Vitaliy. Deterministic planning in incompletely known domains with local effects.

Degree: 2014, Ryerson University

 Conformant planning has been traditionally studied in the form of classical planning extended with a mechanism for expressing unknown facts and/or disjunctive knowledge. Despite a… (more)

Subjects/Keywords: Planning  – Mathematical models; Problem solving  – Mathematical models; Artificial intelligence; Computer algorithms; Heuristic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Batusov, V. (2014). Deterministic planning in incompletely known domains with local effects. (Thesis). Ryerson University. Retrieved from https://digital.library.ryerson.ca/islandora/object/RULA%3A3282

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Batusov, Vitaliy. “Deterministic planning in incompletely known domains with local effects.” 2014. Thesis, Ryerson University. Accessed January 20, 2021. https://digital.library.ryerson.ca/islandora/object/RULA%3A3282.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Batusov, Vitaliy. “Deterministic planning in incompletely known domains with local effects.” 2014. Web. 20 Jan 2021.

Vancouver:

Batusov V. Deterministic planning in incompletely known domains with local effects. [Internet] [Thesis]. Ryerson University; 2014. [cited 2021 Jan 20]. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A3282.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Batusov V. Deterministic planning in incompletely known domains with local effects. [Thesis]. Ryerson University; 2014. Available from: https://digital.library.ryerson.ca/islandora/object/RULA%3A3282

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

21. Caetano, Daniel Jorge. Modelagem integrada para a programação de voos e a alocação de frotas: abordagens baseadas em programação linear inteira e na meta-heurística colônia de formigas.

Degree: PhD, Engenharia de Transportes, 2011, University of São Paulo

Este trabalho propõe modelos matemáticos e heurísticas para a definição da malha de voos de uma empresa aérea, como parte de seu planejamento operacional, visando… (more)

Subjects/Keywords: Air transport; Heuristic; Heurística; Linear programming; Operations research; Pesquisa operacional; Programação linear; Transporte aéreo

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Caetano, D. J. (2011). Modelagem integrada para a programação de voos e a alocação de frotas: abordagens baseadas em programação linear inteira e na meta-heurística colônia de formigas. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3138/tde-29082011-112817/ ;

Chicago Manual of Style (16th Edition):

Caetano, Daniel Jorge. “Modelagem integrada para a programação de voos e a alocação de frotas: abordagens baseadas em programação linear inteira e na meta-heurística colônia de formigas.” 2011. Doctoral Dissertation, University of São Paulo. Accessed January 20, 2021. http://www.teses.usp.br/teses/disponiveis/3/3138/tde-29082011-112817/ ;.

MLA Handbook (7th Edition):

Caetano, Daniel Jorge. “Modelagem integrada para a programação de voos e a alocação de frotas: abordagens baseadas em programação linear inteira e na meta-heurística colônia de formigas.” 2011. Web. 20 Jan 2021.

Vancouver:

Caetano DJ. Modelagem integrada para a programação de voos e a alocação de frotas: abordagens baseadas em programação linear inteira e na meta-heurística colônia de formigas. [Internet] [Doctoral dissertation]. University of São Paulo; 2011. [cited 2021 Jan 20]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3138/tde-29082011-112817/ ;.

Council of Science Editors:

Caetano DJ. Modelagem integrada para a programação de voos e a alocação de frotas: abordagens baseadas em programação linear inteira e na meta-heurística colônia de formigas. [Doctoral Dissertation]. University of São Paulo; 2011. Available from: http://www.teses.usp.br/teses/disponiveis/3/3138/tde-29082011-112817/ ;

22. Ahmad, Qazi Shoeb. Heuristic procedures for solving some integer and sequencing problems;.

Degree: Statistics and Operations Research, 2000, Aligarh Muslim University

Abstract not available newline newline

Bibliography p. i-ix

Advisors/Committee Members: Bari, Abdul.

Subjects/Keywords: Heuristic; Integer; Sequencing; Linear Programming; Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ahmad, Q. S. (2000). Heuristic procedures for solving some integer and sequencing problems;. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/50016

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ahmad, Qazi Shoeb. “Heuristic procedures for solving some integer and sequencing problems;.” 2000. Thesis, Aligarh Muslim University. Accessed January 20, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/50016.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ahmad, Qazi Shoeb. “Heuristic procedures for solving some integer and sequencing problems;.” 2000. Web. 20 Jan 2021.

Vancouver:

Ahmad QS. Heuristic procedures for solving some integer and sequencing problems;. [Internet] [Thesis]. Aligarh Muslim University; 2000. [cited 2021 Jan 20]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/50016.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmad QS. Heuristic procedures for solving some integer and sequencing problems;. [Thesis]. Aligarh Muslim University; 2000. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/50016

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Penn State University

23. Rajendran, Suchithra. Platelet Inventory Management in Blood Supply Chains.

Degree: 2017, Penn State University

 It has been shown that a significant amount of platelets is wasted due to their short life after collection, just 5 days. Most of the… (more)

Subjects/Keywords: Platelet wastage; stochastic integer programming; heuristic ordering policies; blood supply chain; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rajendran, S. (2017). Platelet Inventory Management in Blood Supply Chains. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/14249sur205

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rajendran, Suchithra. “Platelet Inventory Management in Blood Supply Chains.” 2017. Thesis, Penn State University. Accessed January 20, 2021. https://submit-etda.libraries.psu.edu/catalog/14249sur205.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rajendran, Suchithra. “Platelet Inventory Management in Blood Supply Chains.” 2017. Web. 20 Jan 2021.

Vancouver:

Rajendran S. Platelet Inventory Management in Blood Supply Chains. [Internet] [Thesis]. Penn State University; 2017. [cited 2021 Jan 20]. Available from: https://submit-etda.libraries.psu.edu/catalog/14249sur205.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rajendran S. Platelet Inventory Management in Blood Supply Chains. [Thesis]. Penn State University; 2017. Available from: https://submit-etda.libraries.psu.edu/catalog/14249sur205

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

24. Jacquemin, Yoan. Optimisation de la trajectoire du patient dans les centres de radiothérapie ou d'hadronthérapie : Care-Trajectory optimization in radiotherapy and hadrontherapy facilities.

Degree: Docteur es, Génie industriel, 2011, Saint-Etienne

L’optimisation de la planification des traitements par rayons ionisants est bénéfique tant aux patients qu’aux structures de soins bien que particulièrement difficile du fait de… (more)

Subjects/Keywords: Planification; Optimisation; PLNE; Heuristique; Radiothérapie; Hadronthérapie; Hôpital; Scheduling; Optimization; Linear programming; Heuristic; Radiotherapy; Hadrontherapy; Healthcare

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jacquemin, Y. (2011). Optimisation de la trajectoire du patient dans les centres de radiothérapie ou d'hadronthérapie : Care-Trajectory optimization in radiotherapy and hadrontherapy facilities. (Doctoral Dissertation). Saint-Etienne. Retrieved from http://www.theses.fr/2011STET4026

Chicago Manual of Style (16th Edition):

Jacquemin, Yoan. “Optimisation de la trajectoire du patient dans les centres de radiothérapie ou d'hadronthérapie : Care-Trajectory optimization in radiotherapy and hadrontherapy facilities.” 2011. Doctoral Dissertation, Saint-Etienne. Accessed January 20, 2021. http://www.theses.fr/2011STET4026.

MLA Handbook (7th Edition):

Jacquemin, Yoan. “Optimisation de la trajectoire du patient dans les centres de radiothérapie ou d'hadronthérapie : Care-Trajectory optimization in radiotherapy and hadrontherapy facilities.” 2011. Web. 20 Jan 2021.

Vancouver:

Jacquemin Y. Optimisation de la trajectoire du patient dans les centres de radiothérapie ou d'hadronthérapie : Care-Trajectory optimization in radiotherapy and hadrontherapy facilities. [Internet] [Doctoral dissertation]. Saint-Etienne; 2011. [cited 2021 Jan 20]. Available from: http://www.theses.fr/2011STET4026.

Council of Science Editors:

Jacquemin Y. Optimisation de la trajectoire du patient dans les centres de radiothérapie ou d'hadronthérapie : Care-Trajectory optimization in radiotherapy and hadrontherapy facilities. [Doctoral Dissertation]. Saint-Etienne; 2011. Available from: http://www.theses.fr/2011STET4026

25. Lundquist, Josefin. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.

Degree: Mathematics and Mathematical Statistics, 2017, Umeå University

  A key challenge for manufacturing companies is to store parts in an efficient way atthe lowest cost possible. As the demand of differentiated products… (more)

Subjects/Keywords: Inventory optimization; Integer programming; Generalized assignment problem; Combinatorial optimization; Greedy heuristic; Constructive algorithm; Mathematics; Matematik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lundquist, J. (2017). An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. (Thesis). Umeå University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Thesis, Umeå University. Accessed January 20, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lundquist, Josefin. “An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB.” 2017. Web. 20 Jan 2021.

Vancouver:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Internet] [Thesis]. Umeå University; 2017. [cited 2021 Jan 20]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lundquist J. An optimization model using the Assignment Problem to manage the location of parts : Master Thesis at the engine assembly at Scania CV AB. [Thesis]. Umeå University; 2017. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:umu:diva-137825

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Iowa

26. Zhang, Shu. Stochastic orienteering on a network of queues with time windows.

Degree: PhD, Business Administration, 2015, University of Iowa

  Motivated by the management of sales representatives who visit customers to develop customer relationships, we present a stochastic orienteering problem on a network of… (more)

Subjects/Keywords: publicabstract; Dynamic Programming; Heuristic; Orienteering Problem; Queueing; Time Window; Business Administration, Management, and Operations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhang, S. (2015). Stochastic orienteering on a network of queues with time windows. (Doctoral Dissertation). University of Iowa. Retrieved from https://ir.uiowa.edu/etd/1944

Chicago Manual of Style (16th Edition):

Zhang, Shu. “Stochastic orienteering on a network of queues with time windows.” 2015. Doctoral Dissertation, University of Iowa. Accessed January 20, 2021. https://ir.uiowa.edu/etd/1944.

MLA Handbook (7th Edition):

Zhang, Shu. “Stochastic orienteering on a network of queues with time windows.” 2015. Web. 20 Jan 2021.

Vancouver:

Zhang S. Stochastic orienteering on a network of queues with time windows. [Internet] [Doctoral dissertation]. University of Iowa; 2015. [cited 2021 Jan 20]. Available from: https://ir.uiowa.edu/etd/1944.

Council of Science Editors:

Zhang S. Stochastic orienteering on a network of queues with time windows. [Doctoral Dissertation]. University of Iowa; 2015. Available from: https://ir.uiowa.edu/etd/1944


University of Arizona

27. Rushall, David Aaron, 1964-. Efficient heuristics for collision avoidance in three dimensions .

Degree: 1989, University of Arizona

 This thesis represents a relatively new aspect of computing with regard to robotics. The need for fast, efficient collision avoidance algorithms is growing rapidly. Because… (more)

Subjects/Keywords: Heuristic programming.; Algorithms.; Artificial intelligence.; Robotics.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rushall, David Aaron, 1. (1989). Efficient heuristics for collision avoidance in three dimensions . (Masters Thesis). University of Arizona. Retrieved from http://hdl.handle.net/10150/277041

Chicago Manual of Style (16th Edition):

Rushall, David Aaron, 1964-. “Efficient heuristics for collision avoidance in three dimensions .” 1989. Masters Thesis, University of Arizona. Accessed January 20, 2021. http://hdl.handle.net/10150/277041.

MLA Handbook (7th Edition):

Rushall, David Aaron, 1964-. “Efficient heuristics for collision avoidance in three dimensions .” 1989. Web. 20 Jan 2021.

Vancouver:

Rushall, David Aaron 1. Efficient heuristics for collision avoidance in three dimensions . [Internet] [Masters thesis]. University of Arizona; 1989. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10150/277041.

Council of Science Editors:

Rushall, David Aaron 1. Efficient heuristics for collision avoidance in three dimensions . [Masters Thesis]. University of Arizona; 1989. Available from: http://hdl.handle.net/10150/277041


University of Hong Kong

28. Lü, Haili. A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics.

Degree: 2011, University of Hong Kong

Subjects/Keywords: Genetic algorithms.; Heuristic programming.; Production scheduling.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lü, H. (2011). A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics. (Thesis). University of Hong Kong. Retrieved from http://hdl.handle.net/10722/144793

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Lü, Haili. “A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics.” 2011. Thesis, University of Hong Kong. Accessed January 20, 2021. http://hdl.handle.net/10722/144793.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Lü, Haili. “A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics.” 2011. Web. 20 Jan 2021.

Vancouver:

Lü H. A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics. [Internet] [Thesis]. University of Hong Kong; 2011. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10722/144793.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Lü H. A comparative study of assembly job shop scheduling using simulation, heuristics and meta-heuristics. [Thesis]. University of Hong Kong; 2011. Available from: http://hdl.handle.net/10722/144793

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Virginia Tech

29. Lavinus, Joseph W. Heuristics for laying out information graphs.

Degree: MS, Computer Science and Applications, 1992, Virginia Tech

  The representation of information in modern database systems is complicated by the need to represent relationships among pieces of information. A natural representation for… (more)

Subjects/Keywords: Heuristic programming; LD5655.V855 1992.L385

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lavinus, J. W. (1992). Heuristics for laying out information graphs. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/46440

Chicago Manual of Style (16th Edition):

Lavinus, Joseph W. “Heuristics for laying out information graphs.” 1992. Masters Thesis, Virginia Tech. Accessed January 20, 2021. http://hdl.handle.net/10919/46440.

MLA Handbook (7th Edition):

Lavinus, Joseph W. “Heuristics for laying out information graphs.” 1992. Web. 20 Jan 2021.

Vancouver:

Lavinus JW. Heuristics for laying out information graphs. [Internet] [Masters thesis]. Virginia Tech; 1992. [cited 2021 Jan 20]. Available from: http://hdl.handle.net/10919/46440.

Council of Science Editors:

Lavinus JW. Heuristics for laying out information graphs. [Masters Thesis]. Virginia Tech; 1992. Available from: http://hdl.handle.net/10919/46440


Texas State University – San Marcos

30. Lowell, Daniel I. Software Cache in Global Heuristic Searches.

Degree: MS, Computer Science, 2010, Texas State University – San Marcos

No abstract prepared. Advisors/Committee Members: Tamir, Dan (committee member), Novoa, Clara (committee member), Holt, Jim (committee member), Kaikhah, Khosrow (committee member).

Subjects/Keywords: Cache memory; Heuristic programming; Genetic algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Lowell, D. I. (2010). Software Cache in Global Heuristic Searches. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/11877

Chicago Manual of Style (16th Edition):

Lowell, Daniel I. “Software Cache in Global Heuristic Searches.” 2010. Masters Thesis, Texas State University – San Marcos. Accessed January 20, 2021. https://digital.library.txstate.edu/handle/10877/11877.

MLA Handbook (7th Edition):

Lowell, Daniel I. “Software Cache in Global Heuristic Searches.” 2010. Web. 20 Jan 2021.

Vancouver:

Lowell DI. Software Cache in Global Heuristic Searches. [Internet] [Masters thesis]. Texas State University – San Marcos; 2010. [cited 2021 Jan 20]. Available from: https://digital.library.txstate.edu/handle/10877/11877.

Council of Science Editors:

Lowell DI. Software Cache in Global Heuristic Searches. [Masters Thesis]. Texas State University – San Marcos; 2010. Available from: https://digital.library.txstate.edu/handle/10877/11877

[1] [2] [3] [4] [5] [6] [7]

.