Está en la página 1de 11

This article was downloaded by:[2007 Korea Advanced Institute of Science & Technology]

On: 16 August 2007


Access Details: [subscription number 768755534]
Publisher: Taylor & Francis
Informa Ltd Registered in England and Wales Registered Number: 1072954
Registered office: Mortimer House, 37-41 Mortimer Street, London W1T 3JH, UK
International Journal of Computer
Integrated Manufacturing
Publication details, including instructions for authors and subscription information:
http://www.informaworld.com/smpp/title~content=t713804665
Workflow-based dynamic scheduling of job shop
operations
Online Publication Date: 01 September 2007
To cite this Article: Hwang, H. C. and Choi, B. K. (2007) 'Workflow-based dynamic
scheduling of job shop operations', International Journal of Computer Integrated
Manufacturing, 20:6, 557 - 566
To link to this article: DOI: 10.1080/09511920601024179
URL: http://dx.doi.org/10.1080/09511920601024179
PLEASE SCROLL DOWN FOR ARTICLE
Full terms and conditions of use: http://www.informaworld.com/terms-and-conditions-of-access.pdf
This article maybe used for research, teaching and private study purposes. Any substantial or systematic reproduction,
re-distribution, re-selling, loan or sub-licensing, systematic supply or distribution in any form to anyone is expressly
forbidden.
The publisher does not give any warranty express or implied or make any representation that the contents will be
complete or accurate or up to date. The accuracy of any instructions, formulae and drug doses should be
independently verified with primary sources. The publisher shall not be liable for any loss, actions, claims, proceedings,
demand or costs or damages whatsoever or howsoever caused arising directly or indirectly in connection with or
arising out of the use of this material.
Taylor and Francis 2007
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

Workow-based dynamic scheduling of job shop operations
H. C. HWANG and B. K. CHOI*
VMS Lab., Department of Industrial Engineering, Korea Advanced Institute of Science and Technology
(KAIST), 373-1 Kusong-dong, Yusong-gu, Daejeon, South Korea
In a job shop such as a mould-making shop, dispatching decisions as to which job should
be loaded on a machine when it becomes free are termed dynamic scheduling. A practical
approach to dynamic job-shop scheduling is the use of discrete event simulation, and
their dedicated simulation-based dynamic scheduling systems, often known as manu-
facturing execution systems or advanced planning systems, are available. In the present
paper, we propose a workow-based dynamic scheduling framework, in which a work-
ow management system (WfMS) serves as a dynamic job-shop scheduler. For this
purpose, we have developed an algorithm for embedding a discrete-event simulation
mechanism into a WfMS, and have implemented a prototype job-shop scheduler.
Illustrative performance evaluation shows that the proposed framework is logically valid
and computationally ecient.
Keywords: Workow simulation; Dynamic scheduling; Job shop scheduling; Enactment
service; WfMS; BPMS
1. Introduction
Typically, there are two approaches to job-shop scheduling:
static scheduling and dynamic scheduling. The static sched-
uling approach may use combinatorial optimization tech-
niques to nd the best operation sequence for a given set
of jobs (Rangsaritratsamee et al. 2004). In this o-line
approach, all operations of available jobs are sched-
uled for the entire scheduling period (Sabuncuoglu
and Hommertzheim 1992). In theory, a static scheduling
method can provide an optimal operation sequence, but its
applicability is quite limited in practice.
The second approach, dynamic scheduling, is employed in
a dynamic job shop where jobs arrive randomly over time
and dispatching decisions as to which jobs should be
processed next when machines become free are made in real
time (Baker 1974). It is often called real-time scheduling
(Alvarez and Diaz 2004), which attempts to schedule
operations one at a time when they are needed. Some
researchers prefer the term dynamic scheduling to emphasize
the dynamic nature of the real-time scheduling problem
(Sabuncuoglu and Hommertzheim 1992). Examples of
dynamic job shop include mould-making shop (Choi
et al. 1995) and exible manufacturing system consisting
of a number of machining centres (Choi and Kim 2002).
A practical approach to dynamic scheduling of job shop
is the use of discrete event simulation, called a simulation-
based dynamic scheduling (Choi and You 2006). The subject
of simulation-based dynamic scheduling has been studied
widely in the literature (Ying and Clark 1994, Choi et al.
1995, Kim 1995, Yeh 1997, Baker 1998, Jeong 2000), and
there are dedicated dynamic scheduling systems available
that are often called manufacturing execution systems or
advanced planning systems in industry. A diculty with
these dedicated scheduling systems is that they are non-
standard proprietary systems that are not easily integrated
with other enterprise software systems. In the current
paper, we propose a workow-based dynamic scheduling
framework in which a workow management system
(WfMS) serves as a dynamic job-shop scheduler that can
be easily integrated with other business process manage-
ment systems.
The concept of WfMS emerged in the 1980s and gained
popularity in the early 1990s as a means to oce
*Corresponding author. Email: bkchoi@vmslab.kaist.ac.kr
International Journal of Computer Integrated Manufacturing, Vol. 20, No. 6, September 2007, 557 566
International Journal of Computer Integrated Manufacturing
ISSN 0951-192X print/ISSN 1362-3052 online 2007 Taylor & Francis
http://www.tandf.co.uk/journals
DOI: 10.1080/09511920601024179
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

automation. According to the Workow Management
Coalition (http://www.wfmc.org/), the WfMS is a software
system that completely denes and automatically executes
workows in order to manage the actual ow of work so
that the right work is done at the right time with the right
information by the right person in the organization (WfMC
1995). A nice feature of WfMS is that the Workow
Management Coalition (WfMC) provides a set of interface
standards for modelling and interfacing, and most com-
mercial workow management systems comply with the
Coalitions standards.
In recent years, WfMS has evolved into BPMS (business-
process management system) by supplementing it with
several new functionalities, such as rule engines, activity
monitors and specic application modules (Delphi 2003),
which is often called workow-based BPMS. Since WfMS
or workow-based BPMS is widely used in managing and
orchestrating various business processes in an enterprise, the
use of WfMS in job-shop scheduling as well would provide a
natural mechanism for computer integrated manufacturing
(CIM).
The workow-based dynamic scheduling framework
requires the WfMS to be equipped with an on-line
discrete-event simulation mechanism. For this purpose,
we have developed an algorithm for embedding a discrete-
event simulation mechanism into an existing WfMS.
Because the simulator-equipped WfMS is used as a
dynamic job-shop scheduler, the dynamic scheduling
involves workow simulation. The subject of workow
simulation has been studied widely (Giaglis and Paul 1996,
Aalst 1998, Hong et al. 1999, Bae et al. 1999, Volkner and
Werners 2002), but the existing workow simulation
methods are static and o-line in that process denition
models are converted into simulation models and then
simulated in a separate simulation system.
The rest of the present paper is organized as follows:
in section 2, characteristics of simulation-based dynamic
scheduling and basic mechanisms of WfMS are reviewed to
dene a workow-based dynamic scheduling framework,
and in section 3, the algorithm for embedding a simulation
mechanism in WfMS is presented. In section 4, a proto-
type system for dynamic scheduling of mould-production
operations is described and the results of performance
evaluation are presented, followed by the nal section on
conclusions and discussions.
2. Simulation-based dynamic scheduling
and workow management
In this section, we describe key characteristics of
simulation-based dynamic scheduling and basic mechan-
isms of workow management system, and then present
an approach to using a workow management system in
dynamic scheduling of job-shop operations.
2.1. Simulation-based dynamic scheduling
The simulation-based dynamic scheduling approach is the
experimental investigation of scheduling problems using
simulation models and the design of easy-to-use on-line
dispatching rules. Research in this area can be also further
classied into: (a) testing the performance of several
machine scheduling rules against various scheduling
criteria, and (b) design of dynamic dispatching rules or
other on-line scheduling techniques (Sabuncuoglu and
Hommertzheim 1992).
In the simulation-based dynamic scheduling framework
(Choi and You 2006) as shown in gure 1, simulation
experiments are made periodically trying various dispatch-
ing rules, taking into account the status of work in progress
Figure 1. Simulation-based dynamic scheduling framework.
558 H. C. Hwang and B. K. Choi
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

(WIP) and job arrivals, to generate detailed schedules
or scheduling rules. In each experiment, a number of
simulation runs may be made applying the try-every-rule
approach (i.e. try all possible sets of dispatching rules and
select the best one) to obtain a near optimal set of
schedules. The frame for simulation experimentation is
termed as an experimental frame (Zeigler et al. 2000).
During the simulation in gure 1, the routing structure
of each job is stored in a network structure called bill of
processes (BOP). Once a resource is scheduled to every
process of each BOP (i.e. every process is loaded on a
resource), the entire schedule for all the jobs is stored in
a linked-list structure called loading-schedule network
(LS-Net). Details on the subject have been described
elsewhere (Choi et al. 1995, Choi and Kim 2002). The
following data objects are of importance in a simulation-
based dynamic scheduling system:
(a) standard BOP denotes a pre-dened BOP for a
given type of jobs;
(b) loaded BOP is an individual BOP for a job loaded
in the shop;
(c) resource denotes a machine or an operator in the
shop;
(d) loadable resource is a resource that can handle a
process in a BOP;
(e) LS-net is a network structure storing all the loaded
BOPs connected through (common) loadable
resources.
2.2. Workow management system
The WfMC (WfMC, http://www.wfmc.org/) denes WfMS
as a software system that completely denes and auto-
matically executes workows (WfMC 1995). A workow is
a collection of tasks organized to accomplish a business
process executable by workow engine that is a major
component of WfMS. The term enactment service refers to
the execution of workows by the workow engine, which
involves assigning tasks to, and receiving results from,
participants. The following objects play an important role
in a WfMS:
1. Activity refers to the basic work element of a work-
ow, and it becomes a work item when delivered to a
participant for processing. An activity that is not
ready to be processed is inactive, and it becomes an
enabled activity when all of its predecessor activities
are completed:
2. Process denition model (PDM) refers to a network
model of the workow; it describes the precedence
relationships among activities.
3. Process instance refers to an instance of the PDM for
actual execution.
4. Work item handler is a software module handling
work items for a human participant.
There are two types of internal data in the workow engine
that are related to the enactment service: workow relevant
data and workow control data. The workow relevant data,
which may be manipulated by work item handlers as well as
by the workow engine, is normally used to determine the
state transitions of a process instance. Examples of work-
ow relevant data, which are also known as process
variables, include transition conditions, participant assign-
ments, and the reference values to be passed between
activities. In contrast, the workow control data, which are
internal to the workow engine and not normally accessible
to workow applications, represent the dynamic state of the
workow engine and its process instances. Examples of
workow control data, which are often called enactment
service state data, include state information about each
process instance, state information about each activity and
information on the restart points within each process.
Another type of enactment service is the creation of
process instances during the run time of a PDM. A PDM is
a directed graph of activity nodes. An activity in PDM may
be a generic activity that is to be sent out to a participant
(human, application software, or hardware resource); or it
may be a non-generic activity, such as a start activity, an
end activity, or a loop activity. Generic activity can be
classied as work-type activity or message-type activity. The
content of the work-type activity is delivered to a
participant as a work item, either for processing and or
for reporting the completion of the activity.
In order to make the current paper self-contained, we
briey present some details of enactment service mechan-
isms of a workow engine using gure 2. In gure 2, Wj
denotes the work-type activity j, where j is a unique id of
the activity within a PDM. An inactive activity becomes
enabled when all of its predecessor activities are completed:
When W1 is changed into a newly completed activity, then
W2 and W3 are newly enabled activities by the workow
engine; still W4 and W5 are inactive activities. Right after
the completion of W1, the workow engine provides the
following sequence of enactment services (where Tj pro-
cessing time for work-type activity Wj):
(a) create instances of the enabled activities W2 and W3;
(b) send out W2 and W3 to designated work item
handlers;
(c) receive the content of W2 after a period of T2
(assuming T2 5T3);
(d) update the state of the process instance (W2
becomes newly completed).
In the meantime, upon receiving W2, the work item handler
noties a participant, and the participant works on W2 for
Workow-based dynamic scheduling of job shop operations 559
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

a period of T2 and reects the result at the work item
handler.
A nice feature of WfMS is that the WfMC provides a set
of interface standards for modelling and interfacing, and
most commercial workow management systems comply
with the Coalitions standards. In recent years, workow
management systems have evolved into BPM systems by
supplementing the WfMS with a few new functionalities.
There are now quite a large number of workow-based
BPM system venders available as indicated in gure 3.
2.3. Workow-based dynamic scheduling
By comparing the key objects of the simulation-based
dynamic scheduling framework with those of the WfMS,
one may nd that they have almost identical one-to-one
correspondence. Table 1 shows the analogy between the
WfMS objects and the dynamic scheduling objects.
Thus, if we provide an existing WfMS with simulation
capability, the WfMS can serve as a dynamic scheduling
system for job shop. In this paper, dynamic job-shop sche-
duling using a WfMS is called a workow-based dynamic
scheduling and its framework is depicted in gure 4. Thus, the
question is how to embed a discrete event simulator into
an existing WfMS so that it can perform a workow simula-
tion that preserves causality constraints (Fujimoto 2000).
3. Workow engine with embedded simulator
In order to realize the workow-based dynamic schedu-
ling framework of gure 4, the workow engine must be
capable of performing simulations in run time. The issues of
workow simulation and scheduling have received a high
level of attention from academia as well as from industry
(Singh 1995, Aalst 1998, Hong et al. 1999, Bae et al. 1999,
Giaglis and Paul 1996, Volkner and Werners 2002, April
et al. 2005, Senkul and Toroslu 2005). However, none of
the existing results were found to be adequate for our
purpose. They are static and o-line in that process
denition models are converted into simulation models to be
simulated in a separate simulation system.
Workow scheduling contends with the problem of
nding a correct execution sequence for workow tasks,
i.e. an execution that obeys the constraints that embody the
business logic of the workow (Senkul and Toroslu 2005).
Approaches in this area are typically based on temporal
logic and specialized algebras (Singh 1995), as well as Petri
nets (Aalst 1998). These studies concentrate on the pre-
scheduling of workows at build time or o-line.
Recent studies that have investigated workow simulation
mostly focus on how to use commercial simulation
packages or formal modelling languages (e.g. Petri-net) at
build time. The basic idea is to convert an executable PDM
Figure 2. Enactment service mechanism of workow engine.
560 H. C. Hwang and B. K. Choi
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

to a formal model described in a target modelling language
(Hong et al. 1999, Aalst 2000) or; alternatively, to an input
model of a commercial simulation package (Bae et al. 1999,
Giaglis and Paul 1996, Volkner and Werners 2002).
3.1. Architecture of simulator-embedded workow engine
Referring to the enactment service mechanism of the
workow engine given earlier in gure 2, the basic idea of
embedding a simulation mechanism is as follows: (a) replace
each participants work item handler with a participant
simulator; (b) modify the enactment server (ES) so that
causality constraints are preserved (Fujimoto 2000); and (c)
add a new module, called synchronization manager (SM),
responsible for managing activities related to simulation.
Figure 5 shows the architecture of the simulator-embedded
workow engine.
At the start of simulation (i.e. initialization step), the
SM creates process instances for all jobs (loaded and
new). For a loaded job in WIP, its current operation step
becomes an enabled activity that is sent to a participant
simulator (PS) as a work item. In the case of a new job, the
job-release activity, which is the rst activity for the job,
becomes an enabled activity to be sent to the PS handling
new job releases. Once initialized, the SM (a) nds a PS
who has a work item with the minimum completion time,
and (b) asks the PS to report its work item completion to
the ES. Upon receiving a work item completion from a
PS, the ES starts its simulation cycles, which is described in
detail below.
3.2. Workow simulation algorithm
Figure 6 shows the overall execution sequence for work-
ow simulation. It is a conservative time-stamp simulation
Figure 3. Workow-based BPM System Venders (Gartner Research 2004).
Table 1. Analogy between WfMS and dynamic scheduling
system.
Dynamic scheduling objects Workow management objects
Standard BOP Process denition model (PDM)
Loaded BOP Process instance
Resource Participant
Loadable resources in BOP Participant denitions in PDM
LS-net Set of process instances
(Current) WIP Current state of process instances
Loading simulator NA
Workow-based dynamic scheduling of job shop operations 561
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

preserving the causality constraint (Fujimoto 2000). The
key idea here is that the synchronization manager allows
participant simulators to acknowledge their work item
completion only after all the newly generated work
items (NGW) are delivered to respective participant
simulators.
In gure 6, W1 is a newly completed workitem (NCW);
which makes W2 and W3 enabled activities (W4 and W5 are
inactive activities). NGWs are then generated from the
enabled activities. The number of newly generated work
items (#NGW), together with NCW (W1), are stored
as state variables of the ES. The time-stamp workow
simulation has a synchronization phase and an event-
scheduling phase. The synchronization phase guarantees
that the PSs receive all of the NGWs. The event-scheduling
phase then ensures the selection and completion of the
work item whose time-stamp of expected completion is the
earliest among the pending work items in each of the par-
ticipant simulators. Details are given in the Appendix.
4. Prototype development and evaluation
To verify the proposed workow-based dynamic scheduling
framework and evaluate the workow simulation algorithm,
a prototype system for mould-making shop is developed.
A mould-making shop is a typical example of job shop
production (Choi and You 2006). The prototype has been
developed based on a WfMS named Harmony
1
(Choi and
Hwang 2005), using Microsoft .NET Framework and C#.
Harmony
1
is a test-bed WfMS developed at the present
authors lab and it supports the WfMC standard WAPI
(WfMC 1995).
Figure 4. Workow-based dynamic scheduling framework.
Figure 5. Architecture of simulator-embedded workow engine.
562 H. C. Hwang and B. K. Choi
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

Figure 7 shows a PDM for a moulding die (TV front
mask) constructed with the process designer of Harmony
1
.
The process designer, which is a graphical model-building
tool, was developed using the GoDiagram
1
library set
(http://www.northwoods.com/). At the end of a simulation
run, the resulting job- loading schedule is displayed as a
Gantt chart, as shown in gure 8. In this prototype, the
participant simulators execute work items on a rst-in-rst-
out (FIFO) basis.
The short reaction time, indicating the performance of
the simulation, is a key requirement for dynamic scheduling
(Alvarez and Diaz 2004). The purpose of the performance
Figure 6. Execution cycle of time-stamp workow simulation.
Figure 7. PDM of a moulding die.
Workow-based dynamic scheduling of job shop operations 563
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

analyses are to evaluate the behaviour of the proposed
simulation algorithm (but not to provide a rigorous
statistical analysis). We generated eight cases by changing
the number of process instances (40, 120, 240, 350, 480,
600, 720 and 1000) and plotted simulation execution times
against the number of process instances (see gure 9). As
shown in gure 9, the execution time of the simulation
appears to be linear with respect to the number of process
instances (Ni).
Additional simulations were run for dierent values
with the number of activities Na in a PDM (67, 33), the
number of process instances Ni for the PDM (1, 2, 3),
and the number of participant simulators Ns (5, 9).
The N-value given by (1) is used as a measure of the size
of the problem.
N Na Ni Ns 1
where
Na the number of activities in a PDM
Ni the number of process instances for each PDM
Ns the number of participant simulators.
Figure 10 shows the times (in seconds) taken to complete
simulation runs under various values of the N-value dened
Figure 8. GUI of simulation results (Gantt chart).
Figure 9. Execution time versus Ni (the number of process instances).
564 H. C. Hwang and B. K. Choi
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

in equation (1). In a typical mould-making shop, about
50 jobs (i.e. process instances) would be involved in a single
simulation run (Choi and You 2006). In the prototype, it
took approximately 10 s on average to complete a simula-
tion run with nearly 200 000 operations (Na 6Ni) and 500
jobs (Ni). The simulation program was run on an ordinary
desktop PC (Pentium IV 3.0 with 1GB of main memory).
In practice, the dynamic scheduler would be invoked
periodically or on an event basis. For example, a mould-
making shop usually performs rescheduling (i.e. makes a
simulation run) once a day in the morning or when a major
disturbance event occurs like a major machine down or an
arrival of an urgent order.
5. Conclusions and discussions
In this paper, we have demonstrated that an existing WfMS
can be used as a dynamic job-shop scheduling system if a
discrete-event simulation mechanism is embedded in the
WfMS. The results of performance analysis show that
the proposed simulation algorithm is very ecient so that
the workow-based dynamic scheduler can handle schedul-
ing problems encountered in large job shops.
Since workow-based BPMS is widely used in managing
other business processes such as order-to-delivery process
and product development process, the workow-based
dynamic job-shop scheduler may easily be integrated with
those systems. Namely, the key advantage of the workow-
based dynamic scheduler is that it is compatible with other
business-process management systems in a company.
Another merit of the simulator-embedded WfMS is that it
can be used in managing oce type business processes as
well as those that require proactive rescheduling.
The main limitation of the workow-based dynamic
scheduler proposed in the present paper is that it can
handle only unit-loading type operations. If a resource
performs an operation on a job one at a time exclusively,
we call it a unit-loading type operation. In actual
manufacturing, there may be other types of operations as
well, like time-sharing, collaborative, and batch-processing
type operations. Thus, it may be necessary to increase the
modelling-power of the proposed dynamic scheduler in
order to cover those types of operations (if they exist) in a
job shop. It is also necessary to incorporate various
dynamic dispatching rules into the proposed dynamic
scheduler to make it a practical job-shop scheduling system.
Both of the issues would deserve further research.
Appendix: Time-stamp workow simulation algorithm (refer
to gure 6)
ES enactment server;
SMsynchronization manager;
PSparticipant simulator;
#NGWnumber of newly generated workitems;
Begin
0) Initialize
SM generates process instances and workitems for
all jobs
While simulation-running condition is true {
// Event Scheduling Phase:
1) SM asks each PS to report its local min time-
stamp (LMT) value
2) Each PS sends its LMT value to SM;
SM waits until it receives a LMT value
from every PS.
SM selects the PS with minimum LMT value.
3) SM asks the selected PS to acknowledge
workitem completion.
Figure 10. Execution time versus N-value [as dened in equation (1)].
Workow-based dynamic scheduling of job shop operations 565
D
o
w
n
l
o
a
d
e
d

B
y
:

[
2
0
0
7

K
o
r
e
a

A
d
v
a
n
c
e
d

I
n
s
t
i
t
u
t
e

o
f

S
c
i
e
n
c
e

&

T
e
c
h
n
o
l
o
g
y
]

A
t
:

0
8
:
3
3

1
6

A
u
g
u
s
t

2
0
0
7

4) The selected PS acknowledges its workitem-
completion to ES and SM
The PS selects its next workitem and computes
its new LMT.
If there are no pending workitems, set LMT
Innite.
5) ES updates process instances.
// Synchronization Phase:
6) ES creates newly generated workitems (NGWs)
SM asks ES to acknowledge that ES creates all
NGWs.
7) ES sends out each NGW to a respective PS
and set #NGW.
ES reports acknowledgement of all NGWs
creation.
SM obtains #NGW from ES after receiving
acknowledged creation of all NGWs.
If #NGW equals zero, then go to Step 1.
8) SM asks for acknowledgment of workitem-
receipt to every PS.
9) Each PS acknowledges its workitem-receipt to
SM
SM waits until the workitem-receipt count
equals to #NGW
Go to Step 1
}
End
Acknowledgement
This work was supported in part by grant No.R01-2006-
000-11118-0 from the Basic Research Program of the Korea
Science & Engineering Foundation.
References
Aalst, W.M.P., The application of Petri nets to workow management.
J. Circuits Syst. Comput., 1998, 8, 121166.
Alvarez, E. and Diaz, F., An application of a real-time scheduling system
for turbulent manufacturing environments. Robotics Comput.-Integr.
Mfg, 2004, 20, 485494.
April, J., Better, M., Glover, F., Kelly, J.P. and Manuel Laguna OptTek
Systems, Inc., Enhancing business process management with simulation
optimization. Technical Report in BPTrends, 2005. Available online at:
http://www.bptrends.com
Bae, J.S., Jeong, S.C., Seo, Y.H., Kim, Y.H. and Kang, S.H., Integration
of workow management and simulation. Comput. Ind. Engng, 1999, 37,
203206.
Baker, K. Introduction to Sequencing and Scheduling, 1974 (Wiley:
New York).
Baker, A.D., A survey of factory control algorithms that can be
implemented in a multi-agent heterarchy: dispatching, scheduling, and
pull. J. Mfg Systems, 1998, 17, 297320.
Choi, B.K., Kim, D.H. and Hwang, H., Gantt chart based MES for die &
mold manufacturing. In Proceedings of IFIP WG5.7 Working Conference
on Managing Concurrent Manufacturing to Improve Industrial Perfor-
mance, Seattle, WA, 1115 September 1995, pp. 105114.
Choi, B.K. and Kim, B.H., MES architecture for FMS compatible to ERP.
IJCIM, 2002, 15, 274284.
Choi, B.K. and You, N.K., Dispatching rules for dynamic scheduling of
one-of-a-kind production. IJCIM, 2006, 19, 383392.
Choi, B.K. and Hwang, H.C., Architecture of 3-layered closed loop BPMS.
KIIE 2005 Fall Conference, 2005. Available online at http://vms.kaist.
ac.kr/publications/technical.aspx. In Korean.
Delphi, BPM 2003 Market Milestone Report, Delphi, 2003.
Fujimoto, R.M., Parallel and Distributed Simulation Systems, 200 (John
Wiley: New York).
Giaglis, G.M. and Paul, R.J., Its time to engineer re-engineering:
investigating the potential of simulation modeling for business process
redesign. In Business Process Modeling, edited by B. Scholz-Reiter and
E. Stickel, pp. 313332, 1996 (Springer Verlag, Berlin).
Hong, K.J., Lee, J.K., Kim, D.H. and Kim, T.G., DEVS framework
instrumented with database for web-based workow modeling simula-
tion. Soc. Comput. Simulation (Simulation Councils, Inc.), 1999, 31,
113118.
Jeong, K.Y., Conceptual frame for development of optimized simulation
based scheduling systems. Expl Syst. Applic., 2000, 18, 299306.
Kim, Y.D., A backward approach in list scheduling algorithms for
multi-machine tardiness problems. Comput. Ops Res., 1995, 22,
307319.
Rangsaritratsamee, R., Ferrell, W. and Kurz, M., Dynamic rescheduling
that simultaneously considers eciency and stability. Comput. Ind.
Engng, 2004, 46, 115.
Sabuncuoglu, I. and Hommertzheim, D., Dynamic dispatching algorithm
for scheduling machines and AGVs in an FMS. Int. J. Prod. Res., 1992,
30, 10591079.
Senkul, P. and Toroslu, I.H., An architecture for workow scheduling
under resource allocation constraints. Information Systems, 2005, 30,
399422.
Singh, M.P., Semantical considerations on workows: an algebra for
intertask dependencies. In Proceedings of the International Workshop
on Database programming Language, Gubbio, Umbria, Italy, 68
September 1995.
Volkner, P. and Werners, B., A simulation-based decision support system
for business process planning. Fuzzy Sets and Systems, 2002, 125,
275287.
WFMC TC00-1003, The workow reference model, 1995. Available online
at: http://www.wfmc.org/
Yeh, C.H., A fast nite loading algorithm for job oriented scheduling.
Computers & Operations Research, 1997, 24, 193198.
Ying, C.C. and Clark, G.M., Order release planning in a job shop using a
bi-directional simulation algorithm. In Proceedings of the 1994 Winter
Simulation Conference, Orlando, Florida, 1994, pp. 10081012.
Zeigler, B., Praehofer, H. and Kim, T., Theory of Modeling and Simulation,
2000 (Academic Press: Boston).
566 H. C. Hwang and B. K. Choi

También podría gustarte