Catalogue Search | MBRL
Search Results Heading
Explore the vast range of titles available.
MBRLSearchResults
-
DisciplineDiscipline
-
Is Peer ReviewedIs Peer Reviewed
-
Series TitleSeries Title
-
Reading LevelReading Level
-
YearFrom:-To:
-
More FiltersMore FiltersContent TypeItem TypeIs Full-Text AvailableSubjectCountry Of PublicationPublisherSourceTarget AudienceDonorLanguagePlace of PublicationContributorsLocation
Done
Filters
Reset
59,190
result(s) for
"processing time"
Sort by:
Scheduling jobs with a V-shaped time-dependent processing time
2020
In the field of time-dependent scheduling, a job’s processing time is specified by a function of its start time. While monotonic processing time functions are well-known in the literature, this paper introduces non-monotonic functions with a convex, piecewise-linear V-shape similar to the absolute value function. They are minimum at an ideal start time, which is the same for all given jobs. Then, the processing time equals the job’s basic processing time. Earlier or later, it increases linearly with slopes that can be asymmetric and job-specific. The objective is to sequence the given jobs on a single machine and minimize the makespan. This is motivated by production planning of moving car assembly lines, in particular, to sequence a worker’s assembly operations such that the time-dependent walking times to gather materials from the line-side is minimized. This paper characterizes the problem’s computational complexity in several angles. NP-hardness is observed even if the two slopes are the same for all jobs. A fully polynomial time approximation scheme is devised for the more generic case of agreeable ratios of basic processing time and slopes. In the most generic case with job-specific slopes, several polynomial cases are identified.
Journal Article
Multi-Objective Flexible Flow Shop Scheduling Problem Considering Variable Processing Time due to Renewable Energy
2018
Renewable energy is an alternative to non-renewable energy to reduce the carbon footprint of manufacturing systems. Finding out how to make an alternative energy-efficient scheduling solution when renewable and non-renewable energy drives production is of great importance. In this paper, a multi-objective flexible flow shop scheduling problem that considers variable processing time due to renewable energy (MFFSP-VPTRE) is studied. First, the optimization model of the MFFSP-VPTRE is formulated considering the periodicity of renewable energy and the limitations of energy storage capacity. Then, a hybrid non-dominated sorting genetic algorithm with variable local search (HNSGA-II) is proposed to solve the MFFSP-VPTRE. An operation and machine-based encoding method is employed. A low-carbon scheduling algorithm is presented. Besides the crossover and mutation, a variable local search is used to improve the offspring’s Pareto set. The offspring and the parents are combined and those that dominate more are selected to continue evolving. Finally, two groups of experiments are carried out. The results show that the low-carbon scheduling algorithm can effectively reduce the carbon footprint under the premise of makespan optimization and the HNSGA-II outperforms the traditional NSGA-II and can solve the MFFSP-VPTRE effectively and efficiently.
Journal Article
Coupled task scheduling with time-dependent processing times
2021
The single machine coupled task scheduling problem includes a set of jobs, each with two separated tasks, and there is an exact delay between the tasks. We investigate the single machine coupled task scheduling problem with the objective of minimizing the makespan under identical processing time for the first task and identical delay period for all jobs, and the time-dependent processing time setting for the second task. Certain healthcare appointment scheduling problems can be modeled as the coupled task scheduling problem. Also, the incorporation of time-dependent processing time for the second task lets the human resource fatigue and the deteriorating health conditions be modeled. We provide optimal solution under certain conditions. In addition, we propose a dynamic program under the condition that the majority of jobs share the same time-dependent characteristic. We develop a heuristic for the general case and show that the heuristic performs well.
Journal Article
Augmented reality : an emerging technologies guide to AR
by
Rampolla, Joseph
,
Kipper, Gregory
in
Augmented reality
,
Computer graphics
,
Human-computer interaction
2013,2012
With the explosive growth in mobile phone usage and rapid rise in search engine technologies over the last decade, augmented reality (AR) is poised to be one of this decade's most disruptive technologies, as the information that is constantly flowing around us is brought into view, in real-time, through augmented reality.
Reactive design patterns
by
Kuhn, Roland, 1977- author
,
Hanafee, Brian, author
,
Allen, Jamie (Programming language creator), author
in
Electronic data processing Distributed processing.
,
Embedded computer systems.
,
Real-time data processing.
2017
Modern distributed applications must deliver realtime performance while managing big data and high user loads spread across environments ranging from cloud systems to mobile devices. Unlike traditional enterprise applications which focus on decoupling their internal components by defining programming interfaces, reactive applications decouple their components also at runtime. This makes it possible to react effectively and efficiently to failures, varying user demands, and changes in the application's execution environment. 'Reactive Design Patterns' is a clearly-written guide for building message-driven distributed systems that are resilient, responsive, and elastic.
Moving objects databases
by
Güting, Ralf Hartmut
,
Schneider, Markus
in
Computer animation
,
Computer simulation
,
Database management
2005
Moving Objects Databases is the first uniform treatment of moving objects databases, the technology that supports GPS and RFID. It focuses on the modeling and design of data from moving objects — such as people, animals, vehicles, hurricanes, forest fires, oil spills, armies, or other objects — as well as the storage, retrieval, and querying of that very voluminous data.It includes homework assignments at the end of each chapter, exercises throughout the text that students can complete as they read, and a solutions manual in the back of the book.This book is intended for graduate or advanced undergraduate students. It is also recommended for computer scientists and database systems engineers and programmers in government, industry and academia; professionals from other disciplines, e.g., geography, geology, soil science, hydrology, urban and regional planning, mobile computing, bioterrorism and homeland security, etc.Focuses on the modeling and design of data from moving objects--such as people, animals, vehicles, hurricanes, forest fires, oil spills, armies, or other objects--as well as the storage, retrieval, and querying of that very voluminous data.Demonstrates through many practical examples and illustrations how new concepts and techniques are used to integrate time and space in database applications.Provides exercises and solutions in each chapter to enable the reader to explore recent research results in practice.