Business Service Scheduling

2010 ◽  
Vol 1 (4) ◽  
pp. 52-63
Author(s):  
Jürgen Dorn
Keyword(s):  
Optimal Solution ◽  
Service Level ◽  
Service Process ◽  
Soft Constraints ◽  
Scheduling Problem ◽  
Business Service ◽  
Business Services ◽  
Service Scheduling ◽  
Production Processes ◽  
Hard Constraints

The management and predictive planning of the processes to create business services is more difficult than the planning of production processes, because services cannot be produced in stock and customers are involved in their creation. In this paper, the author proposes a method for service scheduling and optimization based on an ontology to describe business services and related concepts. The author schedules operations required to create a service. With each service process and its operations, soft and hard constraints on the execution of operations and the required resources are posted. These constraints are derived from service level agreements. A legal plan must then satisfy all hard constraints. All soft constraints are matter of optimization. Using a tabu search, a near-optimal solution of the service scheduling problem is achieved.

Business Service Scheduling

2012 ◽  
pp. 324-335
Author(s):  
Jürgen Dorn
Keyword(s):  
Optimal Solution ◽  
Service Level ◽  
Service Process ◽  
Soft Constraints ◽  
Scheduling Problem ◽  
Business Service ◽  
Business Services ◽  
Service Scheduling ◽  
Production Processes ◽  
Hard Constraints

The management and predictive planning of the processes to create business services is more difficult than the planning of production processes, because services cannot be produced in stock and customers are involved in their creation. In this paper, the author proposes a method for service scheduling and optimization based on an ontology to describe business services and related concepts. The author schedules operations required to create a service. With each service process and its operations, soft and hard constraints on the execution of operations and the required resources are posted. These constraints are derived from service level agreements. A legal plan must then satisfy all hard constraints. All soft constraints are matter of optimization. Using a tabu search, a near-optimal solution of the service scheduling problem is achieved.

scholarly journals Information-Driven Framework for Collaborative Business Service Modelling

2012 ◽  
Vol 3 (1) ◽  
pp. 1-18 ◽  
Author(s):  
Thang Le Dinh ◽  
Thanh Thoa Pham Thi
Keyword(s):  
Conceptual Framework ◽  
Relevant Literature ◽  
Service Level ◽  
System Level ◽  
Network Architectures ◽  
Business Service ◽  
Business Services ◽  
Modelling Framework ◽  
Service Creation ◽  
Service Modelling

In the context of a network of enterprises, the competitive advantage of each enterprise depends greatly on the ability to use network architectures to collaborate efficiently in business services. The paper introduces a conceptual framework, called the CBSM (Collaborative Business Service Modelling) framework, which provides an intellectual foundation for understanding thoroughly and modelling effectively collaborative business services. The paper begins by presenting the necessity for and principles of the conceptual framework. Then it presents the architecture of the CBSM framework that consists of three different levels: the service level for service operation, the service system level for service creation, and the service value creation network level for service proposal. The paper continues with a discussion and review of the relevant literature, followed by the conclusion and suggestions for further research.

Collaboration-Based Model-Driven Approach for Business Service Composition

2012 ◽  
pp. 594-617
Author(s):  
Surya Bahadur Kathayat ◽  
Hien Nam Le ◽  
Rolv Bræk
Keyword(s):  
Service Composition ◽  
Business Processes ◽  
Service Process ◽  
Global Behavior ◽  
Business Service ◽  
Business Services ◽  
Reusable Components ◽  
Model Driven ◽  
Activity Diagrams ◽  
Model Driven Approach

The authors of this chapter argue that business processes can be modeled in the same way as collaborative business services, and therefore use an approach developed for such services. They consider business services that are collaborative and crosscutting in nature; several participants may collaborate in a business service to achieve its goal, and a participant may take part in several different business services, playing different roles in each. A framework to support the development and composition of such business services is the main focus of this chapter. The authors use UML collaborations for modeling the structure of roles involved in a business service/process, and activity diagrams for specifying the global behavior performed by the roles. From these models, reusable components realizing the roles can be automatically synthesized, and such components can then be composed together in order to make different systems that meet the requirements of business services.

scholarly journals Courses timetabling based on hill climbing algorithm

2020 ◽  
Vol 10 (6) ◽  
pp. 6558
Author(s):  
Abdoul Rjoub
Keyword(s):  
Optimal Solution ◽  
Initial Solution ◽  
Hill Climbing ◽  
Soft Constraints ◽  
Hill Climbing Algorithm ◽  
Hard Constraints ◽  
Side Constraints ◽  
Time Requirements ◽  
Hard And Soft Constraints ◽  
Hill Climbing Algorithms

In addition to its monotonous nature and excessive time requirements, the manual school timetable scheduling often leads to more than one class being assigned to the same instructor, or more than one instructor being assigned to the same classroom during the same slot time, or even leads to exercise in intentional partialities in favor of a particular group of instructors. In this paper, an automated school timetable scheduling is presented to help overcome the traditional conflicts inherent in the manual scheduling approach. In this approach, hill climbing algorithms have been modified to transact hard and soft constraints. Soft constraints are not easy to be satisfied typically, but hard constraints are obligated. The implementation of this technique has been successfully experimented in different schools with various kinds of side constraints. Results show that the initial solution can be improved by 72% towards the optimal solution within the first 5 seconds and by 50% from the second iteration while the optimal solution will be achieved after 15 iterations ensuring that more than 50% of scientific courses will take place in the early slots time while more than 50% of non-scientific courses will take place during the later time's slots.

Collaborative Business Service Modelling and Improving

2014 ◽  
pp. 128-147 ◽  
Author(s):  
Thang Le Dinh ◽  
Thanh Thoa Pham Thi
Keyword(s):  
Relevant Literature ◽  
Service Level ◽  
System Level ◽  
Network Architectures ◽  
Business Service ◽  
Business Services ◽  
Conceptual Foundation ◽  
Service Creation ◽  
Service Modelling ◽  
Different Dimensions

In the context of globalization, the competitive advantage of each service enterprise depends greatly on the ability to use network architectures to collaborate efficiently in business services. The chapter aims at introducing an information-driven approach that provides a conceptual foundation for modelling effectively and improving incrementally collaborative business services. The chapter begins by presenting the necessity for and principles of the information-driven approach. Then it presents the business service foundation for the proposed approach that consists of three different dimensions: 1) service proposal, corresponding to the service value creation network level, 2) service creation, corresponding to the service system level, and 3) service operation, corresponding to the service level. The chapter continues with a discussion and review of the relevant literature, followed by the conclusion and suggestions for further research.

Optimal broadcast scheduling method for VANETs: An adaptive discrete firefly approach

2020 ◽  
Vol 39 (6) ◽  
pp. 8125-8137
Author(s):  
Jackson J Christy ◽  
D Rekha ◽  
V Vijayakumar ◽  
Glaucio H.S. Carvalho
Keyword(s):  
Intelligent Transportation System ◽  
Search Algorithm ◽  
Mac Protocol ◽  
High Mobility ◽  
Optimal Solution ◽  
Cuckoo Search ◽  
Cuckoo Search Algorithm ◽  
Traffic Density ◽  
Scheduling Problem ◽  
Broadcast Scheduling

Vehicular Adhoc Networks (VANET) are thought-about as a mainstay in Intelligent Transportation System (ITS). For an efficient vehicular Adhoc network, broadcasting i.e. sharing a safety related message across all vehicles and infrastructure throughout the network is pivotal. Hence an efficient TDMA based MAC protocol for VANETs would serve the purpose of broadcast scheduling. At the same time, high mobility, influential traffic density, and an altering network topology makes it strenuous to form an efficient broadcast schedule. In this paper an evolutionary approach has been chosen to solve the broadcast scheduling problem in VANETs. The paper focusses on identifying an optimal solution with minimal TDMA frames and increased transmissions. These two parameters are the converging factor for the evolutionary algorithms employed. The proposed approach uses an Adaptive Discrete Firefly Algorithm (ADFA) for solving the Broadcast Scheduling Problem (BSP). The results are compared with traditional evolutionary approaches such as Genetic Algorithm and Cuckoo search algorithm. A mathematical analysis to find the probability of achieving a time slot is done using Markov Chain analysis.

scholarly journals Improving PV Resilience by Dynamic Reconfiguration in Distribution Grids: Problem Complexity and Computation Requirements

Energies ◽  
2021 ◽  
Vol 14 (4) ◽  
pp. 830
Author(s):  
Filipe F. C. Silva ◽  
Pedro M. S. Carvalho ◽  
Luís A. F. M. Ferreira
Keyword(s):  
Distributed Generation ◽  
Optimal Solution ◽  
Dynamic Reconfiguration ◽  
Scheduling Problem ◽  
Low Carbon ◽  
Distribution Grid ◽  
Medium Voltage ◽  
Classical Computing ◽  
The Impact ◽  
Distribution Grids

The dissemination of low-carbon technologies, such as urban photovoltaic distributed generation, imposes new challenges to the operation of distribution grids. Distributed generation may introduce significant net-load asymmetries between feeders in the course of the day, resulting in higher losses. The dynamic reconfiguration of the grid could mitigate daily losses and be used to minimize or defer the need for network reinforcement. Yet, dynamic reconfiguration has to be carried out in near real-time in order to make use of the most updated load and generation forecast, this way maximizing operational benefits. Given the need to quickly find and update reconfiguration decisions, the computational complexity of the underlying optimal scheduling problem is studied in this paper. The problem is formulated and the impact of sub-optimal solutions is illustrated using a real medium-voltage distribution grid operated under a heavy generation scenario. The complexity of the scheduling problem is discussed to conclude that its optimal solution is infeasible in practical terms if relying upon classical computing. Quantum computing is finally proposed as a way to handle this kind of problem in the future.

Constraint-following servo control for an underactuated mobile robot under hard constraints

2021 ◽  
pp. 095965182110248
Author(s):  
Duo Fu ◽  
Jin Huang ◽  
Wen-Bin Shangguan ◽  
Hui Yin
Keyword(s):  
Mobile Robot ◽  
Control Problem ◽  
Servo Control ◽  
Robot Motion ◽  
Soft Constraints ◽  
Rigorous Proof ◽  
Control Approach ◽  
Hard Constraints

This article formulates the control problem of underactuated mobile robot as servo constraint-following, and develops a novel constraint-following servo control approach for underactuated mobile robot under both servo soft and hard constraints. Servo soft constraints are expressed as equalities, which may be holonomic or non-holonomic. Servo hard constraints are expressed as inequalities. It is required that the underactuated mobile robot motion eventually converges to servo soft constraints, and satisfies servo hard constraints at all times. Diffeomorphism is employed to incorporate hard constraints into soft constraints, yielding new soft constraints to relax hard constraints. By this, we design a constraint-following servo control based on the new servo soft constraints, which drives the system to strictly follow the original servo soft and hard constraints. The effectiveness of the proposed approach is proved by rigorous proof and simulations.

A little help from my friends: how purchasing gains influence in complex business-to-business services: the case of legal

2017 ◽  
Vol 32 (2) ◽  
pp. 206-217 ◽  
Author(s):  
Wendy L. Tate ◽  
Lisa M. Ellram ◽  
Ulrich Schmelzle
Keyword(s):  
Supplier Management ◽  
Positive Contribution ◽  
Business Service ◽  
Case Study Method ◽  
Business Services ◽  
Content Type ◽  
Additional Costs ◽  
Service Procurement ◽  
Business To Business

Purpose The purpose of this research is to develop an understanding of how purchasing can become meaningfully involved in complex business-to-business service purchases. Design/methodology/approach A single in-depth case study method of an exemplar organization was applied to better understand the purchasing function’s role in adding to the value proposition in complex, non-traditional business-to-business service purchases. Findings Powerful allies or advocates can mediate purchasing involvement in service procurement. However, once the involvement is initiated, purchasing must make a positive contribution with respect to the specific needs and expectations of the budget owner to retain its influence. Research limitations/implications This research extends institutional theory to show how powerful allies or advocates can mediate purchasing involvement in the complex services spend. Practical implications This study describes the potential impact of purchasing’s involvement in complex services spend and highlights the opportunities for purchasing managers to improve supplier management and drive out additional costs. Originality/value For the business practitioner, this research provides evidence regarding how individual functions can gain influence in the organization. A conceptual model describes the meaningful involvement of purchasing in complex business-to-business service purchases.

scholarly journals The effect of service constraint on EPQ model with random defective rate

2006 ◽  
Vol 2006 ◽  
pp. 1-5 ◽  
Author(s):  
Yung-Fu Huang
Keyword(s):  
Annual Cost ◽  
Differential Calculus ◽  
Cost Minimization ◽  
Algebraic Approach ◽  
Optimal Solution ◽  
Service Level ◽  
Economic Production Quantity ◽  
Economic Production ◽  
Epq Model ◽  
Production Quantity

Chiu studied the effect of service-level constraint on the economic production quantity (EPQ) model with random defective rate. In this note, we will offer a simple algebraic approach to replace his differential calculus skill to find the optimal solution under the expected annual cost minimization.

Sign in / Sign up

Export Citation Format

Share Document