6,497 research outputs found
The relevance of outsourcing and leagile strategies in performance optimization of an integrated process planning and scheduling
Over the past few years growing global competition has forced the manufacturing industries to upgrade their old production strategies with the modern day approaches. As a result, recent interest has been developed towards finding an appropriate policy that could enable them to compete with others, and facilitate them to emerge as a market winner. Keeping in mind the abovementioned facts, in this paper the authors have proposed an integrated process planning and scheduling model inheriting the salient features of outsourcing, and leagile principles to compete in the existing market scenario. The paper also proposes a model based on leagile principles, where the integrated planning management has been practiced. In the present work a scheduling problem has been considered and overall minimization of makespan has been aimed. The paper shows the relevance of both the strategies in performance enhancement of the industries, in terms of their reduced makespan. The authors have also proposed a new hybrid Enhanced Swift Converging Simulated Annealing (ESCSA) algorithm, to solve the complex real-time scheduling problems. The proposed algorithm inherits the prominent features of the Genetic Algorithm (GA), Simulated Annealing (SA), and the Fuzzy Logic Controller (FLC). The ESCSA algorithm reduces the makespan significantly in less computational time and number of iterations. The efficacy of the proposed algorithm has been shown by comparing the results with GA, SA, Tabu, and hybrid Tabu-SA optimization methods
A Framework for Differential Frame-Based Matching Algorithms in Input-Queued Switches
This article is made available under terms and conditions applicable to Open Access Policy Articl
Multicast Multigroup Precoding and User Scheduling for Frame-Based Satellite Communications
The present work focuses on the forward link of a broadband multibeam
satellite system that aggressively reuses the user link frequency resources.
Two fundamental practical challenges, namely the need to frame multiple users
per transmission and the per-antenna transmit power limitations, are addressed.
To this end, the so-called frame-based precoding problem is optimally solved
using the principles of physical layer multicasting to multiple co-channel
groups under per-antenna constraints. In this context, a novel optimization
problem that aims at maximizing the system sum rate under individual power
constraints is proposed. Added to that, the formulation is further extended to
include availability constraints. As a result, the high gains of the sum rate
optimal design are traded off to satisfy the stringent availability
requirements of satellite systems. Moreover, the throughput maximization with a
granular spectral efficiency versus SINR function, is formulated and solved.
Finally, a multicast-aware user scheduling policy, based on the channel state
information, is developed. Thus, substantial multiuser diversity gains are
gleaned. Numerical results over a realistic simulation environment exhibit as
much as 30% gains over conventional systems, even for 7 users per frame,
without modifying the framing structure of legacy communication standards.Comment: Accepted for publication to the IEEE Transactions on Wireless
Communications, 201
Architectural support for task dependence management with flexible software scheduling
The growing complexity of multi-core architectures has motivated a wide range of software mechanisms to improve the orchestration of parallel executions. Task parallelism has become a very attractive approach thanks to its programmability, portability and potential for optimizations. However, with the expected increase in core counts, finer-grained tasking will be required to exploit the available parallelism, which will increase the overheads introduced by the runtime system. This work presents Task Dependence Manager (TDM), a hardware/software co-designed mechanism to mitigate runtime system overheads. TDM introduces a hardware unit, denoted Dependence Management Unit (DMU), and minimal ISA extensions that allow the runtime system to offload costly dependence tracking operations to the DMU and to still perform task scheduling in software. With lower hardware cost, TDM outperforms hardware-based solutions and enhances the flexibility, adaptability and composability of the system. Results show that TDM improves performance by 12.3% and reduces EDP by 20.4% on average with respect to a software runtime system. Compared to a runtime system fully implemented in hardware, TDM achieves an average speedup of 4.2% with 7.3x less area requirements and significant EDP reductions. In addition, five different software schedulers are evaluated with TDM, illustrating its flexibility and performance gains.This work has been supported by the RoMoL ERC Advanced Grant (GA 321253), by the European HiPEAC Network of Excellence, by the Spanish Ministry of Science and
Innovation (contracts TIN2015-65316-P, TIN2016-76635-C2-2-R and TIN2016-81840-REDT), by the Generalitat de Catalunya (contracts 2014-SGR-1051 and 2014-SGR-1272), and by the European Unionâs Horizon 2020 research and innovation programme under grant agreement No 671697 and No. 671610. M. MoretĂł has been partially supported by the Ministry of Economy and Competitiveness under Juan de la Cierva postdoctoral fellowship number JCI-2012-15047.Peer ReviewedPostprint (author's final draft
Executing Bag of Distributed Tasks on the Cloud: Investigating the Trade-offs Between Performance and Cost
Bag of Distributed Tasks (BoDT) can benefit from decentralised execution on
the Cloud. However, there is a trade-off between the performance that can be
achieved by employing a large number of Cloud VMs for the tasks and the
monetary constraints that are often placed by a user. The research reported in
this paper is motivated towards investigating this trade-off so that an optimal
plan for deploying BoDT applications on the cloud can be generated. A heuristic
algorithm, which considers the user's preference of performance and cost is
proposed and implemented. The feasibility of the algorithm is demonstrated by
generating execution plans for a sample application. The key result is that the
algorithm generates optimal execution plans for the application over 91\% of
the time
Revenue Management and Demand Fulfillment: Matching Applications, Models, and Software
Recent years have seen great successes of revenue management, notably in the airline, hotel, and car rental business. Currently, an increasing number of industries, including manufacturers and retailers, are exploring ways to adopt similar concepts. Software companies are taking an active role in promoting the broadening range of applications. Also technological advances, including smart shelves and radio frequency identification (RFID), are removing many of the barriers to extended revenue management. The rapid developments in Supply Chain Planning and Revenue Management software solutions, scientific models, and industry applications have created a complex picture, which appears not yet to be well understood. It is not evident which scientific models fit which industry applications and which aspects are still missing. The relation between available software solutions and applications as well as scientific models appears equally unclear. The goal of this paper is to help overcome this confusion. To this end, we structure and review three dimensions, namely applications, models, and software. Subsequently, we relate these dimensions to each other and highlight commonalities and discrepancies. This comparison also provides a basis for identifying future research needs.Manufacturing;Revenue Management;Software;Advanced Planning Systems;Demand Fulfillment
- âŠ