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

University: Virginia Tech

You searched for subject:( Heuristic). Showing records 1 – 17 of 17 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Virginia Tech

1. Neas, Charles Bennett. A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles.

Degree: MS, Aerospace and Ocean Engineering, 2010, Virginia Tech

 This thesis presents a greedy search algorithm for maneuver-based motion planning of agile vehicles. In maneuver-based motion planning, vehicle maneuvers are solved offline and saved… (more)

Subjects/Keywords: Motion Primitives; A*; Motion Planning; Heuristic Search

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Neas, C. B. (2010). A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/36213

Chicago Manual of Style (16th Edition):

Neas, Charles Bennett. “A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles.” 2010. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/36213.

MLA Handbook (7th Edition):

Neas, Charles Bennett. “A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles.” 2010. Web. 24 Oct 2019.

Vancouver:

Neas CB. A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles. [Internet] [Masters thesis]. Virginia Tech; 2010. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/36213.

Council of Science Editors:

Neas CB. A Greedy Search Algorithm for Maneuver-Based Motion Planning of Agile Vehicles. [Masters Thesis]. Virginia Tech; 2010. Available from: http://hdl.handle.net/10919/36213


Virginia Tech

2. Oremland, Matthew Scott. Techniques for mathematical analysis and optimization of agent-based models.

Degree: PhD, Mathematics, 2014, Virginia Tech

 Agent-based models are computer simulations in which entities (agents) interact with each other and their environment according to local update rules. Local interactions give rise… (more)

Subjects/Keywords: Agent-based modeling; optimization; heuristic algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oremland, M. S. (2014). Techniques for mathematical analysis and optimization of agent-based models. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/25138

Chicago Manual of Style (16th Edition):

Oremland, Matthew Scott. “Techniques for mathematical analysis and optimization of agent-based models.” 2014. Doctoral Dissertation, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/25138.

MLA Handbook (7th Edition):

Oremland, Matthew Scott. “Techniques for mathematical analysis and optimization of agent-based models.” 2014. Web. 24 Oct 2019.

Vancouver:

Oremland MS. Techniques for mathematical analysis and optimization of agent-based models. [Internet] [Doctoral dissertation]. Virginia Tech; 2014. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/25138.

Council of Science Editors:

Oremland MS. Techniques for mathematical analysis and optimization of agent-based models. [Doctoral Dissertation]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/25138


Virginia Tech

3. Mistele, Jean May. Exploring Middle School Students' Heuristic Thinking about Probability.

Degree: PhD, Curriculum and Instruction, 2014, Virginia Tech

 This descriptive qualitative study examines six eighth-grade students' thinking while solving probability problems. This study aimed to gather direct information on students' problem solving processes… (more)

Subjects/Keywords: probability; heuristic and biases; middle school students

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mistele, J. M. (2014). Exploring Middle School Students' Heuristic Thinking about Probability. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/47918

Chicago Manual of Style (16th Edition):

Mistele, Jean May. “Exploring Middle School Students' Heuristic Thinking about Probability.” 2014. Doctoral Dissertation, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/47918.

MLA Handbook (7th Edition):

Mistele, Jean May. “Exploring Middle School Students' Heuristic Thinking about Probability.” 2014. Web. 24 Oct 2019.

Vancouver:

Mistele JM. Exploring Middle School Students' Heuristic Thinking about Probability. [Internet] [Doctoral dissertation]. Virginia Tech; 2014. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/47918.

Council of Science Editors:

Mistele JM. Exploring Middle School Students' Heuristic Thinking about Probability. [Doctoral Dissertation]. Virginia Tech; 2014. Available from: http://hdl.handle.net/10919/47918


Virginia Tech

4. Feng, Yazhe. Distribution Planning for Rail and Truck Freight Transportation Systems.

Degree: PhD, Industrial and Systems Engineering, 2012, Virginia Tech

 Rail and truck freight transportation systems provide vital logistics services today. Rail systems are generally used to transport heavy and bulky commodities over long distances,… (more)

Subjects/Keywords: Transportation; Railroad Trip Planning; Heuristic; Industrial Gas Distribution; Fleet Planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feng, Y. (2012). Distribution Planning for Rail and Truck Freight Transportation Systems. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77140

Chicago Manual of Style (16th Edition):

Feng, Yazhe. “Distribution Planning for Rail and Truck Freight Transportation Systems.” 2012. Doctoral Dissertation, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/77140.

MLA Handbook (7th Edition):

Feng, Yazhe. “Distribution Planning for Rail and Truck Freight Transportation Systems.” 2012. Web. 24 Oct 2019.

Vancouver:

Feng Y. Distribution Planning for Rail and Truck Freight Transportation Systems. [Internet] [Doctoral dissertation]. Virginia Tech; 2012. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/77140.

Council of Science Editors:

Feng Y. Distribution Planning for Rail and Truck Freight Transportation Systems. [Doctoral Dissertation]. Virginia Tech; 2012. Available from: http://hdl.handle.net/10919/77140


Virginia Tech

5. 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 October 24, 2019. http://hdl.handle.net/10919/46440.

MLA Handbook (7th Edition):

Lavinus, Joseph W. “Heuristics for laying out information graphs.” 1992. Web. 24 Oct 2019.

Vancouver:

Lavinus JW. Heuristics for laying out information graphs. [Internet] [Masters thesis]. Virginia Tech; 1992. [cited 2019 Oct 24]. 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


Virginia Tech

6. Lu, Yufeng. Scheduling of Wafer Test Processes in Semiconductor Manufacturing.

Degree: MS, Industrial and Systems Engineering, 1997, Virginia Tech

 Scheduling is one of the most important issues in the planning of manufacturing systems. This research focuses on solving the test scheduling problem which arises… (more)

Subjects/Keywords: wafer test scheduling; heuristic; semiconductor test

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, Y. (1997). Scheduling of Wafer Test Processes in Semiconductor Manufacturing. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/10153

Chicago Manual of Style (16th Edition):

Lu, Yufeng. “Scheduling of Wafer Test Processes in Semiconductor Manufacturing.” 1997. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/10153.

MLA Handbook (7th Edition):

Lu, Yufeng. “Scheduling of Wafer Test Processes in Semiconductor Manufacturing.” 1997. Web. 24 Oct 2019.

Vancouver:

Lu Y. Scheduling of Wafer Test Processes in Semiconductor Manufacturing. [Internet] [Masters thesis]. Virginia Tech; 1997. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/10153.

Council of Science Editors:

Lu Y. Scheduling of Wafer Test Processes in Semiconductor Manufacturing. [Masters Thesis]. Virginia Tech; 1997. Available from: http://hdl.handle.net/10919/10153


Virginia Tech

7. Swartz, Kent Olen. Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics.

Degree: MS, Computer Science, 2003, Virginia Tech

  Developing economical yet effective methods of incorporating usability engineering as an integral part of software engineering is a primary focus of human-computer interaction (HCI)… (more)

Subjects/Keywords: Formative Evaluation; Virtual Environments; Heuristic Evaluation; Usability Engineering Methodology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Swartz, K. O. (2003). Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/34890

Chicago Manual of Style (16th Edition):

Swartz, Kent Olen. “Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics.” 2003. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/34890.

MLA Handbook (7th Edition):

Swartz, Kent Olen. “Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics.” 2003. Web. 24 Oct 2019.

Vancouver:

Swartz KO. Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics. [Internet] [Masters thesis]. Virginia Tech; 2003. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/34890.

Council of Science Editors:

Swartz KO. Virtual Environment Usability Assessment Methods Based on a Framework of Usability Characteristics. [Masters Thesis]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/34890


Virginia Tech

8. Oremland, Matthew Scott. Optimization and Optimal Control of Agent-Based Models.

Degree: MS, Mathematics, 2011, Virginia Tech

 Agent-based models are computer models made up of agents that can exist in a finite number of states. The state of the system at any… (more)

Subjects/Keywords: optimization; optimal control; individual-based model; polynomial dynamical system; agent-based model; bioinformatics; heuristic algorithm; discrete model; systems biology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Oremland, M. S. (2011). Optimization and Optimal Control of Agent-Based Models. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78119

Chicago Manual of Style (16th Edition):

Oremland, Matthew Scott. “Optimization and Optimal Control of Agent-Based Models.” 2011. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/78119.

MLA Handbook (7th Edition):

Oremland, Matthew Scott. “Optimization and Optimal Control of Agent-Based Models.” 2011. Web. 24 Oct 2019.

Vancouver:

Oremland MS. Optimization and Optimal Control of Agent-Based Models. [Internet] [Masters thesis]. Virginia Tech; 2011. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/78119.

Council of Science Editors:

Oremland MS. Optimization and Optimal Control of Agent-Based Models. [Masters Thesis]. Virginia Tech; 2011. Available from: http://hdl.handle.net/10919/78119


Virginia Tech

9. Durak, Tolga. Design and Testing of an Adult Age-Independent Online Needs Assessment Tool and Development of Adult Age-Independent Design Guidelines.

Degree: MS, Industrial and Systems Engineering, 2003, Virginia Tech

 This thesis addressed the following research activities: (1) Developing and evaluating the usability of an adult age-independent online assessment tool that includes health care related… (more)

Subjects/Keywords: Online Needs Assessment; Design Guidelines; Adult Age-Independent; Prototype Heuristic Evaluation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Durak, T. (2003). Design and Testing of an Adult Age-Independent Online Needs Assessment Tool and Development of Adult Age-Independent Design Guidelines. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/33623

Chicago Manual of Style (16th Edition):

Durak, Tolga. “Design and Testing of an Adult Age-Independent Online Needs Assessment Tool and Development of Adult Age-Independent Design Guidelines.” 2003. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/33623.

MLA Handbook (7th Edition):

Durak, Tolga. “Design and Testing of an Adult Age-Independent Online Needs Assessment Tool and Development of Adult Age-Independent Design Guidelines.” 2003. Web. 24 Oct 2019.

Vancouver:

Durak T. Design and Testing of an Adult Age-Independent Online Needs Assessment Tool and Development of Adult Age-Independent Design Guidelines. [Internet] [Masters thesis]. Virginia Tech; 2003. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/33623.

Council of Science Editors:

Durak T. Design and Testing of an Adult Age-Independent Online Needs Assessment Tool and Development of Adult Age-Independent Design Guidelines. [Masters Thesis]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/33623


Virginia Tech

10. Barclay, Daniel Scott. An automatic test generation method for chip-level circuit descriptions.

Degree: MS, Electrical Engineering, 1987, Virginia Tech

Subjects/Keywords: LD5655.V855 1987.B371; Artificial intelligence; Electric circuit analysis; Heuristic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Barclay, D. S. (1987). An automatic test generation method for chip-level circuit descriptions. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/91158

Chicago Manual of Style (16th Edition):

Barclay, Daniel Scott. “An automatic test generation method for chip-level circuit descriptions.” 1987. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/91158.

MLA Handbook (7th Edition):

Barclay, Daniel Scott. “An automatic test generation method for chip-level circuit descriptions.” 1987. Web. 24 Oct 2019.

Vancouver:

Barclay DS. An automatic test generation method for chip-level circuit descriptions. [Internet] [Masters thesis]. Virginia Tech; 1987. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/91158.

Council of Science Editors:

Barclay DS. An automatic test generation method for chip-level circuit descriptions. [Masters Thesis]. Virginia Tech; 1987. Available from: http://hdl.handle.net/10919/91158


Virginia Tech

11. Devarasetty, Ravi Kiran. Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems.

Degree: MS, Electrical and Computer Engineering, 2001, Virginia Tech

 Dynamic real-time distributed systems are characterized by significant run-time uncertainties at the mission and system levels. Typically, processing and communication latencies in such systems do… (more)

Subjects/Keywords: Adaptive Resource Management; Prediction-based algorithms; Distributed Real-time Systems; Heuristic-based algorithms; Dynamic Real-time Systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Devarasetty, R. K. (2001). Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/31219

Chicago Manual of Style (16th Edition):

Devarasetty, Ravi Kiran. “Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems.” 2001. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/31219.

MLA Handbook (7th Edition):

Devarasetty, Ravi Kiran. “Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems.” 2001. Web. 24 Oct 2019.

Vancouver:

Devarasetty RK. Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems. [Internet] [Masters thesis]. Virginia Tech; 2001. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/31219.

Council of Science Editors:

Devarasetty RK. Heuristic Algorithms for Adaptive Resource Management of Periodic Tasks in Soft Real-Time Distributed Systems. [Masters Thesis]. Virginia Tech; 2001. Available from: http://hdl.handle.net/10919/31219


Virginia Tech

12. Varadarajan, Amrusha. Stochastic Scheduling for a Network of MEMS Job Shops.

Degree: PhD, Industrial and Systems Engineering, 2006, Virginia Tech

 This work is motivated by the pressing need for operational control in the fabrication of Microelectromechanical systems or MEMS. MEMS are miniature three-dimensional integrated electromechanical… (more)

Subjects/Keywords: L-shaped Method; Heuristic; Stochastic Programming; Dynamic Scheduling; Deadlock prevention; Feasibility Cuts; Reentrant Flow

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Varadarajan, A. (2006). Stochastic Scheduling for a Network of MEMS Job Shops. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77038

Chicago Manual of Style (16th Edition):

Varadarajan, Amrusha. “Stochastic Scheduling for a Network of MEMS Job Shops.” 2006. Doctoral Dissertation, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/77038.

MLA Handbook (7th Edition):

Varadarajan, Amrusha. “Stochastic Scheduling for a Network of MEMS Job Shops.” 2006. Web. 24 Oct 2019.

Vancouver:

Varadarajan A. Stochastic Scheduling for a Network of MEMS Job Shops. [Internet] [Doctoral dissertation]. Virginia Tech; 2006. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/77038.

Council of Science Editors:

Varadarajan A. Stochastic Scheduling for a Network of MEMS Job Shops. [Doctoral Dissertation]. Virginia Tech; 2006. Available from: http://hdl.handle.net/10919/77038


Virginia Tech

13. Simonneau, Nicolas. Hybrid flow shop scheduling with prescription constraints on jobs.

Degree: MS, Industrial and Systems Engineering, 2003, Virginia Tech

 The sponsor of the thesis is the Composite Unit of AIRBUS Nantes plant, which manufactures aircraft composite. The basic process to manufacture composite parts is… (more)

Subjects/Keywords: Aerospace Industry; Heuristic Software; Optimization; Integer Programming Software; Prescription Constraints; Two-stage Hybrid Flow Shop

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Simonneau, N. (2003). Hybrid flow shop scheduling with prescription constraints on jobs. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/9659

Chicago Manual of Style (16th Edition):

Simonneau, Nicolas. “Hybrid flow shop scheduling with prescription constraints on jobs.” 2003. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/9659.

MLA Handbook (7th Edition):

Simonneau, Nicolas. “Hybrid flow shop scheduling with prescription constraints on jobs.” 2003. Web. 24 Oct 2019.

Vancouver:

Simonneau N. Hybrid flow shop scheduling with prescription constraints on jobs. [Internet] [Masters thesis]. Virginia Tech; 2003. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/9659.

Council of Science Editors:

Simonneau N. Hybrid flow shop scheduling with prescription constraints on jobs. [Masters Thesis]. Virginia Tech; 2003. Available from: http://hdl.handle.net/10919/9659


Virginia Tech

14. Palekar, Nipun Pushpasheel. Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking.

Degree: MS, Industrial and Systems Engineering, 2000, Virginia Tech

 A CONWIP (Constant Work-In-Progress) system is basically a hybrid system with a PUSH-PULL interface at the first machine in the line. This research addresses the… (more)

Subjects/Keywords: Serial Manufacturing System; Queuing theory applied to Flow shop with blocking; Flow Shop Scheduling; CONWIP; Mean Value Analysis; Flow shop with blocking; Blocking; Sequencing and Scheduling; Fast Insertion Heuristic; Scheduling Epochs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Palekar, N. P. (2000). Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/34997

Chicago Manual of Style (16th Edition):

Palekar, Nipun Pushpasheel. “Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking.” 2000. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/34997.

MLA Handbook (7th Edition):

Palekar, Nipun Pushpasheel. “Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking.” 2000. Web. 24 Oct 2019.

Vancouver:

Palekar NP. Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking. [Internet] [Masters thesis]. Virginia Tech; 2000. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/34997.

Council of Science Editors:

Palekar NP. Job Sequencing & WIP level determination in a cyclic CONWIP Flowshop with Blocking. [Masters Thesis]. Virginia Tech; 2000. Available from: http://hdl.handle.net/10919/34997


Virginia Tech

15. Kim, Seon Ki. Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem.

Degree: PhD, Industrial and Systems Engineering, 2009, Virginia Tech

 The work presented in this dissertation has been focused on exploiting the branch-and-price (BNP) method for the solution of various stochastic mixed integer programming problems… (more)

Subjects/Keywords: Stochastic Hospital Staff Scheduling Problem; Hospital Staff Scheduling Problem; Dual Stabilization Technique; Stochastic Short-Term Personnel Planning Problem; Greedy Heuristic; Stochastic Generalized Assignment Problem; Branch-and-Cut Method; Branch-and-Price Method; Monte Carlo Method; Stochastic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kim, S. K. (2009). Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/37487

Chicago Manual of Style (16th Edition):

Kim, Seon Ki. “Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem.” 2009. Doctoral Dissertation, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/37487.

MLA Handbook (7th Edition):

Kim, Seon Ki. “Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem.” 2009. Web. 24 Oct 2019.

Vancouver:

Kim SK. Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem. [Internet] [Doctoral dissertation]. Virginia Tech; 2009. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/37487.

Council of Science Editors:

Kim SK. Branch-and-Price Method for Stochastic Generalized Assignment Problem, Hospital Staff Scheduling Problem and Stochastic Short-Term Personnel Planning Problem. [Doctoral Dissertation]. Virginia Tech; 2009. Available from: http://hdl.handle.net/10919/37487


Virginia Tech

16. Reller, Susan R. Reliability diagnostic strategies for series systems under imperfect testing.

Degree: MS, Industrial Engineering and Operations Research, 1987, Virginia Tech

 An expected cost model was developed for failure detection in series systems under imperfect testing. Type I and type II error probabilities are included and… (more)

Subjects/Keywords: and guidelines for selecting the starting solution; the algorithm appears to ybe globally convergent.; a heuristic was developed to construct the cost mi; and noâ defect-found outcomes. Based on the model; false positive termination; Mathematical modelsAn expected cost model was deve; LD5655.V855 1987.R448

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Reller, S. R. (1987). Reliability diagnostic strategies for series systems under imperfect testing. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/45926

Chicago Manual of Style (16th Edition):

Reller, Susan R. “Reliability diagnostic strategies for series systems under imperfect testing.” 1987. Masters Thesis, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/45926.

MLA Handbook (7th Edition):

Reller, Susan R. “Reliability diagnostic strategies for series systems under imperfect testing.” 1987. Web. 24 Oct 2019.

Vancouver:

Reller SR. Reliability diagnostic strategies for series systems under imperfect testing. [Internet] [Masters thesis]. Virginia Tech; 1987. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/45926.

Council of Science Editors:

Reller SR. Reliability diagnostic strategies for series systems under imperfect testing. [Masters Thesis]. Virginia Tech; 1987. Available from: http://hdl.handle.net/10919/45926


Virginia Tech

17. Lu, Qifeng. Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation.

Degree: PhD, Civil Engineering, 2009, Virginia Tech

 With the technological advancement in computer science, Geographic Information Science (GIScience), and transportation, more and more complex path finding queries including category based queries are… (more)

Subjects/Keywords: state graph space; O*-MST; Geographic Information Science; C*- Dijkstra; O*-Greedy; O*-Dijkstra; O*-SCDMST; trip planning; category based queries; O*; Geographic Information System; admissible; L#; transportation network; logistics; multivariate; Bivariate; best first search; CSTQ; C*; consistent; path; heuristic; optimization; state graph; graph; OSTQ; C*-P

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lu, Q. (2009). Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation. (Doctoral Dissertation). Virginia Tech. Retrieved from http://hdl.handle.net/10919/26444

Chicago Manual of Style (16th Edition):

Lu, Qifeng. “Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation.” 2009. Doctoral Dissertation, Virginia Tech. Accessed October 24, 2019. http://hdl.handle.net/10919/26444.

MLA Handbook (7th Edition):

Lu, Qifeng. “Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation.” 2009. Web. 24 Oct 2019.

Vancouver:

Lu Q. Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation. [Internet] [Doctoral dissertation]. Virginia Tech; 2009. [cited 2019 Oct 24]. Available from: http://hdl.handle.net/10919/26444.

Council of Science Editors:

Lu Q. Bivariate Best First Searches to Process Category Based Queries in a Graph for Trip Planning Applications in Transportation. [Doctoral Dissertation]. Virginia Tech; 2009. Available from: http://hdl.handle.net/10919/26444

.