Literatura académica sobre el tema "Single Machine Total Tardiness Problem"
Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros
Consulte las listas temáticas de artículos, libros, tesis, actas de conferencias y otras fuentes académicas sobre el tema "Single Machine Total Tardiness Problem".
Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.
También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.
Artículos de revistas sobre el tema "Single Machine Total Tardiness Problem"
Tian, Z. J., C. T. Ng y T. C. E. Cheng. "On the single machine total tardiness problem". European Journal of Operational Research 165, n.º 3 (septiembre de 2005): 843–46. http://dx.doi.org/10.1016/j.ejor.2004.03.017.
Texto completoHuang, Xiaolin, Horim Ha y Shuning Wang. "An inequality for single machine total tardiness problem". IFAC Proceedings Volumes 44, n.º 1 (enero de 2011): 8201–4. http://dx.doi.org/10.3182/20110828-6-it-1002.00814.
Texto completoSzwarc, Wlodzimierz y Samar K. Mukhopadhyay. "Decomposition of the single machine total tardiness problem". Operations Research Letters 19, n.º 5 (noviembre de 1996): 243–50. http://dx.doi.org/10.1016/s0167-6377(96)00031-4.
Texto completoSzwarc, Wlodzimierz, Federico Della Croce y Andrea Grosso. "Solution of the single machine total tardiness problem". Journal of Scheduling 2, n.º 2 (marzo de 1999): 55–71. http://dx.doi.org/10.1002/(sici)1099-1425(199903/04)2:2<55::aid-jos14>3.0.co;2-5.
Texto completoOyetunji, Elkanah y Ayodeji E. Oluleye. "Minimizing Total Earliness and Total Tardiness on Single Machine with Release Dates". International Journal of Engineering Research in Africa 5 (julio de 2011): 30–43. http://dx.doi.org/10.4028/www.scientific.net/jera.5.30.
Texto completoTansel, B. C. y I. Sabuncuoglu. "New Insights on the Single Machine Total Tardiness Problem". Journal of the Operational Research Society 48, n.º 1 (enero de 1997): 82. http://dx.doi.org/10.2307/3009947.
Texto completoTansel, B. C. y I. Sabuncuoglu. "New insights on the single machine total tardiness problem". Journal of the Operational Research Society 48, n.º 1 (enero de 1997): 82–89. http://dx.doi.org/10.1057/palgrave.jors.2600321.
Texto completoTansel, B. C. y I. Sabuncuoglu. "New insights on the single machine total tardiness problem". Journal of the Operational Research Society 48, n.º 1 (1997): 82–0089. http://dx.doi.org/10.1038/sj.jors.2600321.
Texto completoSzwarc, Wlodzimierz, Andrea Grosso y Federico Della Croce. "Algorithmic paradoxes of the single-machine total tardiness problem". Journal of Scheduling 4, n.º 2 (2001): 93–104. http://dx.doi.org/10.1002/jos.69.
Texto completoHE, CHENG, YIXUN LIN y JINJIANG YUAN. "SOME IMPROVED ALGORITHMS ON THE SINGLE MACHINE HIERARCHICAL SCHEDULING WITH TOTAL TARDINESS AS THE PRIMARY CRITERION". Asia-Pacific Journal of Operational Research 27, n.º 05 (octubre de 2010): 577–85. http://dx.doi.org/10.1142/s0217595910002867.
Texto completoTesis sobre el tema "Single Machine Total Tardiness Problem"
Bauer, Andreas, Bernd Bullnheimer, Richard F. Hartl y Christine Strauß. "Applying ant colony optimization to solve the single machine total tardiness problem". SFB Adaptive Information Systems and Modelling in Economics and Management Science, WU Vienna University of Economics and Business, 1999. http://epub.wu.ac.at/1368/1/document.pdf.
Texto completoSeries: Report Series SFB "Adaptive Information Systems and Modelling in Economics and Management Science"
Tahboub, Zainel-Abideen Abdul-Majid. "Sequencing to minimize total earliness-tardiness penalties on a single-machine /". The Ohio State University, 1986. http://rave.ohiolink.edu/etdc/view?acc_num=osu1487266362338743.
Texto completoRODRIGUES, GUSTAVO SIMAO. "SINGLE MACHINE SCHEDULING PROBLEM WITH SEQUENCE DEPENDENT SETUP TIMES, WITH EARLINESS AND TARDINESS PENALTIES: A CASE STUDY IN A MACHINING PROCESS". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2012. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=19669@1.
Texto completoA dissertação estuda o problema do sequenciamento de uma única máquina com tempos de preparação dependentes da sequência da produção e penalidades por antecipação e atraso. Ilustra um método com uma aplicação a um exemplo de processo de fabricação por usinagem. Dessa forma, pretende-se reunir as metodologias de resolução e os trabalhos existentes na literatura sobre o Problema do Sequenciamento e aplicar ao caso específico de um dos Processos de Fabricação mais comuns existentes na indústria.
The dissertation studies the single machine scheduling problem with sequence dependent setup times, with earliness and tardiness penalties, applied to an example of Machining Process Manufacturing. Thus, it is intended to collect the methodologies of resolution and main studies in the literature about the Problem of Sequencing and apply to the specific case of one of the most common manufacturing processes existing in the industry.
Chou, Ying-Chun y 周盈君. "Variable Neighborhood Search for the Single Machine Total Stepwise Tardiness Problem". Thesis, 2009. http://ndltd.ncl.edu.tw/handle/99771177297163747799.
Texto completo朝陽科技大學
工業工程與管理系碩士班
97
Over the past scheduling study, all the studies on this subject assume that the tardiness of jobs is a linear tardiness cost function. However, the stepwise tardiness cost function usually exists in many real-life situations, i.e., buyers usually provide several late periods. At the different late periods, firms would pay the different fixed tardiness cost. In this study, the new criterion of scheduling is called stepwise tardiness cost. We will investigate stepwise tardiness criterion in a single machine scheduling problem. First of all, we propose two heuristics to solve the problem. Two heuristics use the SPT and EDD rule as the initial solutions, respectively. In order to obtain good solutions, we also develop a variable neighborhood search (VNS). In VNS algorithm, we develop a new encoding scheme to represent a feasible solution and propose three different neighborhood structures. In particularly, one of the neighborhood structures is based on memory-based mechanism. The experimental results show that the proposed heuristics and VNS algorithm can obtain a good performance for solving this scheduling problem.
"Applying ant colony optimization to solve the single machine total tardiness problem". SFB Adaptive Information Systems and Modelling in Economics and Management Science, 1999. http://epub.wu-wien.ac.at/dyn/dl/wp/epub-wu-01_1dd.
Texto completoliu, Yi-Ting y 劉宜婷. "Multiple Variable Neighborhood Search for the Single Machine Total Weighted Tardiness Problem". Thesis, 2010. http://ndltd.ncl.edu.tw/handle/81833659341899050128.
Texto completo國立臺灣科技大學
工業管理系
98
In recent years, meta-heuristics are common and very popular methods in the industry to solve highly complex problems in different areas, such as production scheduling, logistic distribution, and capacity planning. However, most of the meta-heuristics are too complicated to understand and implement. Therefore, this paper proposes an easy-to-understand meta-heuristic, called multiple Variable Neighborhood Search (m-VNS). The single machine total weighted tardiness (SMTWT) problem is a typical discrete combinatorial optimization problem in the scheduling literature. The m-VNS will be used to solve this well-known problem and compared with several existing famous algorithms. Finally, we found m-VNS algorithm has an excellent performance and is of better results in the solution quality and computational time better than those reported previously in the literature. This research has demonstrated that the m-VNS meta-heuristic can be efficiently and effectively applied to the SMTWT problem.
Chen, Hsia-Hsiang y 陳夏祥. "Ant Colony System for the Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setups". Thesis, 2002. http://ndltd.ncl.edu.tw/handle/88275802019118675727.
Texto completo國立臺灣科技大學
工業管理系
90
Ant colony system (ACS) is one of the most recent meta-heuristics for combinatorial optimization problems. In this paper, an ACS algorithm is proposed for the single machine total weighted tardiness problem with sequence-dependent setup times. To the best of our knowledge, this is the first attempt to propose an improved heuristic, as opposed to the construction heuristic, for this problem. To verify the developed algorithm, computational experiments were conducted on different sizes of problems. The experimental results show that the algorithm find optimal solutions for almost all small size problems. For large size problems, the algorithm significantly improves the best solutions obtained by the construction heuristics. Furthermore, we incorporate different dispatching rules into our ACS algorithm. The results verify that the proposed algorithm is an efficient and effective method for this problem.
Fan, Su-Hao y 范書豪. "An I Ching optimization for the single machine total weighted tardiness problem with sequence dependent setup times". Thesis, 2013. http://ndltd.ncl.edu.tw/handle/42319073688908857772.
Texto completoYang, Sheng-Fa y 楊盛發. "Two-Machine No-wait Total Tardiness Flowshop Scheduling Problem". Thesis, 2006. http://ndltd.ncl.edu.tw/handle/ugkp89.
Texto completo朝陽科技大學
工業工程與管理系碩士班
94
Abstract The flowshop scheduling problem can be stated as follows. There are n independent jobs and m different machines. There is a common restriction on the order in which the operations of a job are to be performed. Each machine can process at most one job at a time and each job can be processed on one machine at a time. Flowshop scheduling is often encountered in mass production systems. Scheduling problems with no-wait constraints occur in many industries. For instance, in hot metal rolling industries , where the heated metal has to undergo a series of operations at continuously high temperatures before it is cooled in order to prevent defects. Similarly , in the plastic molding and silverware production industries, a series of operations must be performed to immediately follow one another to prevent degradation. We consider the performance measure of total tardinesss in a two-machine no-wait flow shop environment. In our research, we present a heuristic solution method for solving large-scaled problems. We also develop a branch and bound algorithm. We use an upper bound based on the heuristic algorithm developed, and propose some dominance rules to help pruning unpromising nodes in the branch-and-bound search tree. Finally, computational experiments are conducted to evaluate the performances of the proposed algorithms. As the result, branch-and-bound algorithm can only solve to the optimum solution small-scaled problems. When the number of jobs equals to 25, the average error of heuristic solution is 6%. The average error of lower bound is about 11%. The developed dominance rules help reducing 16%~20% nodes in the branch-and-bound search tree. Besides, our research examines two special cases of bottleneck-machine. It is showed that both heuristic solution and lower bound coincide with the optimum solution in great majority problems with bottleneck-machine. Therefore, problems with bottleneck-machine become easier to solve.
Gonçalves, Tomás Cabrita. "Two Metaheuristics for the Single-Machine Quadratic Tardiness Scheduling Problem". Master's thesis, 2012. https://repositorio-aberto.up.pt/handle/10216/66535.
Texto completoCapítulos de libros sobre el tema "Single Machine Total Tardiness Problem"
Zgurovsky, Michael Z. y Alexander A. Pavlov. "The Total Weighted Tardiness of Tasks Minimization on a Single Machine". En Combinatorial Optimization Problems in Planning and Decision Making, 107–217. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98977-8_4.
Texto completoFatih Tasgetiren, M., Hande Öztop, Uğur Eliiyi, Deniz Türsel Eliiyi y Quan-Ke Pan. "Energy-Efficient Single Machine Total Weighted Tardiness Problem with Sequence-Dependent Setup Times". En Intelligent Computing Theories and Application, 746–58. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-95930-6_76.
Texto completoTasgetiren, M. Fatih, Quan-Ke Pan, P. N. Suganthan, Yun-Chia Liang y Tay Jin Chua. "Metaheuristics for Common due Date Total Earliness and Tardiness Single Machine Scheduling Problem". En Computational Intelligence in Flow Shop and Job Shop Scheduling, 301–40. Berlin, Heidelberg: Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-02836-6_10.
Texto completoBożejko, Wojciech, Paweł Rajba y Mieczysław Wodecki. "Robustness of the Uncertain Single Machine Total Weighted Tardiness Problem with Elimination Criteria Applied". En Contemporary Complex Systems and Their Dependability, 94–103. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-91446-6_10.
Texto completoBożejko, Wojciech, Jarosław Pempera, Mariusz Uchroński y Mieczysław Wodecki. "Parallel Block-Based Simulated Annealing for the Single Machine Total Weighted Tardiness Scheduling Problem". En 16th International Conference on Soft Computing Models in Industrial and Environmental Applications (SOCO 2021), 758–65. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-87869-6_72.
Texto completoZgurovsky, Michael Z. y Alexander A. Pavlov. "The Total Earliness/Tardiness Minimization on a Single Machine with Arbitrary Due Dates". En Combinatorial Optimization Problems in Planning and Decision Making, 219–63. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98977-8_5.
Texto completoBożejko, Wojciech, Jarosław Pempera, Mariusz Uchroński y Mieczysław Wodecki. "Distributed Quantum Annealing on D-Wave for the Single Machine Total Weighted Tardiness Scheduling Problem". En Computational Science – ICCS 2022, 171–78. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-031-08760-8_15.
Texto completoParsopoulos, K. E. y M. N. Vrahatis. "Studying the Performance of Unified Particle Swarm Optimization on the Single Machine Total Weighted Tardiness Problem". En Lecture Notes in Computer Science, 760–69. Berlin, Heidelberg: Springer Berlin Heidelberg, 2006. http://dx.doi.org/10.1007/11941439_80.
Texto completoKolliopoulos, Stavros G. y George Steiner. "On Minimizing the Total Weighted Tardiness on a Single Machine". En Lecture Notes in Computer Science, 176–86. Berlin, Heidelberg: Springer Berlin Heidelberg, 2004. http://dx.doi.org/10.1007/978-3-540-24749-4_16.
Texto completoPetrynski, Kacper, Robert Szost, Iwona Pozniak-Koszalka, Leszek Koszalka y Andrzej Kasprzak. "Single Machine Weighted Tardiness Problem: An Algorithm and Experimentation System". En Computational Collective Intelligence, 36–44. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-98446-9_4.
Texto completoActas de conferencias sobre el tema "Single Machine Total Tardiness Problem"
Minukhin, Sergii. "Efficient method for single machine total tardiness problem". En 2012 IV International Conference "Problems of Cybernetics and Informatics" (PCI). IEEE, 2012. http://dx.doi.org/10.1109/icpci.2012.6486283.
Texto completoFerrolho, Antonio y Manuel Crisostomo. "Single Machine Total Weighted Tardiness Problem with Genetic Algorithms". En 2007 IEEE/ACS International Conference on Computer Systems and Applications. IEEE, 2007. http://dx.doi.org/10.1109/aiccsa.2007.370857.
Texto completoFerrolho, Antonio y Manuel Crisostomo. "Genetic Algorithm for the Single Machine Total Weighted Tardiness Problem". En 2006 1ST IEEE International Conference on E-Learning in Industrial Electronics. IEEE, 2006. http://dx.doi.org/10.1109/icelie.2006.347205.
Texto completoChaabane, Lamiche. "A cooperative solver for single machine total weighted tardiness scheduling problem". En 2017 First International Conference on Embedded & Distributed Systems (EDiS). IEEE, 2017. http://dx.doi.org/10.1109/edis.2017.8284043.
Texto completoChaabane, Lamiche. "A cooperative solver for single machine total weighted tardiness scheduling problem". En 2018 International Symposium on Programming and Systems (ISPS). IEEE, 2018. http://dx.doi.org/10.1109/isps.2018.8379016.
Texto completoFu, Qunjie y Tsui-Ping Chung. "A new approach for solving single machine total weighted tardiness (SMTWT) problem". En 2016 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2016. http://dx.doi.org/10.1109/ieem.2016.7797913.
Texto completoTseng, Chao-Tang, Ying-Chun Chou y Ying-Chun Chou. "A Variable Neighborhood Search for the Single Machine Total Stepwise Tardiness Problem". En International Conference on Engineering, Project, and Production Management. Association of Engineering, Project, and Production Management, 2010. http://dx.doi.org/10.32738/ceppm.201010.0011.
Texto completoKongkaew, Wanatchapong. "Solving the single machine total weighted tardiness problem using bat-inspired algorithm". En 2015 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM). IEEE, 2015. http://dx.doi.org/10.1109/ieem.2015.7385649.
Texto completoYahyaoui, Hiba, Saoussen Krichen, Bilel Derbel y El-Ghazali Talbi. "A Variable Neighborhood Descent for solving the Single Machine Total Weighted Tardiness Problem". En 2013 5th International Conference on Modeling, Simulation and Applied Optimization (ICMSAO 2013). IEEE, 2013. http://dx.doi.org/10.1109/icmsao.2013.6552673.
Texto completoBijari, Mehdi y Omid Rajabi. "Minimizing total weighted tardiness in single machine problem with non-identical job sizes". En 2015 International Conference on Industrial Engineering and Operations Management (IEOM). IEEE, 2015. http://dx.doi.org/10.1109/ieom.2015.7093753.
Texto completo