Log in

Relevant bibliographies by topics / Minimization makespan / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Minimization makespan.

Dissertations / Theses on the topic 'Minimization makespan'

Author: Grafiati

Published: 4 June 2025

Last updated: 1 August 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 17 dissertations / theses for your research on the topic 'Minimization makespan.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Hinze, Richard. "Makespan Minimization in Re-entrant Permutation Flow Shops." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2018. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-234685.

Full text

Abstract:

Re-entrant permutation flow shop problems occur in practical applications such as wafer manufacturing, paint shops, mold and die processes and textile industry. A re-entrant material flow means that the production jobs need to visit at least one working station multiple times. A comprehensive review gives an overview of the literature on re-entrant scheduling. The influence of missing operations received just little attention so far and splitting the jobs into sublots was not examined in re-entrant permutation flow shops before. The computational complexity of makespan minimization in re-entra

APA, Harvard, Vancouver, ISO, and other styles

2

Weyerman, Whitney Samuel. "Approximations with Improving Error Bounds for Makespan Minimization in Batch Manufacturing." Diss., CLICK HERE for online access, 2008. http://contentdm.lib.byu.edu/ETD/image/etd2300.pdf.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Hinze, Richard [Verfasser], Udo [Akademischer Betreuer] Buscher, Udo [Gutachter] Buscher, and Rainer [Gutachter] Lasch. "Makespan Minimization in Re-entrant Permutation Flow Shops / Richard Hinze ; Gutachter: Udo Buscher, Rainer Lasch ; Betreuer: Udo Buscher." Dresden : Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2018. http://d-nb.info/1156169852/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Garg, Amit. "Three Essays in Parallel Machine Scheduling." Case Western Reserve University School of Graduate Studies / OhioLINK, 2008. http://rave.ohiolink.edu/etdc/view?acc_num=case1196441940.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sanlaville, Éric. "Conception et analyse d'algorithmes de liste en ordonnancement preemptif." Paris 6, 1992. http://www.theses.fr/1992PA066325.

Full text

Abstract:

Cette these traite de l'ordonnancement de taches sur des machines paralleles. Nous considerons un ensemble de taches de durees quelconques, liees par des contraintes de precedente. Elles doivent s'executer sur des machines identiques, qui ne sont pas toutes disponibles a chaque instant (ordonnancement sur profil variable); elles peuvent etre interrompues (preemptee) puis reprises sur n'importe quelle machine, a tout moment. Le critere d'optimisation est la minimisation, soit de la date de fin de la derniere tache, soit du plus grand retard quand des dates d'echeance sont associees aux taches.

APA, Harvard, Vancouver, ISO, and other styles

6

Renaud-Goud, Paul. "Energy-aware scheduling : complexity and algorithms." Phd thesis, Ecole normale supérieure de lyon - ENS LYON, 2012. http://tel.archives-ouvertes.fr/tel-00744247.

Full text

Abstract:

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 c

APA, Harvard, Vancouver, ISO, and other styles

7

Liu, Yen-Cheng, and 劉彥徵. "Makespan Minimization in Differentiation Flowshops." Thesis, 2010. http://ndltd.ncl.edu.tw/handle/15109499986360458996.

Full text

Abstract:

碩士<br>國立交通大學<br>資訊管理研究所<br>98<br>Since Johnson’s first study on the flowshop scheduling setting in 1954, considerable research works have been done on this subject due to its practical as well as theoretical significance. In this thesis, we consider the differentiation flowshop model, which is extended from the traditional flowshop scheduling problem. In this model, we divide the jobs into various categories, each of which consists of two stages of operations. At the first stage, all jobs should be processed on the same machine. At the second stage, each individual product proceeds to a dedica

APA, Harvard, Vancouver, ISO, and other styles

8

Shyur, Der-Lin, and 徐德霖. "Makespan minimization for two parallel machines." Thesis, 2001. http://ndltd.ncl.edu.tw/handle/23263267640316385564.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>工業管理系<br>89<br>In the paper, we consider a two-parallel-machine problem where one machine is not available during a time period. The unavailable time period is fixed and known in advance. A machine is not available probably because it needs preventive maintenance or periodical repair. The objective of the problem is to minimize the makespan. For both nonresumable and resumable cases, we partition the problem into four sub-problems, each of which is solved optimally by an algorithm. Although all the algorithms have exponential time complexity, they are quite efficient in solvi

APA, Harvard, Vancouver, ISO, and other styles

9

Lin, Chien-Hung, and 林建宏. "Makespan Minimization on Various Parallel Machine Problems." Thesis, 2003. http://ndltd.ncl.edu.tw/handle/14222533968182909615.

Full text

Abstract:

博士<br>國立臺灣科技大學<br>工業管理系<br>91<br>We study the makespan minimization problems on parallel machines. Three particular problems are under consideration: machines with different processing speeds, availability constraints on processing plan, and feasible solutions under minimum flowtime. Base on lexicographic search and the associated properties, we propose the optimal algorithms to the considered problems. Although all the developed algorithms have exponential time complexities, they are quite efficient in solving large-sized problems. Computational results for problems with up to 1000 jobs are r

APA, Harvard, Vancouver, ISO, and other styles

10

Hinze, Richard. "Makespan Minimization in Re-entrant Permutation Flow Shops." Doctoral thesis, 2017. https://tud.qucosa.de/id/qucosa%3A30915.

Full text

Abstract:

Re-entrant permutation flow shop problems occur in practical applications such as wafer manufacturing, paint shops, mold and die processes and textile industry. A re-entrant material flow means that the production jobs need to visit at least one working station multiple times. A comprehensive review gives an overview of the literature on re-entrant scheduling. The influence of missing operations received just little attention so far and splitting the jobs into sublots was not examined in re-entrant permutation flow shops before. The computational complexity of makespan minimization in re-entra

APA, Harvard, Vancouver, ISO, and other styles

11

Hashemian, Navid. "MAKESPAN MINIMIZATION FOR PARALLEL MACHINES SCHEDULING WITH AVAILABILITY CONSTRAINTS." 2010. http://hdl.handle.net/10222/12733.

Full text

Abstract:

A new method is developed to schedule jobs on parallel machines with availability constraints. The objective of the problem is to minimize the makespan of the total production schedule. Without the availability constraints the scheduling of machines is a Pm || Cmax problem. The scheduling of this problem was the topic of many earlier papers. The main contribution of this research is that the schedule of the jobs on parallel machines with availability constraints is determined within a single implicit enumer- ation algorithm. Within the general enumeration scheme, the loads of each machine are

APA, Harvard, Vancouver, ISO, and other styles

12

Chen, Cheng-Ming, and 陳正明. "Makespan Minimization for Two Parallel Machines with Cardinality Constraints." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/98996237550180766390.

Full text

APA, Harvard, Vancouver, ISO, and other styles

13

Huang, Hsiao-Lan, and 黃筱嵐. "Makespan Minimization in the Relocation Problem on a Single Machine." Thesis, 2011. http://ndltd.ncl.edu.tw/handle/12408296113850955361.

Full text

Abstract:

博士<br>國立交通大學<br>資訊管理研究所<br>99<br>The relocation problem originated from a redevelopment project in the Boston area. In the project, a set of buildings has to be reconstructed. Before a building is demolished, tenants residing in it have to be evacuated and settled at temporary sites. Subject to a limited number of initial housing units, the authority has to determine a processing sequence to successfully redevelop the buildings. This study investigates several variants of the relocation problem in single machine scheduling so as to minimize the makespan. Scheduling with release date constraint

APA, Harvard, Vancouver, ISO, and other styles

14

Chiang, Shao-Chuan, and 江紹詮. "Makespan Minimization for Two-Machine Flow-Shop Scheduling with Batch Delivery." Thesis, 2005. http://ndltd.ncl.edu.tw/handle/06211898753838112681.

Full text

Abstract:

碩士<br>國立成功大學<br>工業與資訊管理學系碩博士班<br>93<br>This study considers a class of the two-stage scheduling problem in which the first stage is job production and the second stage is job delivery. The focus is on the study of the integration of production scheduling with delivery of finished products to customers. In our study, we considering a two-machine flow-shop problem in which the processing time are the same for each machine and the finished jobs are delivered to one or two customers’ area. We propose two heuristic algorithms which incorporate the first fit decreasing (FFD) algorithm to classify jo

APA, Harvard, Vancouver, ISO, and other styles

15

Huang, Guo-You, and 黃國祐. "Makespan minimization for unrelated parallel machine problem with sequence dependent setup times." Thesis, 2009. http://ndltd.ncl.edu.tw/handle/87602826212742924334.

Full text

Abstract:

碩士<br>國立臺灣科技大學<br>工業管理系<br>97<br>This thesis focuses on an unrelated parallel machine scheduling problem with sequence dependent setup times. The objective of the problem is to minimize the makespan. Due to the complexity of the problem, finding optimal solutions for large problems is very difficult, and hence we develop a heuristic based on penalty to obtain a good solution. To further improve the solution, we propose a metaheuristic that uses variable neighborhood search (VNS) with three different local searches. By examining the benchmark problem instances, the method we proposed in this th

APA, Harvard, Vancouver, ISO, and other styles

16

Yeh, Pei-Ghun, and 葉姵君. "A Heuristic Algorithm for Makespan Minimization of a Flow Shop Scheduling Problem - A Study on Master Production Schedule in TFT-LCD Company." Thesis, 2013. http://ndltd.ncl.edu.tw/handle/90977795397884980264.

Full text

Abstract:

碩士<br>中原大學<br>工業與系統工程研究所<br>101<br>The main purpose of this thesis is to solve the flow shop scheduling problems in LCD manufacturing company. A heuristic algorithm is proposed to minimize both the idle time of machines and makespan. In order to evaluate the effectiveness of the heuristic, we compare it with Nawaz heuristic and CDS heuristic. Numerical experiments show that the heuristic provides a satisfactory result. To compare each algorithm by minimum makespan, the result of experimentation shows that the new heuristic algorithm is the same as Nawaz algorithm (both 792sec), and is 18sec fa

APA, Harvard, Vancouver, ISO, and other styles

17

Terekhov, Daria. "Integrating Combinatorial Scheduling with Inventory Management and Queueing Theory." Thesis, 2013. http://hdl.handle.net/1807/36017.

Full text

Abstract:

The central thesis of this dissertation is that by combining classical scheduling methodologies with those of inventory management and queueing theory we can better model, understand and solve complex real-world scheduling problems. In part II of this dissertation, we provide models of a realistic supply chain scheduling problem that capture both its combinatorial nature and its dependence on inventory availability. We present an extensive empirical evaluation of how well implementations of these models in commercially available software solve the problem. We are therefore able to address, wit

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!