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:(Independent jobs). Showing records 1 – 2 of 2 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters

1. Shevade, Shrinidhee. Minimizing Makespan of a Multi-mode, Multi-item Packaging Machine Subject to Resource and Inventory Constraints.

Degree: MS, Engineering and Applied Science: Mechanical Engineering, 2016, University of Cincinnati

An optimization problem at a major hospital inpatient pharmacy is used as motivation to develop two deterministic integer linear programs (ILP) that model the operations of a multi-mode, multi-drug packaging machine. The machine has two packing modes; each mode has different packing speed and operational constraints. The models assign each drug to an operation mode and allocate resource on that mode. Drug inventory on each mode is restocked only when it runs empty. Restocking causes machine setup/downtime. Mode assignment and resource allocation remains fixed throughout the planning horizon. Total packing time is independent of sequence. Two objectives are considered in this work: 1) Minimizing the total packing time over the planning horizon, and 2) Minimizing the maximum of packing time in each period within the planning horizon. The models are considered as a special case (no parallel activities and no precedence constraints) of multi-mode resource constrained project scheduling problem (MRCPSP) with inventory constraints. Using the extended three field notation a|ß|¿ for machine scheduling problems, the two models are denoted as <i>MPS;R;N;Cu||Cmax</i> and <i>MPS;R;N;Cu||max(Cp)</i> respectively, where <i>Cp</i> is the the makespan in each period <i>p</i>. The formulations and solution method are illustrated using 7 periods of randomly generated data for 500 drugs. Both models are solved using an off-the-shelf, state of the art, commercial solver, gurobi. Advisors/Committee Members: Huang, Hongdao (Committee Chair).

Subjects/Keywords: Mechanical Engineering; Operations Research; multi-mode project scheduling; integer linear programming; resource constraints; inventory constraints; no precedence constraints; sequence-independent jobs

…knowledge, the problem of optimizing the execution of jobs on a single multi-mode machine subject… …Research As mentioned in previous chapter, the problem of optimizing the execution of jobs on a… …where trucks are to be processed while jobs correspond to trucks [6]. Variations of… …and time points along with replenishment quantities, a set of resource consuming jobs has to… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shevade, S. (2016). Minimizing Makespan of a Multi-mode, Multi-item Packaging Machine Subject to Resource and Inventory Constraints. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1471254235

Chicago Manual of Style (16th Edition):

Shevade, Shrinidhee. “Minimizing Makespan of a Multi-mode, Multi-item Packaging Machine Subject to Resource and Inventory Constraints.” 2016. Masters Thesis, University of Cincinnati. Accessed February 17, 2020. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1471254235.

MLA Handbook (7th Edition):

Shevade, Shrinidhee. “Minimizing Makespan of a Multi-mode, Multi-item Packaging Machine Subject to Resource and Inventory Constraints.” 2016. Web. 17 Feb 2020.

Vancouver:

Shevade S. Minimizing Makespan of a Multi-mode, Multi-item Packaging Machine Subject to Resource and Inventory Constraints. [Internet] [Masters thesis]. University of Cincinnati; 2016. [cited 2020 Feb 17]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1471254235.

Council of Science Editors:

Shevade S. Minimizing Makespan of a Multi-mode, Multi-item Packaging Machine Subject to Resource and Inventory Constraints. [Masters Thesis]. University of Cincinnati; 2016. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1471254235

2. Renaud-Goud, Paul. Energy-aware scheduling : complexity and algorithms : Ordonnancement sous contrainte d'énergie : complexité et algorithmes.

Degree: Docteur es, Informatique, 2012, Lyon, École normale supérieure

Dans cette thèse, nous nous sommes intéressés à des problèmes d'ordonnancement sous contrainte d'énergie, puisque la réduction de l'énergie est devenue une nécessité, tant sur le plan économique qu'écologique. Dans le premier chapitre, nous exhibons des bornes strictes sur l'énergie d'un algorithme classique qui minimise le temps d'exécution de tâches indépendantes. Dans le second chapitre, nous ordonnançons plusieurs applications chaînées de type « streaming », et nous étudions des problèmes contraignant l'énergie, la période et la latence. Nous effectuons une étude de complexité exhaustive, et décrivons les performances de nouvelles heuristiques. Dans le troisième chapitre, nous étudions le problème de placement de répliques dans un réseau arborescent. Nous nous plaçons dans un cadre dynamique, et nous bornons à minimiser l'énergie. Après une étude de complexité, nous confirmons la qualité de nos heuristiques grâce à un jeu complet de simulations. Dans le quatrième chapitre, nous revenons aux applications « streaming », mais sous forme de graphes série-parallèles, et nous tentons de les placer sur un processeur multi-cœur. La découverte d'un algorithme polynomial sur un problème simple nous permet la conception d'heuristiques sur le problème le plus général dont nous avons établi la NP-complétude. Dans le cinquième chapitre, nous étudions des bornes énergétiques de politiques de routage dans des processeurs multi-cœurs, en comparaison avec le routage classique XY, et développons de nouvheuristiques de routage. Dans le dernier chapitre, nous étudions expérimentalement le placement d'applications sous forme de DAG sur des machines réelles.

In this thesis we have tackled a few scheduling problems under energy constraint, since the energy issue is becoming crucial, for both economical and environmental reasons. In the first chapter, we exhibit tight bounds on the energy metric of a classical algorithm that minimizes the makespan of independent tasks. In the second chapter, we schedule several independent but concurrent pipelined applications and address problems combining multiple criteria, which are period, latency and energy. We perform an exhaustive complexity study and describe the performance of new heuristics. In the third chapter, we study the replica placement problem in a tree network. We try to minimize the energy consumption in a dynamic frame. After a complexity study, we confirm the quality of our heuristics through a complete set of simulations. In the fourth chapter, we come back to streaming applications, but in the form of series-parallel graphs, and try to map them onto a chip multiprocessor. The design of a polynomial algorithm on a simple problem allows us to derive heuristics on the most general problem, whose NP-completeness has been proven. In the fifth chapter, we study energy bounds of different routing policies in chip multiprocessors, compared to the classical XY routing, and develop new routing heuristics. In the last chapter, we compare the performance of different algorithms of the…

Advisors/Committee Members: Benoit, Anne (thesis director).

Subjects/Keywords: Minimisation d'énergie; Puissance; Ordonnancement; Complexité; Heuristique; Algorithmes optimaux; Algorithme glouton; Travaux indépendants; Processeurs parallèles; Placement; Applications concurrentes; Plate-forme hétérogène; Partage de ressources; Énergie; Latence; Période; Placement de répliques; Réseau arborescent; Stratégies de mise à jour; Algorithme de programmation dynamique; Graphe série-parallèle; Routage; Multiprocesseur; Manhattan; Chemin unique; Chemin multiples; DAG; Energy minimization; Power; Scheduling; Complexity; Makespan; Heuristics; Optimal algorithms; Greedy algorithm; Independent jobs; Parallel processors; Mapping; Concurrent streaming applications; Heterogeneous platforms; Resource sharing; Energy; Latency; Period; Workflow; Replica placement; Tree networks; Update strategies; Dynamic programming algorithms; Series-parallel graph; Routing; Chip multiprocesseur; Manhattan; Single path; Multiple paths; Slack reclamation; DAG

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Renaud-Goud, P. (2012). Energy-aware scheduling : complexity and algorithms : Ordonnancement sous contrainte d'énergie : complexité et algorithmes. (Doctoral Dissertation). Lyon, École normale supérieure. Retrieved from http://www.theses.fr/2012ENSL0727

Chicago Manual of Style (16th Edition):

Renaud-Goud, Paul. “Energy-aware scheduling : complexity and algorithms : Ordonnancement sous contrainte d'énergie : complexité et algorithmes.” 2012. Doctoral Dissertation, Lyon, École normale supérieure. Accessed February 17, 2020. http://www.theses.fr/2012ENSL0727.

MLA Handbook (7th Edition):

Renaud-Goud, Paul. “Energy-aware scheduling : complexity and algorithms : Ordonnancement sous contrainte d'énergie : complexité et algorithmes.” 2012. Web. 17 Feb 2020.

Vancouver:

Renaud-Goud P. Energy-aware scheduling : complexity and algorithms : Ordonnancement sous contrainte d'énergie : complexité et algorithmes. [Internet] [Doctoral dissertation]. Lyon, École normale supérieure; 2012. [cited 2020 Feb 17]. Available from: http://www.theses.fr/2012ENSL0727.

Council of Science Editors:

Renaud-Goud P. Energy-aware scheduling : complexity and algorithms : Ordonnancement sous contrainte d'énergie : complexité et algorithmes. [Doctoral Dissertation]. Lyon, École normale supérieure; 2012. Available from: http://www.theses.fr/2012ENSL0727

.