Assignment Mpo

Analyze from the engineering management perspective the short term scheduling
case studies.
Overview
The objective of scheduling is to allocate and prioritize demand (generated by

either forecasts or customer orders) to available facilities. Besides, by scheduling,
companies use assets more effectively and create greater capacity per dollar invested,
which in turn, and lower cost. This added capacity and related flexibility provides faster
delivery and therefore better customer services. Good scheduling is a competitive
advantages through dependable delivery. Scheduling deals with the timing of operations.
The task is the allocation and prioritization of demand. The significant factors are,
forward or backward scheduling, finite or infinite loading and the criteria for sequencing
jobs.
The short scheduling method consists of Gantt Charts, Assignment Method,

Sequencing Jobs, Critical Ratio (CR), Johnson’s Rule, Finite Capacity Scheduling, and
Cyclical Scheduling, Therefore there are 3 case studies was analyse according to the
project management perspectives in the short term scheduling which is:
1) The Perspectives of Taylor, Gantt, and Johnson: How to Improve Production

Scheduling
1.1) Gantt and His Charts
To improve managerial decision-making, Gantt created innovative charts for

visualizing planned and actual production. Gantt designed his charts so that foremen and
other supervisors not in the planning office could quickly know whether production was
on schedule, ahead of schedule, or behind schedule. Gantt gave two principles for his
charts: one, measure activities by the amount of time needed to complete them; two, use
the space on the chart to represent the amount of the activity that should have been done
in that time. Gantt’s work on charts to help supervisors reflects the view that scheduling
is a decision-making process in which schedulers perform a variety of tasks and use both
formal and informal information to accomplish the task.
1.2) Johnson’s rule
The objective was to minimize the total time needed to finish all the task. Johnson
analyzed the properties of an optimal solution and presented an elegant algorithm that
constructs an optimal solution.
2) Short-term planning and scheduling in multipurpose batch chemical plants:

a multi-level approach.
Figure 2.0. Planning level proposed structure.
According to figure 2.0 the proposed planning approach is intended to deal with a set of
user-defined data, in order to establish, through a capacity analysis, a realistic frame
where the scheduling is worthwhile. Each planning scenario is defined through a set of
input data generally manipulated by planners in order to get a compromise between plant
loading and due date satisfaction.
Product demands: As stated before, those data are not static, but subject to negotiation
between production and sales departments to obtain a realistic production plan involving
modifications on customer orders due dates and quantities.
Raw materials availability plan: The raw material availability could be constrained due
to supplier’s contracts, quality control procedures, etc.
Availability of plant resources: Constrained shared resources like utilities or manpower

can restrain the products demand that can be processed in a given time horizon. Often
planners try to avoid demand scenarios that can need such high levels for constrained
shared resources.
Assignment of equipment units: The multipurpose nature of equipment allows different

assignment of equipment to tasks. Planner’s objectives may be balanced equipment
utilization or a more robust plan where, in front of disturbances, he:she can change
assignments without high penalties.
2.1) Sequencing method
Table 2.0 shows the respective input data. It is also shown the number of batches of
each operation needed to meet the demand plan.
Table 2.0: Input data and number of batches.

2.2) Backward scheduling procedure
Each product/intermediate has a latest production profile in order to satisfy the latest
consumption profile of downstream tasks in the network. Therefore, the backward
scheduling is developed, and starts with the demand plan. Latest finishing times of any
two successive batches of the same task should be shifted at least by the task processing
time.
2.3) Forward scheduling procedure
Each product/intermediate has an earliest production profile in order to satisfy the earliest
production profile of upstream tasks in the network. Earliest beginning times of any two
successive batches of the same task should be shifted at least by the task processing time.
Time windows are obtained matching earliest beginning time and latest finishing time for
each correspondent batch of each task as shown in table 2.1.
Table 2.1: Time windows.

2.4) Gantt Chart
Figure 2.1: The Gantt Chart in task completion schedule.
The resulting Gantt chart is shown in Figure 2.1 show the schedule in term of
completing the task.
3.0) Minimizing make-span in 2-stage disassembly flow-shop scheduling

problem.
The 2 stage m-Machine (in Stage 2) Disassembly Flow-shop (2SmMDF)

Scheduling problem consists of n jobs, each requiring m + 1 tasks. The first task is the
disassembly of a job, and it leads to e m processing tasks each of which is performed on
a different machine. The time required for each task is known but task times are likely
different. For each job, the second-stage tasks cannot start until the first task is completed,
but then they can be done in parallel. The objective is to minimize the make-span
criterion.
Method:
Johnson’s rule provided a polynomial-time algorithm for minimizing the make-span of

the 2-machine (series) flow-shop scheduling problem.
Consider the following 3 job 2S2MDF problem, where J1= (10, 4, 7), J2 = (3, 9, 6) and J3
= (5, 8, 2). It can be shown that S* = J2J3J1 and C(S*) = 25 as shown in figure 3.0.
Figure 3.0: Johnson’s rule for S* = J2J3J1.
To illustrate the nature of the 2S2MDF problem, let’s consider the schedule of another
permutation S’ = J2J1J3 as shown in figure 3.1.
Figure 3.1: Johnson’s rule for S’ = J2J1J3.
Note that M2, 1 finished last in S’, whereas M2, 2 finished last in S*. This illustrates the
difficulty with finding the optimal solution to the 2SmMDF: it is not possible to
determine which Stage 2 machine will finish last without examining every sequence.
Therefore Johnson’s rule guarantees shortest make-span, where S* is an optimal
sequence for 2S2MDF.
4) Solving Cyclical Nurse Scheduling Problem Using Preemptive Goal

Programming
Cyclical scheduling can be applied to create a schedule for nurses in hospitals consisting
of several wards as an inpatient room. In each ward consists of several rooms, each nurse
is only responsible for health services in the ward where they served. Thus, in this
scheduling problem will only focus on the scheduling of nurses in the wards in the
hospital.
Additionally, other assumptions used in making the scheduling nurse cyclically are:
4a) Nurse scheduling included 3 shifts for 24 hours, where morning shift starts from
7 a.m. till 2 p.m. for 7 hours, evening shift starts from 2 p.m. till 9 p.m. for 7 hours, and
night shift starting from 9 p.m. till 7 a.m. for 10 hours.
4b) The rules in the hospital did not change during the scheduling period is still
ongoing
4c) There is no nurse replace a predetermined schedule for a scheduling period is still
ongoing, for example, time off nurse or national holidays.
The following notations are used to specify the model:

• i: index for days, i = 1,2,…,21
• k: index for nurses, k = 1,2,...,18
• t: index for scheduling period, t = 1,2,...,18
• Xi,k: notation for nurses k assigned to the morning shift for day i
• Yi,k: notation for nurses k assigned to the evening shift for day i
• Zi,k: notation for nurses k assigned to the night shift for day i
• Ci,k: notation for nurses k assigned day off for day i
In this case Xi,k, Yi,k, Zi,k, Ci,k is decision variable.
4.1) From the cyclical scheduling:
From formulation to produce a first-period nurse scheduling will be formed 18 nurse

scheduling patterns, where each pattern is shift work schedules and days off every nurse
for 21 days (Table 4.0). By using the software LINGO.
Table 4.0: Cyclical Nurse Scheduling Patterns for 18 Periods where Sn is nurse
scheduling for period n, n = 1,2,…,18.
Table 4.1: Results of LINGO 9.0 software in the first stage with a wide range of nurses.
Table 4.2: Nurses scheduling for 18 nurses in period 1.
*Notes: X =morning shift, Y =afternoon shift, Z = night shift
According to the result, the optimal solution for nurses cyclical scheduling can be seen
in Table 4.1.
Having regard to Table 4.1, can conclude that:
• If the number of nurses in the ward is less than 18 people, then scheduled shift work
for nurses cannot be determined.
• If the number of nurses available in the wards is more than or equal to 18 people,
scheduled shift work for nurses can be determined for 21 days.
Based on simulations using LINGO software, we obtained that:
• The optimal number of nurses needed in a ward is 18 nurses.
• Total of days in one period is 21 days.
• Total cyclical period is 18 periods (18 × 21 days = 378 days).
Nurse cyclical scheduling helps to relieve the workload of the head nurse for building a
new scheduling model. All nurses have 18 scheduling pattern for 378 days (54 weeks),
so that each nurse will be treated fairly because they have the same work schedule with
other nurses.

Assignment Mpo

Uploaded by

Copyright:

Available Formats

Assignment Mpo

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Assignment Mpo

Uploaded by

Copyright:

Available Formats

Analyze from the engineering management perspective the short term scheduling

The objective of scheduling is to allocate and prioritize demand (generated by

The short scheduling method consists of Gantt Charts, Assignment Method,

1) The Perspectives of Taylor, Gantt, and Johnson: How to Improve Production

1.1) Gantt and His Charts

To improve managerial decision-making, Gantt created innovative charts for

2) Short-term planning and scheduling in multipurpose batch chemical plants:

Figure 2.0. Planning level proposed structure.

Availability of plant resources: Constrained shared resources like utilities or manpower

Assignment of equipment units: The multipurpose nature of equipment allows different

2.1) Sequencing method

Table 2.0: Input data and number of batches.

2.3) Forward scheduling procedure

Table 2.1: Time windows.

Figure 2.1: The Gantt Chart in task completion schedule.

3.0) Minimizing make-span in 2-stage disassembly flow-shop scheduling

The 2 stage m-Machine (in Stage 2) Disassembly Flow-shop (2SmMDF)

Johnson’s rule provided a polynomial-time algorithm for minimizing the make-span of

Figure 3.0: Johnson’s rule for S* = J2J3J1.

Figure 3.1: Johnson’s rule for S’ = J2J1J3.

4) Solving Cyclical Nurse Scheduling Problem Using Preemptive Goal

The following notations are used to specify the model:

4.1) From the cyclical scheduling:

From formulation to produce a first-period nurse scheduling will be formed 18 nurse

Table 4.2: Nurses scheduling for 18 nurses in period 1.

*Notes: X =morning shift, Y =afternoon shift, Z = night shift

Based on simulations using LINGO software, we obtained that:

• The optimal number of nurses needed in a ward is 18 nurses.

• Total of days in one period is 21 days.

• Total cyclical period is 18 periods (18 × 21 days = 378 days).

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.