Study on Research paper “Job Sequencing Methods And Total

Elapsed Time Management In Block Production Industry”

By

ARJUN NARAYAN 1927906

JATIN AHUJA 1927911
JAYANTH KUMAR 1927912
RICKY AYYAPPA B C 1927921
AMITHA K T 1927928
AVRIL MENDEZ 1927931

Under the Guidance of

Prof. Malini Nair

Institute of Management

CHRIST (DEEMED TO BE UNIVERSITY), Bengaluru

DECEMBER 2019
 Introduction

Why was the study undertaken?

Task scheduling relates to prioritizing task delivery. The program addresses potential production
scheduling issues that may result in a lack of efficiency. Highlights of this would involve assigning
and failing to complete various jobs within the project. The greatest concern in an industrial
process is quality and stream of work time, which is why knowing the principles of task timing
will help to ensure that jobs and orders are fulfilled within the timeline provided to them. As a
consequence of the inherently challenging environment, new jobs will enter the system at whatever
time. This uncertainty puts a strain on both managers of small-scale enterprises such as food
vendors, plumbers, among many others, and management of large-scale enterprises such as car
manufacturers, cement plants, saw mills, brick industries, among others, pursuing maximum
production at minimum cost. Given the variance of job sequencing between factories, due to its
urgency and inevitability, the impact of job sequencing on block industry manufacturing costs
cannot be overstated. The intent of job sequencing in manufacturing is to reduce the time and
expense of production by informing a production plant when to create, with which staff and on
which machinery. Moreover, a great deal of time that is supposed to be focused in the
manufacturing of blocks is used in the quest for labour, getting ready for the slow delivery of
materials, repairing machines, among other things, thus causing long waits and inefficiencies that
will increase costs and lead to low sales and possible loss if bricks are not available when required.
All of the above issues deteriorate the development of brick businesses and lead to the product's
late delivery, increased cost, bad quality and failure to meet customer requirements, and there can
be no cost economization if jobs are not correctly sequenced, so the connection between effective
job sequencing and complete lapse time management needs to be established.

The purpose of this research paper was to investigate the substantial impact of the work
scheduling process on total time management over time and to clarify the correlation between job
sequencing and on-time delivery.
 Literature review
 Shahzar Jawaid, C. Srivastava and S. Datta in their research paper “An approach of
minimizing energy consumption in the machining system using Job sequences varying
techniques” has told that globally, enterprise plays a actual part in the power consumption
and strength is one of the most parameters which acts constantly over the procedure and
will increase the product price. Therefore, the predominant goal of the manufacturer is to
reduce the manufacturing value as the manufacturing cost also receives incurred in the
product final price. A manufacturing machine of five exceptional parts is considered. Each
part has exclusive operations. Each operation consumes a positive amount of energy. The
whole energy consumption is calculated using the mathematical mannequin and by using
thinking about the solely direct source of energy. Further, three distinctive factors are
analyzed using the rule-based system. (Shahzar, C, & S, 2019).
 Behrang Bootaki and Mohammad Mahdi Paydar in their research article “On the n-job,
m-machine permutation flow shop scheduling problems with makespan criterion and
rework” deals with the addresses an n-job, m-machine permutation waft keep scheduling
hassle (PFSSP) with unlimited intermediate buffers and transform activities. The thought
of remodel skill that processing of a job on a machine may not meet a predefined nice
degree via its first process. Thus we have a probabilistic cycle of operations for jobs on
specific machines which is primarily based on two concepts:

(1) A failure likelihood of a job on a machine.

(2) A descent price that reduces the processing instances for remodel phase.

In this case, the processing instances of jobs on machines emerge as random variables with
a recognized probability distribution. The purpose of this paper is to look at possible answer
processes for producing the efficient job sequences with the least plausible makespan. A
extensive range of simulation-based methods are applied to tackle the proposed problem.
These strategies incorporate mathematical formulation, heuristic algorithms, and
metaheuristics. The mechanism of the answer methods is based on firstly the usage of
predicted processing instances to discover a job sequence; then evaluating the got job
 sequences with the aid of several simulated trials. Using the one-way ANOVA test, these
strategies have been compared together, and the outcomes exhibit the superiority of
metaheuristics, particularly simulated annealing, over the other methods. (Behrang &
Paydar, 2018).

 Cynthia S McCahon and Stanley Lee in their article “Fuzzy job sequencing for a flow
shop” has told that in job sequencing for a float shop, processing instances are frequently
now not known exactly and solely estimated intervals are given. Fuzzy numbers are ideally
acceptable to symbolize these intervals. To accept trapezoidal fuzzy processing times the
Campbell, Dudek and Smith (CDS) job sequencing algorithm is modified. Using fuzzy
arithmetic deterministic sequences have been calculated but the sequence performance
measurements of makespan and job mean float time are fuzzy. The use of opportunity
principle and the fuzzy vital allows the scheduler to meaningfully interpret these fuzzy
results. Deterministic approximations to this fuzzy method are also investigated. (Cynthia
S & Lee, 1992).
 “Load prediction analysis based on virtual machine execution time using optimal
sequencing algorithm in cloud federated environment” is an article through which the
authors S K Sonkar and M U Kharat has told that virtual computer (VM) prediction and an
fantastic resource management are the desirable areas in the cloud environment. VM
prediction is an vital undertaking to execute the jobs for lengthen minimization and
unnecessary states avoidance. Cloud computing attracted closer to the expand in a variety
of functions that run on far off servers in parallel manner. Increase in parallelism reduces
the CPU utilization adversely. Hence, the acceptable VM prediction and administration are
integral degrees in provisioning scheme. Also time required for allocating jobs is greater
in existing algorithms due to the quantity of computations involved. Therefore a novel
algorithm is required to improve the overall performance of the job allocation with
makespan reduction. In this paper the new algorithm is proposed that includes the VM
potential and execution time for load prediction and performance enhancement purpose.
Our proposed research work utilizes the VM clustering and optimization algorithms to
enhance job sequencing performance. The value computation prior to clustering consists
of the VM capacity as a primary factor. Clustering of VM with high-cost and isolation of
 less costly and high-cost clusters reduces the searching time of VM and solve the imbalance
nation trouble in ordinary methods. The optimization algorithm with suitable initialization
characteristic reduces the time and steps for decision of VM for appropriate job. The
proposed model out performance is established through the chosen parameters. (Sonkar &
Kharat, 2019).
 John N. Hooker in his article “Improved job sequencing bounds from decision
diagrams” has introduce a generic technique for relaxing selection diagrams that permits
one to certain job sequencing problems via solving a Lagrangian twin problem on a blissful
diagram. We also provide tips for figuring out troubles for which this strategy can result in
beneficial bounds. These identical hints can be utilized to bounding deterministic dynamic
programming troubles in general, considering choice diagrams rely on DP formulations.
Computational checks show that Lagrangian leisure on a selection design can yield very
tight bounds for sure classes of challenging job sequencing problems. For example, it
proves for the first time that the excellent regarded solutions for Biskup-Feldman situations
are inside a small fraction of 1% of the most suitable value, and sometimes optimal. (John
N, 2019)

Summary

Problem understanding and explanation

The research applied an algorithm template of job sequencing for total time time management in
Osun State. The researchers analyzed the huge impact of the work sequencing framework between
work sequencing and on-time delivery on total elapse time management. A survey study was used
and data gathered from the identified block industry's pre-production, development and post-
production operations in Odo-Otin Local authorities in Osun State through inspection and
investigation. The findings showed that the model of job sequencing has a direct impact on total
time management over time. Furthermore, the finding discovered that saved time will decrease
throughput, -time delivery, customer due delivery date and total elapse time will be ideal and this
will strengthen and help increase the temporary storage stock for future unforeseen demand. The
cost implicit assumption of the saved time, however, will increase the organization's profit.
Organizations will try to incorporate job sequencing approaches into their procedures and create a
coordination to minimize costs in all their processes.

Analysis of the process

The formulation of the solution was done in three stages. The first stage considered two machines
where a fixed number of jobs had to be assigned to these two machines. The solution to this was
found using Johnson’s rule in three steps where the smallest processing time was taken into
consideration. The next stage considered not just two but three machines. Johnson’s rule can be
extended to this variation as well if the following condition are satisfied. Smallest time for machine
A work is approximately equivalent to the maximum production time on machine B or Lowest
processing time for machine c work is greater than or equal to the maximum processing time on
machine B. The third stage of the solution involved a fixed number of machines more than three
where any number of jobs can be undertaken. Although, this also has some constraints. Smallest
processing time on machine A1 is greater than or equal maximum time on machines A2, A3…. Am
– 1or Smallest processing time on machine Am is greater than or equal to machine time on machine
A2, A3, …, Am -1.
Elapsed time is related to the time between beginning the very first job on the system or on a specific
facility and finishing the very last job on the machines. This includes the idle time throughout the
process on any of the machines. A number of jobs are performed on a series of processors to enhance
the production plants. There are a huge number of limitations and goals to produce better results.
System planning is critical, and researchers have performed a series of studies to satisfy all side
restrictions and to maximize benefit.

Components for research

In this experiment, the survey research method was used. Assessment and evaluation was conducted
in Okuku, Odo, to produce blocks industry. This observation allows the survey to collect data on
the steps, time and production cost of the three block types: 6 inches, 9 inches and special block
without altering any of the parameters involved in the research. Sampling methods are related to the
process or system of selecting research population members. The author therefore followed simple
techniques. Proportionate random sampling was used to pick the block industry based on the
workforce's behaviors and demographic in the chosen block industry in the state of Osun. The tool
adopted for this study is the "observation and investigation process" which rendered the scholar
well-known to the participants and the block business activities.

Future direction of the paper

The given paper has used Johnson rule algorithm and has been published in the year 2016 and
also the paper concludes that the block industry has to use job sequencing techniques to:

 Production cost minimization.

 Built a team work among the employees.
 Enhance and boost the buffer stock to meet the unexpected demand.
 Reduce the cycle time and deliver time so that the customer due date of delivery is met
and the customers are satisfied.
 Optimal utilization of resources so that wastage of resources are minimized.
 Maximize the profit.

The above conclusion has made a major impact in the Osun state block production industry. All
the industries not only block industry have started to use job sequencing and enjoying the
advantages involved in it.

The following is the SWOT analysis of Block production industry after the introduction of job
sequencing model.

 Strengths:
Cost advantage, Asset leverage, Effective communication and research & development,
Innovation, Online growth, Customer loyalty, Market leader, Strong administration team,
Strong equity, Strong monetary position, Supply chain, Price leader, Real estate,
Reputation administration and Unique products.
  Weaknesses:
Diseconomies to scale, Over leveraged financial position, Ubiquitiouegory, products and
services.
 Opportunities:
Acquisitions, Asset leverage, Financial markets (raise money through debt), Emerging
markets and expansion abroad, Product and services expansion and Takeovers.
 Threats:
Competition, Cheaper technology, Economic slowdown, External modifications
(government, policies, tax etc), Exchange fee fluctuations, Lower fee opponents or imports,
Maturing categories, merchandise and services, Price wars and Product substitution.

The block production industry after the implementation of job sequencing model has improved a
lot when compared to block industry before implementation of job sequencing model. The main
objective of implementing job sequencing model has helped these kind of industry to minimize
the waiting time variance (WTV) and to increase quality of service (QoS).

Applications & Recommendation

Applications

Not only block production industry, any industry or sector can use job sequencing model. There
have been many research articles being published regarding the usage of job sequencing technique.
Job sequencing can be used anywhere and everywhere for instance it can be used in

1. Automobile industry.
2. Medical industry.
3. Field of networking such as road network, railways network and airlines network etc.,
and also it can be used in our day-to-day activities. The basic understanding after
reading the paper given is that if there is a machine or any job or work is been involved
in completion of any task job sequencing technique can be used for efficiency and
 effectiveness in completing the task. Application of job sequencing technique helps in
production cost minimization, built a team work among the employees, optimal
utilization of resources and maximizing profits. Also wastage of time, energy are
controlled.

Recommendation

Since job sequencing technique can be used in each and every task of a person as well as in business
or companies, the following are the recommendations :

1. Even though there are lot of research articles have been published regarding job sequencing,
there is no proper knowledge about the topic by most of the people even though they are
using the same technique in their production or business activities.
2. The word job sequencing technique is just a word given the to the tasks performed in the
orderly manner from ancient times. But job techniques have been modified over the years
and new models have been introduced so that the orderly performed task are performed in
a optimal manner saving time, energy, cost etc.
3. Lack of knowledge regarding job sequencing has been hindering the possible growth of a
business or industry to a limited growth of a business or industry (Slows the business
growth).
4. Certain problems in sequencing are: One machine, many jobs, Two machines, many jobs,
Three machines, many jobs and Many machines, many jobs. These problems can be
resolved by Jackson’s rule of job sequencing.
5. Misleading of job sequencing technique might lead to wastage of time, cost, resources and
losses shall also be incurred by the business . Hence proper implementation of job
sequencing technique is required for the company to achive its objectives efficiently and
effectively.
 Works Cited

Behrang, B., & Paydar, M. M. (2018). On the n-job, m-machine permutation flow shop
scheduling problems with makespan criterion and rework. International journal of
science and technology.

Cynthia S, M., & Lee, S. (1992). Fuzzy job sequencing for a flow shop. European Journal of
Operational Research.

John N, H. (2019). Improved Job Sequencing Bounds from Decision Diagrams. International
Conference on Principles and Practice of Constraint Programming.

Shahzar, J., C, S., & S, D. (2019). An Approach of Minimizing Energy Consumption in the
Machining System Using Job Sequences Varying Technique. SpringerLink.

Sonkar, S. K., & Kharat, M. U. (2019). Load prediction analysis based on virtual machine
execution time using optimal sequencing algorithm in cloud federated environment.
International Journal of Information Technology.