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:(scheduling algorithm). Showing records 1 – 30 of 253 total matches.

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

Search Limiters

Last 2 Years | English Only

Department

Degrees

Levels

Languages

Country

▼ Search Limiters


North Carolina State University

1. Dwekat, Zyad. Practical Fair Queuing Schedulers: Simplification through Quantization.

Degree: PhD, Electrical Engineering, 2009, North Carolina State University

 Many packet scheduling schemes have been proposed, but most of them suffer from one of two extremes. A scheduling scheme may have simple implementation with… (more)

Subjects/Keywords: packet scheduling; networking; qos; algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dwekat, Z. (2009). Practical Fair Queuing Schedulers: Simplification through Quantization. (Doctoral Dissertation). North Carolina State University. Retrieved from http://www.lib.ncsu.edu/resolver/1840.16/4470

Chicago Manual of Style (16th Edition):

Dwekat, Zyad. “Practical Fair Queuing Schedulers: Simplification through Quantization.” 2009. Doctoral Dissertation, North Carolina State University. Accessed May 08, 2021. http://www.lib.ncsu.edu/resolver/1840.16/4470.

MLA Handbook (7th Edition):

Dwekat, Zyad. “Practical Fair Queuing Schedulers: Simplification through Quantization.” 2009. Web. 08 May 2021.

Vancouver:

Dwekat Z. Practical Fair Queuing Schedulers: Simplification through Quantization. [Internet] [Doctoral dissertation]. North Carolina State University; 2009. [cited 2021 May 08]. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4470.

Council of Science Editors:

Dwekat Z. Practical Fair Queuing Schedulers: Simplification through Quantization. [Doctoral Dissertation]. North Carolina State University; 2009. Available from: http://www.lib.ncsu.edu/resolver/1840.16/4470


Georgia Tech

2. Yazdanbod, Sina. Online and offline algorithms for circuit switch scheduling.

Degree: MS, Computer Science, 2020, Georgia Tech

 Motivated by the use of high-speed circuit switches in large scale data centers, we consider the problem of {\em circuit switch scheduling}. In this problem,… (more)

Subjects/Keywords: Approximation algorithm; Online; Matching; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yazdanbod, S. (2020). Online and offline algorithms for circuit switch scheduling. (Masters Thesis). Georgia Tech. Retrieved from http://hdl.handle.net/1853/63589

Chicago Manual of Style (16th Edition):

Yazdanbod, Sina. “Online and offline algorithms for circuit switch scheduling.” 2020. Masters Thesis, Georgia Tech. Accessed May 08, 2021. http://hdl.handle.net/1853/63589.

MLA Handbook (7th Edition):

Yazdanbod, Sina. “Online and offline algorithms for circuit switch scheduling.” 2020. Web. 08 May 2021.

Vancouver:

Yazdanbod S. Online and offline algorithms for circuit switch scheduling. [Internet] [Masters thesis]. Georgia Tech; 2020. [cited 2021 May 08]. Available from: http://hdl.handle.net/1853/63589.

Council of Science Editors:

Yazdanbod S. Online and offline algorithms for circuit switch scheduling. [Masters Thesis]. Georgia Tech; 2020. Available from: http://hdl.handle.net/1853/63589


NSYSU

3. Tsai, An-Hsiou. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.

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

 For a commercial port, to efficiently schedule the public berths is an important issue. Since a berth schedule would affect the usage of the commercial… (more)

Subjects/Keywords: Berth Scheduling; Genetic Algorithm; Taguchi Method

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tsai, A. (2011). Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639

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):

Tsai, An-Hsiou. “Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.” 2011. Thesis, NSYSU. Accessed May 08, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639.

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

MLA Handbook (7th Edition):

Tsai, An-Hsiou. “Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms.” 2011. Web. 08 May 2021.

Vancouver:

Tsai A. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. [Internet] [Thesis]. NSYSU; 2011. [cited 2021 May 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639.

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

Council of Science Editors:

Tsai A. Berth Schedule Planning of the Kaohsiung Port by Genetic Algorithms. [Thesis]. NSYSU; 2011. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0909111-073639

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


University of Manitoba

4. Al-Hinai, Nasr. OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS.

Degree: Mechanical and Manufacturing Engineering, 2011, University of Manitoba

 Flexible job-shop scheduling problem (FJSP) is a generalization of the classical job-shop scheduling problem (JSP). It takes shape when alternative production routing is allowed in… (more)

Subjects/Keywords: Scheduling; Job-Shop; Breakdown; genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Al-Hinai, N. (2011). OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS. (Thesis). University of Manitoba. Retrieved from http://hdl.handle.net/1993/4955

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):

Al-Hinai, Nasr. “OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS.” 2011. Thesis, University of Manitoba. Accessed May 08, 2021. http://hdl.handle.net/1993/4955.

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

MLA Handbook (7th Edition):

Al-Hinai, Nasr. “OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS.” 2011. Web. 08 May 2021.

Vancouver:

Al-Hinai N. OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS. [Internet] [Thesis]. University of Manitoba; 2011. [cited 2021 May 08]. Available from: http://hdl.handle.net/1993/4955.

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

Council of Science Editors:

Al-Hinai N. OPTIMIZING THE FLEXIBLE JOB-SHOP SCHEDULING PROBLEM USING HYBRIDIZED GENETIC ALGORITHMS. [Thesis]. University of Manitoba; 2011. Available from: http://hdl.handle.net/1993/4955

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

5. Wolff, M.B. (author). North Atlantic Organized Track System Allocation Optimization.

Degree: 2015, Delft University of Technology

Transatlantic flight operations are, due to the absence of radar-based surveillance, the influence of the polar jet stream and the highly directional traffic peaks, significantly… (more)

Subjects/Keywords: Transatlantic Flight Operations; genetic algorithm; aircraft scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wolff, M. B. (. (2015). North Atlantic Organized Track System Allocation Optimization. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:b9601479-9c5a-49e1-bb3b-c2acff849ddb

Chicago Manual of Style (16th Edition):

Wolff, M B (author). “North Atlantic Organized Track System Allocation Optimization.” 2015. Masters Thesis, Delft University of Technology. Accessed May 08, 2021. http://resolver.tudelft.nl/uuid:b9601479-9c5a-49e1-bb3b-c2acff849ddb.

MLA Handbook (7th Edition):

Wolff, M B (author). “North Atlantic Organized Track System Allocation Optimization.” 2015. Web. 08 May 2021.

Vancouver:

Wolff MB(. North Atlantic Organized Track System Allocation Optimization. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2021 May 08]. Available from: http://resolver.tudelft.nl/uuid:b9601479-9c5a-49e1-bb3b-c2acff849ddb.

Council of Science Editors:

Wolff MB(. North Atlantic Organized Track System Allocation Optimization. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:b9601479-9c5a-49e1-bb3b-c2acff849ddb


University of Georgia

6. Meka, Archana. A scheduling algorithm and utilization bound for uniform multiprocessors.

Degree: 2014, University of Georgia

 We present a new scheduling algorithm, U-LLREF, which is the first scheduling algorithmfor that is optimal for uniform multiprocessors. It is an extension of the… (more)

Subjects/Keywords: LLREF; optimal scheduling algorithm; uniform multiprocessors

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Meka, A. (2014). A scheduling algorithm and utilization bound for uniform multiprocessors. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/25254

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):

Meka, Archana. “A scheduling algorithm and utilization bound for uniform multiprocessors.” 2014. Thesis, University of Georgia. Accessed May 08, 2021. http://hdl.handle.net/10724/25254.

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

MLA Handbook (7th Edition):

Meka, Archana. “A scheduling algorithm and utilization bound for uniform multiprocessors.” 2014. Web. 08 May 2021.

Vancouver:

Meka A. A scheduling algorithm and utilization bound for uniform multiprocessors. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 May 08]. Available from: http://hdl.handle.net/10724/25254.

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

Council of Science Editors:

Meka A. A scheduling algorithm and utilization bound for uniform multiprocessors. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/25254

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


Penn State University

7. Dahiya, Siddharth. Course Scheduling with Preference Optimization.

Degree: 2015, Penn State University

 The university course timetabling problem is a well-researched NP-hard problem where the goal is to create a course timetable with a given number of professors,… (more)

Subjects/Keywords: course scheduling; timetabling; utp; genetic algorithm; university timetabling problem; evolutionary algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dahiya, S. (2015). Course Scheduling with Preference Optimization. (Thesis). Penn State University. Retrieved from https://submit-etda.libraries.psu.edu/catalog/25069

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):

Dahiya, Siddharth. “Course Scheduling with Preference Optimization.” 2015. Thesis, Penn State University. Accessed May 08, 2021. https://submit-etda.libraries.psu.edu/catalog/25069.

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

MLA Handbook (7th Edition):

Dahiya, Siddharth. “Course Scheduling with Preference Optimization.” 2015. Web. 08 May 2021.

Vancouver:

Dahiya S. Course Scheduling with Preference Optimization. [Internet] [Thesis]. Penn State University; 2015. [cited 2021 May 08]. Available from: https://submit-etda.libraries.psu.edu/catalog/25069.

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

Council of Science Editors:

Dahiya S. Course Scheduling with Preference Optimization. [Thesis]. Penn State University; 2015. Available from: https://submit-etda.libraries.psu.edu/catalog/25069

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


Anna University

8. Murugesan R. A study on job shop scheduling in Hosur manufacturing industry using artificial immune system;.

Degree: 2014, Anna University

Scheduling is defined in general as the process of assigning tasks to the available limited resources with the goal of meeting the endorsed objectives. Scheduling(more)

Subjects/Keywords: Hosur; shop scheduling; artificial immune system; Job Shop Scheduling Problem (JSSP); Clonal Selection ALgorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

R, M. (2014). A study on job shop scheduling in Hosur manufacturing industry using artificial immune system;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/14537

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):

R, Murugesan. “A study on job shop scheduling in Hosur manufacturing industry using artificial immune system;.” 2014. Thesis, Anna University. Accessed May 08, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/14537.

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

MLA Handbook (7th Edition):

R, Murugesan. “A study on job shop scheduling in Hosur manufacturing industry using artificial immune system;.” 2014. Web. 08 May 2021.

Vancouver:

R M. A study on job shop scheduling in Hosur manufacturing industry using artificial immune system;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 May 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/14537.

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

Council of Science Editors:

R M. A study on job shop scheduling in Hosur manufacturing industry using artificial immune system;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/14537

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


Delft University of Technology

9. van Leeuwen, Anouk (author). Optimization of the short-term labor and task scheduling in the maintenance of regional trains.

Degree: 2021, Delft University of Technology

The Dutch Railways (NS) is the Dutch national passenger railway operator. They own rolling stock that has to be maintained regularly. One of the maintenance… (more)

Subjects/Keywords: Rolling Stock Maintenance Scheduling; Resource-Constrained Project Scheduling Problem; Hybrid Heuristics; Genetic Algorithm; Simulated Annealing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

van Leeuwen, A. (. (2021). Optimization of the short-term labor and task scheduling in the maintenance of regional trains. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:7db77462-e6d7-4116-b00d-1c118f1de4c4

Chicago Manual of Style (16th Edition):

van Leeuwen, Anouk (author). “Optimization of the short-term labor and task scheduling in the maintenance of regional trains.” 2021. Masters Thesis, Delft University of Technology. Accessed May 08, 2021. http://resolver.tudelft.nl/uuid:7db77462-e6d7-4116-b00d-1c118f1de4c4.

MLA Handbook (7th Edition):

van Leeuwen, Anouk (author). “Optimization of the short-term labor and task scheduling in the maintenance of regional trains.” 2021. Web. 08 May 2021.

Vancouver:

van Leeuwen A(. Optimization of the short-term labor and task scheduling in the maintenance of regional trains. [Internet] [Masters thesis]. Delft University of Technology; 2021. [cited 2021 May 08]. Available from: http://resolver.tudelft.nl/uuid:7db77462-e6d7-4116-b00d-1c118f1de4c4.

Council of Science Editors:

van Leeuwen A(. Optimization of the short-term labor and task scheduling in the maintenance of regional trains. [Masters Thesis]. Delft University of Technology; 2021. Available from: http://resolver.tudelft.nl/uuid:7db77462-e6d7-4116-b00d-1c118f1de4c4


University of Georgia

10. Vijayagopal, Charulakshmi. Improving partitioned scheduling bounds.

Degree: 2014, University of Georgia

 We consider multiprocessor scheduling of real-time systems of periodic or sporadic tasks. Prior to execution, tasks are partitioned onto the processors using the First-Fit Decreasing… (more)

Subjects/Keywords: Partitioned scheduling; Multiprocessor scheduling algorithm; Utilization bounds; Number of processors; Dissertations; Theses

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vijayagopal, C. (2014). Improving partitioned scheduling bounds. (Thesis). University of Georgia. Retrieved from http://hdl.handle.net/10724/26527

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):

Vijayagopal, Charulakshmi. “Improving partitioned scheduling bounds.” 2014. Thesis, University of Georgia. Accessed May 08, 2021. http://hdl.handle.net/10724/26527.

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

MLA Handbook (7th Edition):

Vijayagopal, Charulakshmi. “Improving partitioned scheduling bounds.” 2014. Web. 08 May 2021.

Vancouver:

Vijayagopal C. Improving partitioned scheduling bounds. [Internet] [Thesis]. University of Georgia; 2014. [cited 2021 May 08]. Available from: http://hdl.handle.net/10724/26527.

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

Council of Science Editors:

Vijayagopal C. Improving partitioned scheduling bounds. [Thesis]. University of Georgia; 2014. Available from: http://hdl.handle.net/10724/26527

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

11. Fernanda Gonçalves Souza. Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo.

Degree: 2019, University of São Paulo

A meta-heurística de colônia de formigas vem sendo aplicada desde de 1991 para resolver diversos tipos de problemas matemáticos sendo uma parte destes problemas os… (more)

Subjects/Keywords: Algoritmo de colônia de formiga; Heurística; Petróleo; Scheduling; Ant colony algorithm; Metaheuristic; Oil; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Souza, F. G. (2019). Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo. (Masters Thesis). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/3/3137/tde-22112019-141951/

Chicago Manual of Style (16th Edition):

Souza, Fernanda Gonçalves. “Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo.” 2019. Masters Thesis, University of São Paulo. Accessed May 08, 2021. http://www.teses.usp.br/teses/disponiveis/3/3137/tde-22112019-141951/.

MLA Handbook (7th Edition):

Souza, Fernanda Gonçalves. “Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo.” 2019. Web. 08 May 2021.

Vancouver:

Souza FG. Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo. [Internet] [Masters thesis]. University of São Paulo; 2019. [cited 2021 May 08]. Available from: http://www.teses.usp.br/teses/disponiveis/3/3137/tde-22112019-141951/.

Council of Science Editors:

Souza FG. Método meta-heurístico de colônia de formigas e sua aplicação na alocação de petróleo. [Masters Thesis]. University of São Paulo; 2019. Available from: http://www.teses.usp.br/teses/disponiveis/3/3137/tde-22112019-141951/


Brno University of Technology

12. Šebek, Petr. Heuristiky v optimalizačních úlohách třídy RCPSP: Meta-Heuristic Solution in RCPSP.

Degree: 2018, Brno University of Technology

 This thesis deals with the description of the state of resource-constrained project scheduling problem. It defines the formal problem and its complexity. It also describes… (more)

Subjects/Keywords: Rozvrhování; RCPSP; heuristický algoritmus; genetický algoritmus; GARTH; Scheduling; Resource-constrained project scheduling problem; RCPSP; heuristic algorithm; genetic algorithm; GARTH

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Šebek, P. (2018). Heuristiky v optimalizačních úlohách třídy RCPSP: Meta-Heuristic Solution in RCPSP. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/52228

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):

Šebek, Petr. “Heuristiky v optimalizačních úlohách třídy RCPSP: Meta-Heuristic Solution in RCPSP.” 2018. Thesis, Brno University of Technology. Accessed May 08, 2021. http://hdl.handle.net/11012/52228.

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

MLA Handbook (7th Edition):

Šebek, Petr. “Heuristiky v optimalizačních úlohách třídy RCPSP: Meta-Heuristic Solution in RCPSP.” 2018. Web. 08 May 2021.

Vancouver:

Šebek P. Heuristiky v optimalizačních úlohách třídy RCPSP: Meta-Heuristic Solution in RCPSP. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 May 08]. Available from: http://hdl.handle.net/11012/52228.

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

Council of Science Editors:

Šebek P. Heuristiky v optimalizačních úlohách třídy RCPSP: Meta-Heuristic Solution in RCPSP. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/52228

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

13. Dileeplal, J. Multi-objective assembly job shop scheduling using genetic algorithm and tabu search.

Degree: Ship Technology, 2012, Cochin University of Science and Technology

Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of… (more)

Subjects/Keywords: Assembly job shop scheduling; Genetic algorithm; Tabu search; Pare to archived genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dileeplal, J. (2012). Multi-objective assembly job shop scheduling using genetic algorithm and tabu search. (Thesis). Cochin University of Science and Technology. Retrieved from http://dyuthi.cusat.ac.in/purl/3716

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):

Dileeplal, J. “Multi-objective assembly job shop scheduling using genetic algorithm and tabu search.” 2012. Thesis, Cochin University of Science and Technology. Accessed May 08, 2021. http://dyuthi.cusat.ac.in/purl/3716.

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

MLA Handbook (7th Edition):

Dileeplal, J. “Multi-objective assembly job shop scheduling using genetic algorithm and tabu search.” 2012. Web. 08 May 2021.

Vancouver:

Dileeplal J. Multi-objective assembly job shop scheduling using genetic algorithm and tabu search. [Internet] [Thesis]. Cochin University of Science and Technology; 2012. [cited 2021 May 08]. Available from: http://dyuthi.cusat.ac.in/purl/3716.

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

Council of Science Editors:

Dileeplal J. Multi-objective assembly job shop scheduling using genetic algorithm and tabu search. [Thesis]. Cochin University of Science and Technology; 2012. Available from: http://dyuthi.cusat.ac.in/purl/3716

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

14. Brum, Artur Ferreira. Automatic algorithm configuration for flow shop scheduling problems.

Degree: 2020, Brazil

Problemas de agendamento tem sido assunto de interesse para pesquisadores em otimização por muitos anos. Problemas de flow shop, em particular, são alguns dos problemas… (more)

Subjects/Keywords: Informática; Flow shop scheduling problem; Automatic algorithm configuration; Iterated local search; Iterated greedy algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Brum, A. F. (2020). Automatic algorithm configuration for flow shop scheduling problems. (Doctoral Dissertation). Brazil. Retrieved from http://hdl.handle.net/10183/213705

Chicago Manual of Style (16th Edition):

Brum, Artur Ferreira. “Automatic algorithm configuration for flow shop scheduling problems.” 2020. Doctoral Dissertation, Brazil. Accessed May 08, 2021. http://hdl.handle.net/10183/213705.

MLA Handbook (7th Edition):

Brum, Artur Ferreira. “Automatic algorithm configuration for flow shop scheduling problems.” 2020. Web. 08 May 2021.

Vancouver:

Brum AF. Automatic algorithm configuration for flow shop scheduling problems. [Internet] [Doctoral dissertation]. Brazil; 2020. [cited 2021 May 08]. Available from: http://hdl.handle.net/10183/213705.

Council of Science Editors:

Brum AF. Automatic algorithm configuration for flow shop scheduling problems. [Doctoral Dissertation]. Brazil; 2020. Available from: http://hdl.handle.net/10183/213705


Georgia Tech

15. Choi, Youngjun. A framework for modeling and simulation of control, navigation, and surveillance for unmanned aircraft separation assurance.

Degree: PhD, Aerospace Engineering, 2016, Georgia Tech

 The integration of Unmanned Aircraft Systems in the National Airspace System (UASNAS) problem has received much attention because of the growing number of variety of… (more)

Subjects/Keywords: Gain-scheduling method; Collision avoidance algorithm; Machine learning algorithm; Urban modeling methodology

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choi, Y. (2016). A framework for modeling and simulation of control, navigation, and surveillance for unmanned aircraft separation assurance. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55637

Chicago Manual of Style (16th Edition):

Choi, Youngjun. “A framework for modeling and simulation of control, navigation, and surveillance for unmanned aircraft separation assurance.” 2016. Doctoral Dissertation, Georgia Tech. Accessed May 08, 2021. http://hdl.handle.net/1853/55637.

MLA Handbook (7th Edition):

Choi, Youngjun. “A framework for modeling and simulation of control, navigation, and surveillance for unmanned aircraft separation assurance.” 2016. Web. 08 May 2021.

Vancouver:

Choi Y. A framework for modeling and simulation of control, navigation, and surveillance for unmanned aircraft separation assurance. [Internet] [Doctoral dissertation]. Georgia Tech; 2016. [cited 2021 May 08]. Available from: http://hdl.handle.net/1853/55637.

Council of Science Editors:

Choi Y. A framework for modeling and simulation of control, navigation, and surveillance for unmanned aircraft separation assurance. [Doctoral Dissertation]. Georgia Tech; 2016. Available from: http://hdl.handle.net/1853/55637


NSYSU

16. Chou, Ta-Yuan. Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems.

Degree: PhD, Computer Science and Engineering, 2008, NSYSU

 In airline industry scheduling problems, the aircraft routing and the aircrew pairing problems are highly related to fueling and personnel costs. When performing aircraft routing… (more)

Subjects/Keywords: Multiobjective; Optimization; Genetic Algorithm; Method of Inequalities; Scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chou, T. (2008). Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems. (Doctoral Dissertation). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0214108-174718

Chicago Manual of Style (16th Edition):

Chou, Ta-Yuan. “Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems.” 2008. Doctoral Dissertation, NSYSU. Accessed May 08, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0214108-174718.

MLA Handbook (7th Edition):

Chou, Ta-Yuan. “Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems.” 2008. Web. 08 May 2021.

Vancouver:

Chou T. Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems. [Internet] [Doctoral dissertation]. NSYSU; 2008. [cited 2021 May 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0214108-174718.

Council of Science Editors:

Chou T. Method of Inequalities Based Multiobjective Genetic Algorithm for Airline Scheduling Problems. [Doctoral Dissertation]. NSYSU; 2008. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0214108-174718


NSYSU

17. Huang, Yi-chen. CUDA-Based Modified Genetic Algorithms for Solving Fuzzy Flow Shop Scheduling Problems.

Degree: Master, Applied Mathematics, 2010, NSYSU

 The flow shop scheduling problems with fuzzy processing times and fuzzy due dates are investigated in this paper. The concepts of earliness and tardiness are… (more)

Subjects/Keywords: CUDA framework; Fuzzy number; Genetic algorithm; Flow shop scheduling problem

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Huang, Y. (2010). CUDA-Based Modified Genetic Algorithms for Solving Fuzzy Flow Shop Scheduling Problems. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-173701

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):

Huang, Yi-chen. “CUDA-Based Modified Genetic Algorithms for Solving Fuzzy Flow Shop Scheduling Problems.” 2010. Thesis, NSYSU. Accessed May 08, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-173701.

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

MLA Handbook (7th Edition):

Huang, Yi-chen. “CUDA-Based Modified Genetic Algorithms for Solving Fuzzy Flow Shop Scheduling Problems.” 2010. Web. 08 May 2021.

Vancouver:

Huang Y. CUDA-Based Modified Genetic Algorithms for Solving Fuzzy Flow Shop Scheduling Problems. [Internet] [Thesis]. NSYSU; 2010. [cited 2021 May 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-173701.

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

Council of Science Editors:

Huang Y. CUDA-Based Modified Genetic Algorithms for Solving Fuzzy Flow Shop Scheduling Problems. [Thesis]. NSYSU; 2010. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0823110-173701

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


NSYSU

18. Chiang, Meng-hsiu. A Framework for the Implementation of Heuristic-based Schedulers on Hadoop.

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

 The advance of computer technology from uni-processing to symmetric-multiprocessing to distributed computing and then to cloud computing has made it more and more difficult to… (more)

Subjects/Keywords: distributed computing; heuristic algorithm; cloud computing; Hadoop; scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chiang, M. (2014). A Framework for the Implementation of Heuristic-based Schedulers on Hadoop. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720114-145150

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):

Chiang, Meng-hsiu. “A Framework for the Implementation of Heuristic-based Schedulers on Hadoop.” 2014. Thesis, NSYSU. Accessed May 08, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720114-145150.

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

MLA Handbook (7th Edition):

Chiang, Meng-hsiu. “A Framework for the Implementation of Heuristic-based Schedulers on Hadoop.” 2014. Web. 08 May 2021.

Vancouver:

Chiang M. A Framework for the Implementation of Heuristic-based Schedulers on Hadoop. [Internet] [Thesis]. NSYSU; 2014. [cited 2021 May 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720114-145150.

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

Council of Science Editors:

Chiang M. A Framework for the Implementation of Heuristic-based Schedulers on Hadoop. [Thesis]. NSYSU; 2014. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0720114-145150

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


NSYSU

19. Chung, Hwei-Ming. Study on Charging Scheduling of Electric Vehicles with Load Forecast Information in Smart Grid.

Degree: Master, Communications Engineering, 2016, NSYSU

 This thesis studies the charge scheduling problem of electric vehicles (EVs) in the scale of a microgrid (e.g., a university or town), where a set… (more)

Subjects/Keywords: Electric vehicles; online algorithm; Pareto-optimal; scheduling; smart grid

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chung, H. (2016). Study on Charging Scheduling of Electric Vehicles with Load Forecast Information in Smart Grid. (Thesis). NSYSU. Retrieved from http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715116-172555

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):

Chung, Hwei-Ming. “Study on Charging Scheduling of Electric Vehicles with Load Forecast Information in Smart Grid.” 2016. Thesis, NSYSU. Accessed May 08, 2021. http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715116-172555.

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

MLA Handbook (7th Edition):

Chung, Hwei-Ming. “Study on Charging Scheduling of Electric Vehicles with Load Forecast Information in Smart Grid.” 2016. Web. 08 May 2021.

Vancouver:

Chung H. Study on Charging Scheduling of Electric Vehicles with Load Forecast Information in Smart Grid. [Internet] [Thesis]. NSYSU; 2016. [cited 2021 May 08]. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715116-172555.

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

Council of Science Editors:

Chung H. Study on Charging Scheduling of Electric Vehicles with Load Forecast Information in Smart Grid. [Thesis]. NSYSU; 2016. Available from: http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0715116-172555

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


Anna University

20. Kamalam G K. An Improved Job Scheduling Algorithm For The Computational Grid Environment;.

Degree: Computer Science, 2012, Anna University

Grid is a dynamically shared environment It comprises of newlinegeographically distributed heterogeneous computational resources of multiinstitutional newlinedomains with different usage policies The idle resources of… (more)

Subjects/Keywords: Computational; Grid Environment; Job Scheduling Algorithm; Makespan; multiinstitutional domains; NPhard

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

K, K. G. (2012). An Improved Job Scheduling Algorithm For The Computational Grid Environment;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/22936

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):

K, Kamalam G. “An Improved Job Scheduling Algorithm For The Computational Grid Environment;.” 2012. Thesis, Anna University. Accessed May 08, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/22936.

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

MLA Handbook (7th Edition):

K, Kamalam G. “An Improved Job Scheduling Algorithm For The Computational Grid Environment;.” 2012. Web. 08 May 2021.

Vancouver:

K KG. An Improved Job Scheduling Algorithm For The Computational Grid Environment;. [Internet] [Thesis]. Anna University; 2012. [cited 2021 May 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22936.

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

Council of Science Editors:

K KG. An Improved Job Scheduling Algorithm For The Computational Grid Environment;. [Thesis]. Anna University; 2012. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/22936

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


University of Oulu

21. Selek, I. (István). Novel evolutionary methods in engineering optimization—towards robustness and efficiency.

Degree: 2009, University of Oulu

 Abstract In industry there is a high demand for algorithms that can efficiently solve search problems. Evolutionary Computing (EC) belonging to a class of heuristics… (more)

Subjects/Keywords: evolutionary algorithm; neutrality; objective function transformation; redundancy; scheduling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Selek, I. (. (2009). Novel evolutionary methods in engineering optimization—towards robustness and efficiency. (Doctoral Dissertation). University of Oulu. Retrieved from http://urn.fi/urn:isbn:9789514291579

Chicago Manual of Style (16th Edition):

Selek, I (István). “Novel evolutionary methods in engineering optimization—towards robustness and efficiency.” 2009. Doctoral Dissertation, University of Oulu. Accessed May 08, 2021. http://urn.fi/urn:isbn:9789514291579.

MLA Handbook (7th Edition):

Selek, I (István). “Novel evolutionary methods in engineering optimization—towards robustness and efficiency.” 2009. Web. 08 May 2021.

Vancouver:

Selek I(. Novel evolutionary methods in engineering optimization—towards robustness and efficiency. [Internet] [Doctoral dissertation]. University of Oulu; 2009. [cited 2021 May 08]. Available from: http://urn.fi/urn:isbn:9789514291579.

Council of Science Editors:

Selek I(. Novel evolutionary methods in engineering optimization—towards robustness and efficiency. [Doctoral Dissertation]. University of Oulu; 2009. Available from: http://urn.fi/urn:isbn:9789514291579


Anna University

22. Sampoornam K P. Efficient data redundancy reduction scheme to enhance the life time of wireless sensor networks using conjugative sleep scheduling algorithm;.

Degree: Efficient data redundancy reduction scheme to enhance the life time of Wireless sensor networks using Conjugative sleep scheduling algorithm, 2014, Anna University

Wireless Sensor Network is a network that encompasses a large number of sensor nodes and one or more Base Stations These nodes are deployed in… (more)

Subjects/Keywords: Conjugative sleep scheduling algorithm; Information and communication engineering; Wireless Sensor Networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

P, S. K. (2014). Efficient data redundancy reduction scheme to enhance the life time of wireless sensor networks using conjugative sleep scheduling algorithm;. (Thesis). Anna University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/24185

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):

P, Sampoornam K. “Efficient data redundancy reduction scheme to enhance the life time of wireless sensor networks using conjugative sleep scheduling algorithm;.” 2014. Thesis, Anna University. Accessed May 08, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/24185.

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

MLA Handbook (7th Edition):

P, Sampoornam K. “Efficient data redundancy reduction scheme to enhance the life time of wireless sensor networks using conjugative sleep scheduling algorithm;.” 2014. Web. 08 May 2021.

Vancouver:

P SK. Efficient data redundancy reduction scheme to enhance the life time of wireless sensor networks using conjugative sleep scheduling algorithm;. [Internet] [Thesis]. Anna University; 2014. [cited 2021 May 08]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24185.

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

Council of Science Editors:

P SK. Efficient data redundancy reduction scheme to enhance the life time of wireless sensor networks using conjugative sleep scheduling algorithm;. [Thesis]. Anna University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/24185

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


University of Saskatchewan

23. Han, Bin. SUPPLY CHAIN SCHEDULING FOR MULTI-MACHINES AND MULTI-CUSTOMERS.

Degree: 2015, University of Saskatchewan

 Manufacturing today is no longer a single point of production activity but a chain of activities from the acquisition of raw materials to the delivery… (more)

Subjects/Keywords: supply chain scheduling; algorithm; on-line; robustness; resilience; emergency management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Han, B. (2015). SUPPLY CHAIN SCHEDULING FOR MULTI-MACHINES AND MULTI-CUSTOMERS. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/ETD-2015-09-2201

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):

Han, Bin. “SUPPLY CHAIN SCHEDULING FOR MULTI-MACHINES AND MULTI-CUSTOMERS.” 2015. Thesis, University of Saskatchewan. Accessed May 08, 2021. http://hdl.handle.net/10388/ETD-2015-09-2201.

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

MLA Handbook (7th Edition):

Han, Bin. “SUPPLY CHAIN SCHEDULING FOR MULTI-MACHINES AND MULTI-CUSTOMERS.” 2015. Web. 08 May 2021.

Vancouver:

Han B. SUPPLY CHAIN SCHEDULING FOR MULTI-MACHINES AND MULTI-CUSTOMERS. [Internet] [Thesis]. University of Saskatchewan; 2015. [cited 2021 May 08]. Available from: http://hdl.handle.net/10388/ETD-2015-09-2201.

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

Council of Science Editors:

Han B. SUPPLY CHAIN SCHEDULING FOR MULTI-MACHINES AND MULTI-CUSTOMERS. [Thesis]. University of Saskatchewan; 2015. Available from: http://hdl.handle.net/10388/ETD-2015-09-2201

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


University of Saskatchewan

24. Ramezani, Iman. A permutation flowshop model with time-lags and waiting time preferences of the patients.

Degree: 2019, University of Saskatchewan

 The permutation flowshop is a widely applied scheduling model. In many real-world applications of this model, a minimum and maximum time-lag must be considered between… (more)

Subjects/Keywords: Waiting times of the patients; Healthcare scheduling; Constraint programming; Genetic algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ramezani, I. (2019). A permutation flowshop model with time-lags and waiting time preferences of the patients. (Thesis). University of Saskatchewan. Retrieved from http://hdl.handle.net/10388/11872

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):

Ramezani, Iman. “A permutation flowshop model with time-lags and waiting time preferences of the patients.” 2019. Thesis, University of Saskatchewan. Accessed May 08, 2021. http://hdl.handle.net/10388/11872.

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

MLA Handbook (7th Edition):

Ramezani, Iman. “A permutation flowshop model with time-lags and waiting time preferences of the patients.” 2019. Web. 08 May 2021.

Vancouver:

Ramezani I. A permutation flowshop model with time-lags and waiting time preferences of the patients. [Internet] [Thesis]. University of Saskatchewan; 2019. [cited 2021 May 08]. Available from: http://hdl.handle.net/10388/11872.

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

Council of Science Editors:

Ramezani I. A permutation flowshop model with time-lags and waiting time preferences of the patients. [Thesis]. University of Saskatchewan; 2019. Available from: http://hdl.handle.net/10388/11872

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


University of Newcastle

25. Kapoor, Reena. Scheduling problems arising in coal export supply chains: algorithms and complexity.

Degree: non-terminal) node equals the total capacity of arcs leaving the node; and identical capacities on all arcs. Another factor that has a great impact on the throughput of the coal supply chain is the management of the stockyard, which is the interface between the land portion of the coal supply chain and the ocean portion of the coal supply chain, and where the cargoes get assembled. Given a number of vessels arriving at the port, stockyard management decisions include: assigning a location to each cargo (stockpile, 2015, University of Newcastle

Research Doctorate - Doctor of Philosophy

A coal supply chain is a highly complex logistics system, comprising of several parties and components, focused on transporting… (more)

Subjects/Keywords: mixed integer programming; computational complexity; approximation algorithm; network optimization; scheduling; routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kapoor, R. (2015). Scheduling problems arising in coal export supply chains: algorithms and complexity. (Doctoral Dissertation). University of Newcastle. Retrieved from http://hdl.handle.net/1959.13/1310323

Chicago Manual of Style (16th Edition):

Kapoor, Reena. “Scheduling problems arising in coal export supply chains: algorithms and complexity.” 2015. Doctoral Dissertation, University of Newcastle. Accessed May 08, 2021. http://hdl.handle.net/1959.13/1310323.

MLA Handbook (7th Edition):

Kapoor, Reena. “Scheduling problems arising in coal export supply chains: algorithms and complexity.” 2015. Web. 08 May 2021.

Vancouver:

Kapoor R. Scheduling problems arising in coal export supply chains: algorithms and complexity. [Internet] [Doctoral dissertation]. University of Newcastle; 2015. [cited 2021 May 08]. Available from: http://hdl.handle.net/1959.13/1310323.

Council of Science Editors:

Kapoor R. Scheduling problems arising in coal export supply chains: algorithms and complexity. [Doctoral Dissertation]. University of Newcastle; 2015. Available from: http://hdl.handle.net/1959.13/1310323


Delft University of Technology

26. van der Weide, T.M.J. (author). Long-term C-check scheduling for a fleet of heterogeneous aircraft under uncertainty.

Degree: 2020, Delft University of Technology

 The MRO market currently spans around 9.5% of the total operating cost of an airline. Of this, 70% is covered by heavy-maintenance. Reduction of these… (more)

Subjects/Keywords: Aircraft Maintenance; Genetic algorithm; Min-max optimization; Scheduling; Uncertainty

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

van der Weide, T. M. J. (. (2020). Long-term C-check scheduling for a fleet of heterogeneous aircraft under uncertainty. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:db953324-f70d-4c2f-a1a7-3c9d318df4f8

Chicago Manual of Style (16th Edition):

van der Weide, T M J (author). “Long-term C-check scheduling for a fleet of heterogeneous aircraft under uncertainty.” 2020. Masters Thesis, Delft University of Technology. Accessed May 08, 2021. http://resolver.tudelft.nl/uuid:db953324-f70d-4c2f-a1a7-3c9d318df4f8.

MLA Handbook (7th Edition):

van der Weide, T M J (author). “Long-term C-check scheduling for a fleet of heterogeneous aircraft under uncertainty.” 2020. Web. 08 May 2021.

Vancouver:

van der Weide TMJ(. Long-term C-check scheduling for a fleet of heterogeneous aircraft under uncertainty. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 May 08]. Available from: http://resolver.tudelft.nl/uuid:db953324-f70d-4c2f-a1a7-3c9d318df4f8.

Council of Science Editors:

van der Weide TMJ(. Long-term C-check scheduling for a fleet of heterogeneous aircraft under uncertainty. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:db953324-f70d-4c2f-a1a7-3c9d318df4f8


University of Toronto

27. Feng, Ti Kan. Combining Decomposition and Hybrid Algorithms for the Satellite Range Scheduling Problems.

Degree: 2012, University of Toronto

Multiple-resource satellite scheduling problem (MuRRSP) is a complex and difficult scheduling problem, which schedules a large number of task requests onto ground-station antennas in order… (more)

Subjects/Keywords: Satellite Scheduling; Hybrid Algorithm; Logic-Based Benders Decomposition; 0796

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Feng, T. K. (2012). Combining Decomposition and Hybrid Algorithms for the Satellite Range Scheduling Problems. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/32239

Chicago Manual of Style (16th Edition):

Feng, Ti Kan. “Combining Decomposition and Hybrid Algorithms for the Satellite Range Scheduling Problems.” 2012. Masters Thesis, University of Toronto. Accessed May 08, 2021. http://hdl.handle.net/1807/32239.

MLA Handbook (7th Edition):

Feng, Ti Kan. “Combining Decomposition and Hybrid Algorithms for the Satellite Range Scheduling Problems.” 2012. Web. 08 May 2021.

Vancouver:

Feng TK. Combining Decomposition and Hybrid Algorithms for the Satellite Range Scheduling Problems. [Internet] [Masters thesis]. University of Toronto; 2012. [cited 2021 May 08]. Available from: http://hdl.handle.net/1807/32239.

Council of Science Editors:

Feng TK. Combining Decomposition and Hybrid Algorithms for the Satellite Range Scheduling Problems. [Masters Thesis]. University of Toronto; 2012. Available from: http://hdl.handle.net/1807/32239


AUT University

28. Buchner, Johannes. Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind .

Degree: 2011, AUT University

Scheduling, the task of producing a time table for resources and tasks, is well-known to be a difficult problem the more resources are involved (a… (more)

Subjects/Keywords: Astronomy; Scheduling; Radio telescope; Genetic algorithm; Square Kilometre Array

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Buchner, J. (2011). Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind . (Thesis). AUT University. Retrieved from http://hdl.handle.net/10292/3037

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):

Buchner, Johannes. “Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind .” 2011. Thesis, AUT University. Accessed May 08, 2021. http://hdl.handle.net/10292/3037.

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

MLA Handbook (7th Edition):

Buchner, Johannes. “Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind .” 2011. Web. 08 May 2021.

Vancouver:

Buchner J. Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind . [Internet] [Thesis]. AUT University; 2011. [cited 2021 May 08]. Available from: http://hdl.handle.net/10292/3037.

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

Council of Science Editors:

Buchner J. Dynamic scheduling and planning parallel observations on large Radio Telescope Arrays with the Square Kilometre Array in mind . [Thesis]. AUT University; 2011. Available from: http://hdl.handle.net/10292/3037

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


Halmstad University

29. Manoharan, Jegadish; Chandrakumar, Somanathan. Real-Time Scheduling methods for High Performance Signal Processing Applications on Multicore platform.

Degree: Halmstad Embedded and Intelligent Systems Research (EIS), 2012, Halmstad University

  High-performance signal processing applications is computational intensive, complex and large amount of data has to be processed at every instance. Now these complex algorithms… (more)

Subjects/Keywords: real time system scheduling algorithm; Embedded Systems; Inbäddad systemteknik

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Manoharan, Jegadish; Chandrakumar, S. (2012). Real-Time Scheduling methods for High Performance Signal Processing Applications on Multicore platform. (Thesis). Halmstad University. Retrieved from http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-19485

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):

Manoharan, Jegadish; Chandrakumar, Somanathan. “Real-Time Scheduling methods for High Performance Signal Processing Applications on Multicore platform.” 2012. Thesis, Halmstad University. Accessed May 08, 2021. http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-19485.

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

MLA Handbook (7th Edition):

Manoharan, Jegadish; Chandrakumar, Somanathan. “Real-Time Scheduling methods for High Performance Signal Processing Applications on Multicore platform.” 2012. Web. 08 May 2021.

Vancouver:

Manoharan, Jegadish; Chandrakumar S. Real-Time Scheduling methods for High Performance Signal Processing Applications on Multicore platform. [Internet] [Thesis]. Halmstad University; 2012. [cited 2021 May 08]. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-19485.

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

Council of Science Editors:

Manoharan, Jegadish; Chandrakumar S. Real-Time Scheduling methods for High Performance Signal Processing Applications on Multicore platform. [Thesis]. Halmstad University; 2012. Available from: http://urn.kb.se/resolve?urn=urn:nbn:se:hh:diva-19485

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


Delft University of Technology

30. Zhao, A. (author). Reliable In-Vehicle FlexRay Network Scheduler Design.

Degree: 2011, Delft University of Technology

FlexRay is the new generation in-vehicle network protocol that enable fast data rate, reliability and fault-tolerant. It is developed by BMW, DaimlerChrysler, Bosch, Philips and… (more)

Subjects/Keywords: switch; FlexRay; scheduler; scheduling; algorithm; in-Vehicle; automotive; network

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhao, A. (. (2011). Reliable In-Vehicle FlexRay Network Scheduler Design. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:f85d9bbe-ae54-4e2e-a5e2-a23900078078

Chicago Manual of Style (16th Edition):

Zhao, A (author). “Reliable In-Vehicle FlexRay Network Scheduler Design.” 2011. Masters Thesis, Delft University of Technology. Accessed May 08, 2021. http://resolver.tudelft.nl/uuid:f85d9bbe-ae54-4e2e-a5e2-a23900078078.

MLA Handbook (7th Edition):

Zhao, A (author). “Reliable In-Vehicle FlexRay Network Scheduler Design.” 2011. Web. 08 May 2021.

Vancouver:

Zhao A(. Reliable In-Vehicle FlexRay Network Scheduler Design. [Internet] [Masters thesis]. Delft University of Technology; 2011. [cited 2021 May 08]. Available from: http://resolver.tudelft.nl/uuid:f85d9bbe-ae54-4e2e-a5e2-a23900078078.

Council of Science Editors:

Zhao A(. Reliable In-Vehicle FlexRay Network Scheduler Design. [Masters Thesis]. Delft University of Technology; 2011. Available from: http://resolver.tudelft.nl/uuid:f85d9bbe-ae54-4e2e-a5e2-a23900078078

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

.