Abstract: The solution algorithm, based on Lagrangian relaxation, a sub-gradient method and a heuristic to find the upper bound of the solution, is proposed to solve the coordinated fleet routing and flight scheduling problems. Numerical tests are performed to evaluate the proposed algorithm using real operating data from two Taiwan airlines. The test results indicate that the solution algorithm is a significant improvement over those obtained with CPLEX, consequently they could be useful for allied airlines to solve coordinated fleet routing and flight scheduling problems.
Abstract: This paper presents a subjective job scheduler based
on a 3-layer Backpropagation Neural Network (BPNN) and a greedy
alignment procedure in order formulates a real-life situation. The
BPNN estimates critical values of jobs based on the given subjective
criteria. The scheduler is formulated in such a way that, at each time
period, the most critical job is selected from the job queue and is
transferred into a single machine before the next periodic job arrives.
If the selected job is one of the oldest jobs in the queue and its
deadline is less than that of the arrival time of the current job, then
there is an update of the deadline of the job is assigned in order to
prevent the critical job from its elimination. The proposed
satisfiability criteria indicates that the satisfaction of the scheduler
with respect to performance of the BPNN, validity of the jobs and the
feasibility of the scheduler.
Abstract: The use of 3D computer-aided design (CAD) models
to support construction project planning has been increasing in the
previous year. 3D CAD models reveal more planning ideas by
visually showing the construction site environment in different stages
of the construction process. Using 3D CAD models together with
scheduling software to prepare construction plan can identify errors
in process sequence and spatial arrangement, which is vital to the
success of a construction project. A number of 4D (3D plus time)
CAD tools has been developed and utilized in different construction
projects due to the awareness of their importance. Virtual prototyping
extends the idea of 4D CAD by integrating more features for
simulating real construction process. Virtual prototyping originates
from the manufacturing industry where production of products such
as cars and airplanes are virtually simulated in computer before they
are built in the factory. Virtual prototyping integrates 3D CAD,
simulation engine, analysis tools (like structural analysis and
collision detection), and knowledgebase to streamline the whole
product design and production process. In this paper, we present the
application of a virtual prototyping software which has been used in
a few construction projects in Hong Kong to support construction
project planning. Specifically, the paper presents an implementation
of virtual prototyping in a residential building project in Hong Kong.
The applicability, difficulties and benefits of construction virtual
prototyping are examined based on this project.
Abstract: This paper presents an efficient emission constrained
hydrothermal scheduling algorithm that deals with nonlinear
functions such as the water discharge characteristics, thermal cost,
and transmission loss. It is then incorporated into the hydrothermal
coordination program. The program has been tested on a practical
utility system having 32 thermal and 12 hydro generating units. Test
results show that a slight increase in production cost causes a
substantial reduction in emission.
Abstract: Data Warehousing tools have become very popular and currently many of them have moved to Web-based user interfaces to make it easier to access and use the tools. The next step is to enable these tools to be used within a portal framework. The portal framework consists of pages having several small windows that contain individual data warehouse query results. There are several issues that need to be considered when designing the architecture for a portal enabled data warehouse query tool. Some issues need special techniques that can overcome the limitations that are imposed by the nature of data warehouse queries. Issues such as single sign-on, query result caching and sharing, customization, scheduling and authorization need to be considered. This paper discusses such issues and suggests an architecture to support data warehouse queries within Web portal frameworks.
Abstract: The process of wafer fabrication is arguably the most
technologically complex and capital intensive stage in semiconductor
manufacturing. This large-scale discrete-event process is highly reentrant,
and involves hundreds of machines, restrictions, and
processing steps. Therefore, production control of wafer fabrication
facilities (fab), specifically scheduling, is one of the most challenging
problems that this industry faces. Dispatching rules have been
extensively applied to the scheduling problems in semiconductor
manufacturing. Moreover, lot release policies are commonly used in
this manufacturing setting to further improve the performance of such
systems and reduce its inherent variability. In this work, simulation is
used in the scheduling of re-entrant flow shop manufacturing systems
with an application in semiconductor wafer fabrication; where, a
simulation model has been developed for the Intel Five-Machine Six
Step Mini-Fab using the ExtendTM simulation environment. The
Mini-Fab has been selected as it captures the challenges involved in
scheduling the highly re-entrant semiconductor manufacturing lines.
A number of scenarios have been developed and have been used to
evaluate the effect of different dispatching rules and lot release
policies on the selected performance measures. Results of simulation
showed that the performance of the Mini-Fab can be drastically
improved using a combination of dispatching rules and lot release
policy.
Abstract: Grid scheduling is the process of mapping grid jobs to resources over multiple administrative domains. Traditionally, application-level schedulers have been tightly integrated with the application itself and were not easily applied to other applications. This design is generic that decouples the scheduler core (the search procedure) from the application-specific (e.g. application performance models) and platform-specific (e.g. collection of resource information) components used by the search procedure. In this decoupled approach the application details are not revealed completely to broker, but customer will give the application to resource provider for execution. In a decoupled approach, apart from scheduling, the resource selection can be performed independently in order to achieve scalability.
Abstract: Project managers are the ultimate responsible for the
overall characteristics of a project, i.e. they should deliver the project
on time with minimum cost and with maximum quality. It is vital for
any manager to decide a trade-off between these conflicting
objectives and they will be benefited of any scientific decision
support tool. Our work will try to determine optimal solutions (rather
than a single optimal solution) from which the project manager will
select his desirable choice to run the project. In this paper, the
problem in project scheduling notated as
(1,T|cpm,disc,mu|curve:quality,time,cost) will be studied. The
problem is multi-objective and the purpose is finding the Pareto
optimal front of time, cost and quality of a project
(curve:quality,time,cost), whose activities belong to a start to finish
activity relationship network (cpm) and they can be done in different
possible modes (mu) which are non-continuous or discrete (disc), and
each mode has a different cost, time and quality . The project is
constrained to a non-renewable resource i.e. money (1,T). Because
the problem is NP-Hard, to solve the problem, a meta-heuristic is
developed based on a version of genetic algorithm specially adapted
to solve multi-objective problems namely FastPGA. A sample project
with 30 activities is generated and then solved by the proposed
method.
Abstract: Many Wireless Sensor Network (WSN) applications necessitate secure multicast services for the purpose of broadcasting delay sensitive data like video files and live telecast at fixed time-slot. This work provides a novel method to deal with end-to-end delay and drop rate of packets. Opportunistic Routing chooses a link based on the maximum probability of packet delivery ratio. Null Key Generation helps in authenticating packets to the receiver. Markov Decision Process based Adaptive Scheduling algorithm determines the time slot for packet transmission. Both theoretical analysis and simulation results show that the proposed protocol ensures better performance in terms of packet delivery ratio, average end-to-end delay and normalized routing overhead.
Abstract: Wireless Mesh Networking is a promising proposal
for broadband data transmission in a large area with low cost and
acceptable QoS. These features- trade offs in WMNs is a hot research
field nowadays. In this paper a mathematical optimization framework
has been developed to maximize throughput according to upper
bound delay constraints. IEEE 802.11 based infrastructure
backhauling mode of WMNs has been considered to formulate the
MINLP optimization problem. Proposed method gives the full
routing and scheduling procedure in WMN in order to obtain
mentioned goals.
Abstract: One of the most basic functions of control engineers is
tuning of controllers. There are always several process loops in the
plant necessitate of tuning. The auto tuned Proportional Integral
Derivative (PID) Controllers are designed for applications where
large load changes are expected or the need for extreme accuracy and
fast response time exists. The algorithm presented in this paper is
used for the tuning PID controller to obtain its parameters with a
minimum computing complexity. It requires continuous analysis of
variation in few parameters, and let the program to do the plant test
and calculate the controller parameters to adjust and optimize the
variables for the best performance. The algorithm developed needs
less time as compared to a normal step response test for continuous
tuning of the PID through gain scheduling.
Abstract: Set covering problem is a classical problem in
computer science and complexity theory. It has many applications,
such as airline crew scheduling problem, facilities location problem,
vehicle routing, assignment problem, etc. In this paper, three
different techniques are applied to solve set covering problem.
Firstly, a mathematical model of set covering problem is introduced
and solved by using optimization solver, LINGO. Secondly, the
Genetic Algorithm Toolbox available in MATLAB is used to solve
set covering problem. And lastly, an ant colony optimization method
is programmed in MATLAB programming language. Results
obtained from these methods are presented in tables. In order to
assess the performance of the techniques used in this project, the
benchmark problems available in open literature are used.
Abstract: Traditionally, project scheduling and material planning have been treated independently. In this research, a mixed integer programming model is presented to integrate project scheduling and materials ordering problems. The goal is to minimize the total material holding and ordering costs. In addition, an efficient metaheuristic algorithm is proposed to solve the model. The proposed algorithm is computationally tested, the results are analyzed, and conclusions are given.
Abstract: Multiple-Input-Multiple-Output (MIMO) is one of the most important communication techniques that allow wireless systems to achieve higher data rate. To overcome the practical difficulties in implementing Dirty Paper Coding (DPC), various suboptimal MIMO Broadcast (MIMO-BC) scheduling algorithms are employed which choose the best set of users among all the users. In this paper we discuss such a sub-optimal MIMO-BC scheduling algorithm which employs antenna selection at the receiver side. The channels for the users considered here are not Identical and Independent Distributed (IID) so that users at the receiver side do not get equal opportunity for communication. So we introduce a method of applying weights to channels of the users which are not IID in such a way that each of the users gets equal opportunity for communication. The effect of weights on overall sum-rate achieved by the system has been investigated and presented.
Abstract: In this work, we study the impact of dynamically
changing link slowdowns on the stability properties of packetswitched
networks under the Adversarial Queueing Theory
framework. Especially, we consider the Adversarial, Quasi-Static
Slowdown Queueing Theory model, where each link slowdown may
take on values in the two-valued set of integers {1, D} with D > 1
which remain fixed for a long time, under a (w, ¤ü)-adversary. In this
framework, we present an innovative systematic construction for the
estimation of adversarial injection rate lower bounds, which, if
exceeded, cause instability in networks that use the LIS (Longest-in-
System) protocol for contention-resolution. In addition, we show that
a network that uses the LIS protocol for contention-resolution may
result in dropping its instability bound at injection rates ¤ü > 0 when
the network size and the high slowdown D take large values. This is
the best ever known instability lower bound for LIS networks.
Abstract: We consider a typical problem in the assembly of
printed circuit boards (PCBs) in a two-machine flow shop system to
simultaneously minimize the weighted sum of weighted tardiness and
weighted flow time. The investigated problem is a group scheduling
problem in which PCBs are assembled in groups and the interest is to
find the best sequence of groups as well as the boards within each
group to minimize the objective function value. The type of setup
operation between any two board groups is characterized as carryover
sequence-dependent setup time, which exactly matches with the real
application of this problem. As a technical constraint, all of the
boards must be kitted before the assembly operation starts (kitting
operation) and by kitting staff. The main idea developed in this paper
is to completely eliminate the role of kitting staff by assigning the
task of kitting to the machine operator during the time he is idle
which is referred to as integration of internal (machine) and external
(kitting) setup times. Performing the kitting operation, which is a
preparation process of the next set of boards while the other boards
are currently being assembled, results in the boards to continuously
enter the system or have dynamic arrival times. Consequently, a
dynamic PCB assembly system is introduced for the first time in the
assembly of PCBs, which also has characteristics similar to that of
just-in-time manufacturing. The problem investigated is
computationally very complex, meaning that finding the optimal
solutions especially when the problem size gets larger is impossible.
Thus, a heuristic based on Genetic Algorithm (GA) is employed. An
example problem on the application of the GA developed is
demonstrated and also numerical results of applying the GA on
solving several instances are provided.
Abstract: This paper considers the control of the longitudinal
flight dynamics of an F-16 aircraft. The primary design objective
is model-following of the pitch rate q, which is the preferred
system for aircraft approach and landing. Regulation of the aircraft
velocity V (or the Mach-hold autopilot) is also considered, but
as a secondary objective. The problem is challenging because the
system is nonlinear, and also non-affine in the input. A sliding
mode controller is designed for the pitch rate, that exploits the
modal decomposition of the linearized dynamics into its short-period
and phugoid approximations. The inherent robustness of the SMC
design provides a convenient way to design controllers without gain
scheduling, with a steady-state response that is comparable to that
of a conventional polynomial based gain-scheduled approach with
integral control, but with improved transient performance. Integral
action is introduced in the sliding mode design using the recently
developed technique of “conditional integrators", and it is shown that
robust regulation is achieved with asymptotically constant exogenous
signals, without degrading the transient response. Through extensive
simulation on the nonlinear multiple-input multiple-output (MIMO)
longitudinal model of the F-16 aircraft, it is shown that the conditional
integrator design outperforms the one based on the conventional linear
control, without requiring any scheduling.
Abstract: Tourism industries are rapidly increased for the last
few years especially in Malaysia. In order to attract more tourists,
Malaysian Governance encourages any effort to increase Malaysian
tourism industry. One of the efforts in attracting more tourists in
Malacca, Malaysia is a duck tour. Duck tour is an amphibious
sightseeing tour that works in two types of engines, hence, it required
a huge cost to operate and maintain the vehicle. To other country, it is
not so new but in Malaysia, it is just introduced, thus it does not have
any systematic routing yet. Therefore, this paper proposed an
optimization technique to formulate and schedule this tour to
minimize the operating costs by considering it into Travelling
Salesman Problem (TSP). The problem is then can be solved by one
of the optimization technique especially meta-heuristics approach
such as Tabu Search (TS) and Reactive Tabu Search (RTS).
Abstract: In the current Grid environment, efficient workload
management presents a significant challenge, for which there are
exorbitant de facto standards encompassing resource discovery,
brokerage, and data transfer, among others. In addition, the real-time
resource status, essential for an optimal resource allocation strategy,
is often not readily accessible. To address these issues and provide a
cleaner abstraction of the Grid with the potential of generalizing into
arbitrary resource-sharing environment, this paper proposes a new
Condor-based pilot mechanism applied in the PanDA architecture,
PanDA-PF WMS, with the goal of providing a more generic yet
efficient resource allocating strategy. In this architecture, the PanDA
server primarily acts as a repository of user jobs, responding to pilot
requests from distributed, remote resources. Scheduling decisions are
subsequently made according to the real-time resource information
reported by pilots. Pilot Factory is a Condor-inspired solution for a
scalable pilot dissemination and effectively functions as a resource
provisioning mechanism through which the user-job server, PanDA,
reaches out to the candidate resources only on demand.
Abstract: Tasks of an application program of an embedded system are managed by the scheduler of a real-time operating system
(RTOS). Most RTOSs adopt just fixed priority scheduling, which is not optimal in all cases. Some applications require earliest deadline
first (EDF) scheduling, which is an optimal scheduling algorithm.
In order to develop an efficient real-time embedded system, the
scheduling algorithm of the RTOS should be selectable. The paper presents a method to customize the scheduler using aspectoriented
programming. We define aspects to replace the fixed priority scheduling mechanism of an OSEK OS with an EDF scheduling
mechanism. By using the aspects, we can customize the scheduler
without modifying the original source code. We have applied the
aspects to an OSEK OS and get a customized operating system with
EDF scheduling. The evaluation results show that the overhead of
aspect-oriented programming is small enough.