Exploració per tema "Scheduling"
Ara es mostren els items 1-20 de 149
-
A bi-objective parallel machine problem with eligibility, release dates and delivery times of the jobs
(Taylor & Francis, 2017-08-01)
Article
Accés obertThe scheduling of parallel machines is a well-known problem in many companies. Nevertheless, not always all the jobs can be manufactured in any machine and the eligibility appears. Based on a real-life problem, we present ... -
A bounded dynamic programming algorithm for the blocking flow shop problem
(IEEE Computer Society Conference Publishing Services (CPS), 2011-04-11)
Capítol de llibre
Accés restringit per política de l'editorialWe present some results attained with two variants of the bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best-known ... -
A Bounded Dynamic Programming algorithm for the Blocking Flow Shop problem
(2011)
Text en actes de congrés
Accés restringit per política de l'editorialWe present some results attained with two variants of bounded dynamic programming algorithm to solve the Fm|block|Cmax problem using as experimental data the wellknown Taillard instances. We have improved the best known ... -
A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs
(2016-02-01)
Article
Accés obertThis paper analyzes a realistic variant of the Permutation Flow-Shop Problem (PFSP) by considering a non-smooth objective function that takes into account not only the traditional makespan cost but also failure-risk costs ... -
A combined polling and ISMA-DS/CDMA protocol to provide QoS in packet mobile communications systems
(Institute of Electrical and Electronics Engineers (IEEE), 2000)
Text en actes de congrés
Accés obertThis paper presents a new mechanism that combines the flexibility of an access protocol such as ISMA-DS/CDMA with the ability of a polling mechanism to provide a specific bound for the access delay. This protocol is proposed ... -
A comparison study of different algorithms for energy-aware placement of virtual machines
(Springer, 2018)
Text en actes de congrés
Accés restringit per política de l'editorialCloud Computing services are essential to modern society. The increasing number of people and organisations using these types of services results in a higher demand in datacenters, which in turn, is raising energy consumption ... -
A cross-layer scheduling algorithm for DQCA-based WLAN systems with heterogeneous voice-data traffic
(ieee, 2005-09-30)
Comunicació de congrés
Accés restringit per política de l'editorialThis paper proposes a cross-layer priority-based scheduling algorithm for WLAN systems using the DQCA MAC protocol where heterogeneous voice-data traffic is present. In this algorithm voice users have always the highest ... -
A distance-weighted dynamic bandwidth allocation algorithm for improved performance in long-reach passive optical networks for next generation networks
(2023-08-11)
Article
Accés obertIn recent years, there has been an increasing trend towards extending the coverage of passive optical networks (PONs) over large geographical areas. Long-reach PONs (LRPONs) are capable of extending the distance covered ... -
A game-theoretic and hybrid genetic meta-heuristics model for security-assured scheduling of independent jobs in computational grids
(Institute of Electrical and Electronics Engineers (IEEE), 2010)
Text en actes de congrés
Accés obertScheduling independent tasks in Computational Grids commonly arises in many Grid-enabled large scale applications. Much of current research in this domain is focused on the improvement of the efficiency of the Grid schedulers, ... -
A general guide to applying machine learning to computer architecture
(2018)
Article
Accés obertThe resurgence of machine learning since the late 1990s has been enabled by significant advances in computing performance and the growth of big data. The ability of these algorithms to detect complex patterns in data which ... -
A hyper-heuristic for adaptive scheduling in computational grids
(2007-01)
Article
Accés obertIn this paper we present the design and implementation of an hyper-heuristic for efficiently scheduling independent jobs in computational grids. An efficient scheduling of jobs to grid resources depends on many parameters, ... -
A hyper-heuristic to sequencing mixed-models on assembly-lines minimizing work overload
(2007)
Text en actes de congrés
Accés obertThere are different approaches for the mixed-model assembly-lines sequencing problem. In this paper the goal of minimizing work overload is treated. This approach considers the existence of time windows in each work ... -
A margin adaptive scheduling algorithm for FBMC/OQAM systems
(2014)
Text en actes de congrés
Accés restringit per política de l'editorialThis paper addresses the margin adaptive problem for the filter bank multicarrier (FBMC) modulation based on the offset QAM (OQAM), referred to as FBMC/OQAM. The analysis conducted in this paper reveals that due to the ... -
A method for clustering and cooperation in wireless multimedia sensor networks
(2010-04)
Article
Accés obertWireless multimedia sensor nodes sense areas that are uncorrelated to the areas covered by radio neighbouring sensors. Thus, node clustering for coordinating multimedia sensing and processing cannot be based on classical ... -
A multistage graph-based procedure for solving a just-in-time flexible job-shop scheduling problem with machine and time-dependent processing costs
(2018-04-01)
Article
Accés obertThis paper deals with a new flexible job-shop scheduling problem in which the objective function to be minimised is the sum of the earliness and tardiness costs of the jobs and the costs of the operations required to perform ... -
A near-optimum cross-layered distributed queuing protocol for wireless LAN: medium access control protocols for wireless LANs
(IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2008-02)
Article
Accés obertDistributed Queuing Collision Avoidance (DQCA) is a distributed MAC protocol for WLAN systems that offers near optimum performance. The protocol implements a reservation scheme that ensures collision-free data transmissions ... -
A new approach for solving capacitated lot sizing and scheduling problem with sequence and period-dependent setup costs
(School of Industrial and Aeronautic Engineering of Terrassa (ETSEIAT). Universitat Politècnica de Catalunya (UPC), 2013-12)
Article
Accés obertPurpose: We aim to examine the capacitated multi-item lot sizing problem which is a typical example of a large bucket model, where many different items can be produced on the same machine in one time period. We propose a ... -
A novel near-optimum medium acces control protocol for a distributed cooperative ARQ scheme in wireless networks
(Institute of Electrical and Electronics Engineers (IEEE), 2008-09-30)
Comunicació de congrés
Accés restringit per política de l'editorialThe distributed queuing MAC protocol for cooperative networks (DQCOOP) is presented in this paper as an innovative MAC protocol designed to coordinate the relay retransmissions in a cooperative automatic retransmission ... -
A procedure based on branch-and-bound for the Cyclic Hoist Scheduling Problem with n types of product
(2015)
Text en actes de congrés
Accés obertWhen various kinds of products must receive the sam e treatments in a production line of tanks and the size of batches is high, a cyclic manufacturing composed of a job from each batch can ... -
A production scheduling service for manufacturing short-run series on machining shops
(Universitat Politècnica de Catalunya, 2019-09-29)
Projecte Final de Màster Oficial
Accés restringit per decisió de l'autorThe scheduling process on every production line is of principal importance as it directly affects the productivity of a company. For decades now, operational research has offered managers tools to automate their scheduling ...