This document discusses minimizing bicriteria (total rental cost and makespan) in an n x 2 flow shop scheduling problem where processing times and setup times are associated with probabilities and job blocks are considered. A heuristic algorithm is proposed to find optimal or near optimal job sequences. The algorithm calculates expected processing and setup times, expected flow times, and equivalent job blocks. It then aims to minimize machine rental costs while minimizing makespan by finding job sequences under the specified rental policy. A computer program and numerical example are provided to illustrate the algorithm.
Artificial Neural Networks can achieve high degree of computation rates by
employing a massive number of simple processing elements with a high degree of
connectivity between elements. In this paper an attempt is made to present a Constraint
Satisfaction Adaptive Neural Network (CSANN) to solve the generalized job-shop
scheduling problem and it shows how to map a difficult constraint satisfaction job-shop
scheduling problem onto a simple neural net, where the number of neural processors equals
the number of operations, and the number of interconnections grows linearly with the total
number of operations. The proposed neural network can be easily constructed and can adjust
its weights of connections based on the sequence and resource constraints of the job-shop
scheduling problem during its processing. Simulation studies have shown that the proposed
neural network produces better solutions to job-shop scheduling problem.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Artificial Neural Networks can achieve high degree of computation rates by
employing a massive number of simple processing elements with a high degree of
connectivity between elements. In this paper an attempt is made to present a Constraint
Satisfaction Adaptive Neural Network (CSANN) to solve the generalized job-shop
scheduling problem and it shows how to map a difficult constraint satisfaction job-shop
scheduling problem onto a simple neural net, where the number of neural processors equals
the number of operations, and the number of interconnections grows linearly with the total
number of operations. The proposed neural network can be easily constructed and can adjust
its weights of connections based on the sequence and resource constraints of the job-shop
scheduling problem during its processing. Simulation studies have shown that the proposed
neural network produces better solutions to job-shop scheduling problem.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Planning and Scheduling of a Corrugated Cardboard Manufacturing Process in IoTijtsrd
The automation has revolutionized the traditional product development scheme by using advanced design and manufacturing technologies such as computer aided design, process planning, and scheduling. However, research in this field was still based mostly on experimentation, as most manufacturing companies did not use simulation techniques in the implementation of their manufacturing planning and scheduling process. In order to address this problem, software developers have put simulation software tools in the market such as Enterprise Resource Planning ERP , Advanced Planning and Scheduling APS , and Risk based Planning and Scheduling RPS systems. In this paper, a methodology to model high degree of accuracy for the production floor, the planning and scheduling of corrugated cardboard manufacturing process through RPS simulation in Internet of Things IoT environment is established. The RPS model is able to generate a deterministic schedule without randomness, create a risk analysis of the planning and scheduling, and handle the uncertainty. Bruno Kemen | Sarhan M. Musa "Planning and Scheduling of a Corrugated Cardboard Manufacturing Process in IoT" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-5 | Issue-1 , December 2020, URL: https://www.ijtsrd.com/papers/ijtsrd37965.pdf Paper URL : https://www.ijtsrd.com/engineering/electrical-engineering/37965/planning-and-scheduling-of-a-corrugated-cardboard-manufacturing-process-in-iot/bruno-kemen
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Effect and optimization of machining parameters on cutting force and surface ...eSAT Journals
Abstract Productivity and the quality of the machined parts are the main challenges of metal cutting industry during turning process. Therefore cutting parameters must be chosen and optimize in such a way that the required surface quality can be controlled. Hence statistical design of experiments (DOE) and statistical/mathematical model are used extensively for optimize. The present investigation was carried out for effect of cutting parameters (cutting speed, depth of cut and feed) In turning off mild steel and aluminum to achieve better surface finish and to reduce power requirement by reducing the cutting forces involved in machining. The experimental layout was designed based on the 2^k factorial techniques and analysis of variance (ANOVA) was performed to identify the effect of cutting parameters on surface finish and cutting forces are developed by using multiple regression analysis. The coefficients were calculated by using regression analysis and the model is constructed. The model is tested for its adequacy by using 95% confidence level. By using the mathematical model the main and interaction effects of various process parameters on turning was studied. Keywords: Universal Lathe, Surface Finish, Cutting Force, High Speed Steel Tool, Factorial Technique.
Modeling and Analysis of a Manufacturing Plant Using Discrete Event SimulationIJERA Editor
Today‟s manufacturing systems are characterized by large number of complexities such as random arrival patterns of jobs, random processing times, random failure rates, random repair times, random rejection of parts, etc. The analytical models cannot capture all the randomness mentioned above into the models. There is a need to incorporate them into models to have a practical and real life model. Simulation comes handy in this aspect. Discrete Event Simulation (DES) is used to model a manufacturing system to predict its performance. The inputs to this model include arrival rate, batch size, setup time, processing time, machine breakdown rate, machine breakdown frequency, machines and their capacities, buffers, rejection percentage and inspection time. The outputs that are estimated are work in process, flow time, utilization and throughput.
Job Shop Scheduling Using Mixed Integer ProgrammingIJMERJOURNAL
ABSTRACT: In this study, four different models in terms of mixed integer programming (MIP) are formulated for fourdifferent objectives. The first model objective is to minimizethemaximum finishing time (Makespan) without considering the products’ due dates, while the second model is formulated to minimize the makespan considering the due dates for all the products, the third model is to minimize the total earliness time, and the fourth one is to minimize the total lateness time. The proposed models are solved, and their computational performance levels are compared based on parameters such as makespan, machine utilization, and time efficiency. The results are discussed to determine the best suitable formulation
Let's dive deeper into the world of ODC! Ricardo Alves (OutSystems) will join us to tell all about the new Data Fabric. After that, Sezen de Bruijn (OutSystems) will get into the details on how to best design a sturdy architecture within ODC.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Dev Dives: Train smarter, not harder – active learning and UiPath LLMs for do...UiPathCommunity
💥 Speed, accuracy, and scaling – discover the superpowers of GenAI in action with UiPath Document Understanding and Communications Mining™:
See how to accelerate model training and optimize model performance with active learning
Learn about the latest enhancements to out-of-the-box document processing – with little to no training required
Get an exclusive demo of the new family of UiPath LLMs – GenAI models specialized for processing different types of documents and messages
This is a hands-on session specifically designed for automation developers and AI enthusiasts seeking to enhance their knowledge in leveraging the latest intelligent document processing capabilities offered by UiPath.
Speakers:
👨🏫 Andras Palfi, Senior Product Manager, UiPath
👩🏫 Lenka Dulovicova, Product Program Manager, UiPath
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Slack (or Teams) Automation for Bonterra Impact Management (fka Social Soluti...Jeffrey Haguewood
Sidekick Solutions uses Bonterra Impact Management (fka Social Solutions Apricot) and automation solutions to integrate data for business workflows.
We believe integration and automation are essential to user experience and the promise of efficient work through technology. Automation is the critical ingredient to realizing that full vision. We develop integration products and services for Bonterra Case Management software to support the deployment of automations for a variety of use cases.
This video focuses on the notifications, alerts, and approval requests using Slack for Bonterra Impact Management. The solutions covered in this webinar can also be deployed for Microsoft Teams.
Interested in deploying notification automations for Bonterra Impact Management? Contact us at sales@sidekicksolutionsllc.com to discuss next steps.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Software Delivery At the Speed of AI: Inflectra Invests In AI-Powered QualityInflectra
In this insightful webinar, Inflectra explores how artificial intelligence (AI) is transforming software development and testing. Discover how AI-powered tools are revolutionizing every stage of the software development lifecycle (SDLC), from design and prototyping to testing, deployment, and monitoring.
Learn about:
• The Future of Testing: How AI is shifting testing towards verification, analysis, and higher-level skills, while reducing repetitive tasks.
• Test Automation: How AI-powered test case generation, optimization, and self-healing tests are making testing more efficient and effective.
• Visual Testing: Explore the emerging capabilities of AI in visual testing and how it's set to revolutionize UI verification.
• Inflectra's AI Solutions: See demonstrations of Inflectra's cutting-edge AI tools like the ChatGPT plugin and Azure Open AI platform, designed to streamline your testing process.
Whether you're a developer, tester, or QA professional, this webinar will give you valuable insights into how AI is shaping the future of software delivery.
How world-class product teams are winning in the AI era by CEO and Founder, P...
11.bicriteria in nx0002www.iiste.org call for paper flow shop scheduling including job block
1. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
Bicriteria in n x 2 Flow Shop Scheduling Under Specified
Rental Policy, Processing Time and Setup Time Each
Associated with probabilities Including Job Block
Deepak Gupta
Prof. & Head, Department of Mathematics,
Maharishi Markandeshwar University, Mullana, Haryana, India
guptadeepak2003@yahoo.co.in
Sameer Sharma (Corresponding Author)
Research Scholar, Department of Mathematics,
Maharishi Markandeshwar University, Mullana, Haryana, India
samsharma31@yahoo.com
Seema
Assistant Prof, Department of Mathematics,
D.A.V.College, Jalandhar, Punjab, India
seemasharma7788@yahoo.com
Shefali Aggarwal
Research Scholar, Department of Mathematics,
Maharishi Markandeshwar University, Mullana, Haryana, India
shefaliaggarwalshalu@gmail.com
Abstract
This paper is an attempt to obtains an optimal solution for minimizing the bicriteria taken as minimizing the
total rental cost of the machines subject to obtain the minimum makespan for n jobs 2 machines flowshop
problem in which the processing times and independent set up times are associated with probabilities
including the job block concept. A heuristic approach method to find optimal or near optimal sequence has
been discussed. The proposed method is very simple and easy to understand and also provide an important
tool for the decision makers. A computer programme followed by a numerical illustration is give to clarify
the algorithm.
Keywords: Flowshop Scheduling, Heuristic, Processing Time, Set Up Time, Rental Cost and Job Block.
1. Introduction
In flowshop scheduling problems, the objective is to obtain a sequence of jobs which when processed on
the machines will optimize some well defined criteria. Every job will go on these machines in a fixed order
of machines. The research into flow shop problems has drawn a great attention in the last decades with the
aim to increase the effectiveness of industrial production. Recently scheduling, so as to approximate more
than one criterion received considerable attention. The bicriteria scheduling problems are motivated by the
fact that they are more meaningful from practical point of view. The bicriteria scheduling problems are
generally divided into three classes. In the first class, the problem involves minimizing one criterion subject
1
2. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
to the constraint that the other criterion to be optimized. In the second class, both criteria are considered
equally important and the problem involves finding efficient schedules. In the third class, both criteria are
weighted differently and an objective function as the sum of the weighted functions is defined. The problem
considered in this paper belongs to the first class.
Smith (1956) whose work is one of the earliest considered minimization of mean flow time and maximum
tardiness. Wassenhove and Gelders (1980) studied minimization of maximum tardiness and mean flow time
explicitly as objective. Some of the noteworthy heuristic approaches are due to Sen et al. (1983), Dileepan
et al.(1988), Chandersekharan (1992), Bagga(1969), Bhambani (1997), Narain (2006), Chakarvrthy(1999),
Singh T.P. et al. (2005), and Gupta et al.(2011). Setup includes work to prepare the machine, process or
bench for product parts or the cycle. This includes obtaining tools, positioning work-in-process material,
return tooling, cleaning up, setting the required jigs and fixtures, adjusting tools and inspecting material and
hence significant. The basic concept of equivalent job for a job – block has been investigated by Maggu &
Das (1977) and established an equivalent job-block theorem. The idea of job-block has practical
significance to create a balance between a cost of providing priority in service to the customer and cost of
giving service with non-priority. The two criteria of minimizing the maximum utilization of the machines or
rental cost and minimizing the maximum makespan are one of the combinations of our objective function
reflecting the performance measure.
2. Practical Situation
Various practical situations occur in real life when one has got the assignments but does not have one’s own
machine or does not have enough money or does not want to take risk of investing huge amount of money
to purchase machine. Under such circumstances, the machine has to be taken on rent in order to complete
the assignments. In his starting career, we find a medical practitioner does not buy expensive machines say
X-ray machine, the Ultra Sound Machine, Rotating Triple Head Single Positron Emission Computed
Tomography Scanner, Patient Monitoring Equipment, and Laboratory Equipment etc., but instead takes on
rent. Rental of medical equipment is an affordable and quick solution for hospitals, nursing homes,
physicians, which are presently constrained by the availability of limited funds due to the recent global
economic recession. Renting enables saving working capital, gives option for having the equipment, and
allows upgradation to new technology. Further the priority of one job over the other may be significant due
to the relative importance of the jobs. It may be because of urgency or demand of that particular job. Hence,
the job block criteria become important.
3. Notations
S: Sequence of jobs 1,2,3,….,n
Sk: Sequence obtained by applying Johnson’s procedure, k = 1, 2 , 3, -------
Mj: Machine j, j= 1,2
M: Minimum makespan
aij: Processing time of ith job on machine Mj
pij: Probability associated to the processing time aij
sij: Set up time of ith job on machine Mj
qij: Probability associated to the set up time sij
Aij: Expected processing time of ith job on machine Mj
Sij: Expected set up time of ith job on machine Mj
'
Aij : Expected flow time of ith job on machine M
j
β: Equivalent job for job – block
2
3. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
Ci: Rental cost of ith machine
Lj(Sk): The latest time when machine Mj is taken on rent for sequence Sk
tij(Sk): Completion time of ith job of sequence Sk on machine Mj
' th
tij ( Sk ) : Completion time of i job of sequence Sk on machine Mj when machine Mj start processing jobs at
time Ej(Sk)
Iij(Sk): Idle time of machine Mj for job i in the sequence Sk
Uj(Sk):Utilization time for which machine Mj is required, when Mj starts processing jobs at time
Ej(Sk)
R(Sk): Total rental cost for the sequence Sk of all machine
3.1 Definition
Completion time of ith job on machine Mj is denoted by tij and is defined as :
tij = max (ti-1,j , ti,j-1) + aij pij + s(i-1)j q(i-1)j for j 2.
= max (ti-1,j , ti,j-1) + Ai,.j + S(i-1),j,
where ,Ai,,j= Expected processing time of ith job on jth machine
Si,j= Expected setup time of ith job on jth machine.
3.2 Definition
Completion time of ith job on machine Mj when Mj starts processing jobs at time Lj is denoted by ti', j and is
defined as
i i 1 i i i 1
ti', j L j Ak , j Sk , j I k , j Ak , j Sk , j ,
k 1 k 1 k 1 k 1 k 1
Also ti', j max(ti, j 1 , ti' 1, j ) Ai, j Si 1, j .
4. Rental Policy
The machines will be taken on rent as and when they are required and are returned as and when they are no
longer required. .i.e. the first machine will be taken on rent in the starting of the processing the jobs, 2 nd
machine will be taken on rent at time when 1st job is completed on 1st machine.
5. Problem Formulation
Let some job i (i = 1,2,……..,n) are to be processed on two machines Mj ( j = 1,2) under the specified
rental policy P. Let aij be the processing time of ith job on jth machine with probabilities pij and sij be the
setup time of ith job on jth machine with probabilities qij. Let Aij be the expected processing time and Si,j be
the expected setup time of ith job on jth machine. Our aim is to find the sequence Sk of the jobs which
minimize the rental cost of the machines while minimizing total elapsed time.
The mathematical model of the problem in matrix form can be stated as:
Jobs Machine M1 Machine M2
i ai1 pi1 si1 qi1 ai2 pi2 si2 qi2
1 a11 p11 s11 q11 a12 p12 s12 q12
2 a21 p21 s21 q21 a22 p22 s22 q22
3 a31 p31 s31 q31 a32 p32 s32 q32
3
4. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
4 a41 p41 s41 q41 a42 p42 s42 q42
5 a51 p51 s51 q51 a52 p52 s52 q52
(Table 1)
Mathematically, the problem is stated as
Minimize U j Sk and
n
Minimize R Sk Ai1 C1 U j Sk C2
i 1
Subject to constraint: Rental Policy (P)
Our objective is to minimize rental cost of machines while minimizing total elapsed time.
6. Theorem n
The processing of jobs on M2 at time L2 I i ,2 keeps tn,2 unaltered:
Proof. Let ti,2 be the completion time ofi 1th job on machine M2 when M2 starts processing of jobs at L2.
i
We shall prove the theorem with the help of mathematical induction.
Let P(n) : tn ,2 tn ,2
Basic step: For n = 1, j =2;
1 11 1 1 11
t1,2 1 L2 Ak ,2 Sk ,2 I k ,2 Ak ,2 Sk ,2
'
I k ,2 A1,2 I1,2 A1,2 A1,1 A1,2
k 1 k 1 k 1 k 1 k 1
t1 , 2
,
k 1
P(1) is true.
tm,2 t m,2
Induction Step: Let P(m) be true, i.e.,
Now we shall show that P(m+1) is also true, i.e., tm1,2 tm1,2
Since tm1,2 max(tm1,1 , tm,2 ) Am1,2 Sm,2
' '
m m 1
max tm1,1 , L2 Ai ,2 Si ,2 Am1,2 Sm,2
i 1 i 1
m m
m1
m a x tm1 , 1, Ii ,2 Ai , 2
Si , 2 Im 1 Am
1 , Sm
2 ,2
i 1 i 1 i 1
max tm1,1 , tm,2 I m1 Am1,2 Sm,2
max tm1,1 , tm,2
'
max t t ,0 A
m 1,1 m,2 m 1,2 Sm,2 (By Assumption)
max tm1,1 , tm,2 A S
m 1,2 m,2
tm1,2
Therefore, P(m+1) is true whenever P(m) is true.
Hence by Principle of Mathematical Induction P(n) is true for all n i.e.
tn,2 tn,2 for all n.
n n 1
Remark: If M2 starts processing the job at L2 tn,2 Ai ,2 Si,2 , then total time elapsed tn,2 is not
altered and M2 is engaged for minimum time. If M2 startsprocessing the jobs at time L2 then it can be easily
n n 1
i 1 i 1
shown that tn,2 L2 Ai,2 Si,2 .
i 1 i 1
7. Algorithm
Step 1: Calculate the expected processing times and expected set up times as follows
4
5. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
Aij aij pij and Sij sij qij i, j
Step 2: Calculate the expected flow time for the two machines A and B as follows
Ai'1 Ai1 Si 2 and Ai'2 Ai 2 Si1 i.
Step 3: Take equivalent job k , m and calculate the processing time A 1 and A 2 on the guide lines of
' '
Maggu and Das (1977) as follows
' '
' '
' ' '
A 1 Ak1 Am1 min Am1 , Ak 2 , A 2 Ak 2 Am2 min Am1 , Ak 2 .
' ' '
Step 4: Define a new reduces problem with the processing times Ai'1 and Ai' 2 as defined in step 2 and jobs
' '
(k, m) are replaced by single equivalent job β with processing time A 1 and A 2 as defined in step 3.
Step 5: Using Johnson’s technique [1] obtain all the sequences Sk having minimum elapsed time. Let these
be S1, S2, ----------.
Step 6 : Compute total elapsed time tn2(Sk), k = 1,2,3,----, by preparing in-out tables for Sk.
n n 1
Step 7 : Compute L2(Sk) for each sequence Sk as L2 (Sk ) tn,2 (Sk ) Ai ,2 (Sk ) Si ,2 (Sk ) .
i 1 i 1
Step 8 : Find utilization time of 2nd machine for each sequence Sk as U 2 (Sk ) tn2 (Sk ) L2 (Sk ) .
Step 9 : Find minimum of (U 2 (Sk ) ; k = 1,2,3,….
Let it for sequence Sp. Then Sp is the optimal sequence and minimum rental cost for the sequence Sp is
n
R( S p ) Ai1 C1 U 2 ( S p ) C2 .
i 1
8. Programme
#include<iostream.h>
#include<stdio.h>
#include<conio.h>
#include<process.h>
int n,j, f=1;
float a1[16],b1[16],g[16],h[16],sa1[16],sb1[16], macha[16],machb[16],cost_a,cost_b,cost;
int group[16];//variables to store two job blocks
float minval,minv,maxv, gbeta=0.0,hbeta=0.0;
void main()
{ clrscr();
int a[16],b[16],sa[16],sb[16],j[16];
float p[16],q[16],u[16],v[16], maxv;
cout<<"How many Jobs (<=15) : "; cin>>n;
if(n<1 || n>15)
{ cout<<endl<<"Wrong input, No. of jobs should be less than 15..n Exitting"; getch(); exit(0); }
for(int i=1;i<=n;i++)
{ j[i]=i;
cout<<"nEnter the processing time and its probability, Setup time and its probability of "<<i<<" job for
machine A : ";
cin>>a[i]>>p[i]>>sa[i]>>u[i];
cout<<"nEnter the processing time and its probability, Setup time and its probability of "<<i<<" job for
machine B : ";
5
6. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
cin>>b[i]>>q[i]>>sb[i]>>v[i];
//Calculate the expected processing times and set up times of the jobs for the machines:
a1[i] = a[i]*p[i];b1[i] = b[i]*q[i]; sa1[i] = sa[i]*u[i];sb1[i] = sb[i]*v[i];}
cout<<"nEnter the rental cost of Machine A:"; cin>>cost_a;
cout<<"nEnter the rental cost of Machine B:"; cin>>cost_b;
cout<<endl<<"Expected processing time of machine A and B: n";
for(i=1;i<=n;i++)
{cout<<j[i]<<"t"<<a1[i]<<"t"<<b1[i]<<"t"; cout<<sa1[i]<<"t"<<sb1[i]; cout<<endl; }
//Calculate the final expected processing time for machines
cout<<endl<<"Final expected processing time of machin A and B:n";
for(i=1;i<=n;i++)
{ g[i]=a1[i]-sb1[i];h[i]=b1[i]-sa1[i]; }
for(i=1;i<=n;i++)
{cout<<"nn"<<j[i]<<"t"<<g[i]<<"t"<<h[i]; cout<<endl; }
cout<<"nEnter the two job blocks(two numbers from 1 to "<<n<<"):"; cin>>group[0]>>group[1];
//calculate G_Beta and H_Beta
if(g[group[1]]<h[group[0]])
{ minv=g[group[1]];}
else
{ minv=h[group[0]];}
gbeta=g[group[0]]+g[group[1]]-minv,hbeta=h[group[0]]+h[group[1]]-minv;
cout<<endl<<endl<<"G_Beta="<<gbeta;
cout<<endl<<"H_Beta="<<hbeta;
int j1[16]; float g1[16],h1[16];
for(i=1;i<=n;i++)
{if(j[i]==group[0]||j[i]==group[1])
{ f--; }
else
{ j1[f]=j[i];}
f++; }
j1[n-1]=17;
for(i=1;i<=n-2;i++)
{g1[i]=g[j1[i]];h1[i]=h[j1[i]];}
g1[n-1]=gbeta;h1[n-1]=hbeta;
cout<<endl<<endl<<"displaying original scheduling table"<<endl;
for(i=1;i<=n-1;i++)
{cout<<j1[i]<<"t"<<g1[i]<<"t"<<h1[i]<<endl;}
float mingh[16];
char ch[16];
6
8. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
{if((machb[i-1]+sb1[arr1[i-1]])>macha[i])
maxv=(machb[i-1]+sb1[arr1[i-1]]);
else
maxv=macha[i]; machb[i]=maxv+b1[arr1[i]];
cout<<arr1[i]<<"t"<<macha1[i]<<"--"<<macha[i]<<" "<<"t"<<maxv<<"--"<<machb[i]<<endl;}
cout<<"nnnTotal Elapsed Time (T) = "<<machb[n]; cout<<endl<<endl<<"Machine A:";
for(i=1;i<=n;i++)
{cout<<endl<<"Job "<<i<<" Computation Time"<<macha[i];}
cout<<endl<<endl<<"Machine B:";
for(i=1;i<=n;i++)
{cout<<endl<<"Job"<<i<<" Computation Time"<<machb[i];}
float L2,L_2,min,u2,sum1=0.0,sum2=0.0;
for(i=1;i<=n;i++)
{sum1=sum1+a1[i];sum2=sum2+b1[i];}
cout<<"nsum1="<<sum1; L2=machb[n]; float sum_2,sum_3;arr1[0]=0,sb1[0]=0;
for(i=1;i<=n;i++)
{sum_2=0.0,sum_3=0.0;
for(int j=1;j<=i;j++)
{sum_3=sum_3+sb1[arr1[j-1]];}
for(int k=1;k<=i;k++)
{sum_2=sum_2+b1[arr1[k]];}}
cout<<"nsum_2="<<sum_2; cout<<"nsum_3="<<sum_3; L_2=L2-sum_2-sum_3;
cout<<"nLatest time for which B is taken on Rent="<<"t"<<L_2; u2=machb[n]-L_2;
cout<<"nnUtilization Time of Machine M2="<<u2; cost=(sum1*cost_a)+(u2*cost_b);
cout<<"nnThe Minimum Possible Rental Cost is="<<cost;
cout<<"nnt***************************************************************";
getch();
}
9. Numerical Illustration
Consider 5 jobs, 2 machine flow shop problem with processing time and setup time associated with their
respective probabilities as given in the following table and jobs 2, 4 are to be processed as a group job (2,4).
The rental cost per unit time for machines M1 and M2 are 4 units and 6 units respectively. Our objective is to
obtain optimal schedule to minimize the total production time / total elapsed time subject to minimization
of the total rental cost of the machines, under the rental policy P.
8
9. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
Job Machine M1 Machine M2
i ai1 pi1 si1 qi1 ai2 pi2 si2 qi2
1 18 0.1 6 0.1 13 0.1 3 0.2
2 12 0.3 7 0.2 8 0.3 4 0.3
3 14 0.3 4 0.3 16 0.1 6 0.2
4 13 0.2 7 0.3 14 0.2 5 0.1
5 15 0.1 4 0.1 6 0.3 4 0.2
(Table 2)
Solution:
As per step 1: Expected processing and setup times for machines M1 and M2 are as shown in table 3.
As per step 2: The expected flow times for the two machines M1 and M2 are as shown in table 4.
As per step 3: Here β= (2, 4)
A 1 2.4 + 2.1 – 1.0 = 3.5, A 2 = 1.0 + 0.7 - 1.0 = 0.7.
' '
As per step 4: The new reduced problem is as shown in table 5.
As per step 5: Using Johnson’s method optimal sequence is
S = 5 – 1 – β – 3 i.e. 5 – 1 – 2 – 4 – 3.
As per step 6: The In-Out table for the sequence S is as shown in table 6.
As per step 7: Total elapsed time tn2(S1) = 19.8 units
As per Step 8: The latest time at which Machine M2 is taken on rent
n n 1
L2 (S ) tn,2 (S ) Ai,2 (S ) Si,2 (S )
i 1 i 1
= 19.8 – 9.9 – 3.1 = 6.8 units
As per step 9: The utilization time of Machine M2 is
U 2 (S ) tn2 (S ) L2 (S ) = 19.8 – 6.8 = 13.0 units
The Biobjective In – Out table is as shown in table 7.
n
Total Minimum Rental Cost = R( S ) Ai1 C1 U 2 (S ) C2 = 13.7 4 13.0 6 = 132.8 units.
i 1
10. Conclusion
If the machine M2 is taken on rent when it is required and is nreturned as n 1 as it completes the last job,
soon
the starting of processing of jobs at time L2 (S ) tn,2 (S ) Ai,2 (S ) Si,2 (S ) on M2 will, reduce the
1 i 1
idle time of all jobs on it. Therefore total rental cost of M 2 iwill be minimum. Also rental cost of M1 will
always be minimum as idle time of M1 is always zero. The study may further be extending by introducing
the concept of transportation time, Weightage of jobs, Breakdown Interval etc.
References
Bagga, P.C.(1969), “Sequencing in a rental situation”, Journal of Candian Operation Research Society 7, pp
152-153.
Bagga, P.C.& Bhambani, A.(1997), “Bicriteria in flow shop scheduling problem”, Journal of Combinatorics,
Information and System Sciences 22, pp 63-83.
9
10. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
Chakarvarthy K. & Rajendrah, C.(1999), “A heuristic for scheduling in a flow shop with bicriteria of
makespan and maximum tardiness minimization”, Production Planning & Control, 10 (7), pp 707-714.
Chandrasekharan Rajendran (1992),“Two Stage flow shop scheduling problem with bicriteria”, Operational
Res. Soc, 43(9), pp 871-884.
Dileepan, P. & Sen, T.(1988), “Bicriteria state scheduling research for a single machine”, OMEGA 16, pp
53-59.
Gupta, D., Singh, T.P. & Kumar, R.(2007), “Bicriteria in scheduling under specified rental policy, processing
time associated with probabilities including job block concept”, Proceedings of VIII Annual Conference of
Indian Society of Information Theory and Application (ISITA), pp. 22-28.
Gupta, D.& Sharma, S.(2011), “Minimizing rental cost under specified rental policy in two stage flow shop,
the processing time associated with probabilities including break-down interval and job – block criteria” ,
European Journal of Business and Management 3( 2), pp. 85-103.
Gupta, D., Sharma, S., Gulati, N.& Singla, P.(2011), “Optimal two stage flow shop scheduling to minimize
the rental cost including job- block criteria, set up times and processing times associated with
probabilities”, European Journal of Business and Management 3( 3), pp. 268- 286.
Johnson, S.M.(1954), “Optimal two and three stage production schedule with set up times included”, Naval
Research Logistics Quart. 1(1), pp 61-68.
Maggu P.L. and Das G., “Equivalent jobs for job block in job scheduling”, Opsearch, Vol 14, No.4, (1977),
pp 277-281.
Narian,L. & Bagga, P.C.(1998), “Minimizing hiring cost of machines in n x 3flow shop problem”, XXXI
Annual ORSI Convention and International Conference on Operation Research and Industry, Agra[India].
Narain, L.(2006) , “Special models in flow shop sequencing problem”, Ph.D. Thesis, University of Delhi,
Delhi.
Singh, T.P., Kumar, R. & Gupta, D.(2005) , “Optimal three stage production schedule, the processing and set
up times associated with probabilities including job block criteria”, Proceedings of the national Conference
on FACM,(2005), pp 463-470.
Sen, T. & Gupta, S.K.(1983),“A branch and bound procedure to solve a bicriteria scheduling problem”, AIIE
Trans., 15, pp 84-88.
Sen T. and Deelipan P.(1999), “A bicriteria scheduling problem involving total flow time and total
tardiness”, Journal of Information and Optimization Sciences, 20(2), pp 155-170.
Smith, W.E.(1956), “Various optimizers for single stage production”, Naval Research Logistics 3 , pp 59-66.
Smith, R.D.& Dudek, R.A.(1967) “A general algorithm for solution of the N-job, M-machine scheduling
problem”, Operations Research15(1) , pp 71-82.
Van, L.N., Wassenhove & Gelders, L.F. (1980), “Solving a bicriteria scheduling problem”, AIIE Tran 15s.,
pp 84-88.
Van, L.N., Wassenhove & Baker, K.R., “A bicriteria approach to time/cost trade-offs in sequencing”, EJOR
11, pp 48-54.
10
11. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
Tables
Table 3: The expected processing and setup times for machines M1 and M2 are as follows:
Job Machine M1 Machine M2
I Ai1 Si1 Ai2 Si2
1 1.8 0.6 1.3 0.6
2 3.6 1.4 2.4 1.2
3 4.2 1.2 1.6 1.2
4 2.6 2.1 2.8 0.5
5 1.5 0.4 1.8 0.8
Table 4: The expected flow times for the two machines M1 and M2 are
Job Machine M1 Machine M2
‘
I A i1 A‘i2
1 1.2 0.7
2 2.4 1.0
3 3.0 0.4
4 2.1 0.7
5 0.7 1.4
Table 5: The new reduced problem is
Job Machine M1 Machine M2
‘
i A i1 A‘i2
1 1.2 0.7
β 3.5 0.7
3 3.0 0.4
5 0.7 1.4
11
12. Industrial Engineering Letters www.iiste.org
ISSN 2224-6096 (print) ISSN 2225-0581 (online)
Vol 1, No.1, 2011
Table 6: The In-Out table for the sequence S is
Jobs Machine M1 Machine M2
i In - Out In - Out
5 0.0 – 1.5 1.5 – 3.3
1 1.9 – 3.7 4.1 – 5.4
2 4.3 – 7.9 7.9 – 10.3
4 9.3- 11.9 11.9 – 14.7
3 14.0– 18.2 18.2 – 19.8
Table 7: The Biobjective In – Out table is as follows
Jobs Machine M1 Machine M2
i In - Out In - Out
5 0.0 – 1.5 6.8 – 8.2
1 1.9 – 3.7 9.0 – 10.3
2 4.3 – 7.9 10.9 – 13.3
4 9.3- 11.9 14.5 – 17.3
3 14.0 – 18.2 18.2 – 19.8
12
13. International Journals Call for Paper
The IISTE, a U.S. publisher, is currently hosting the academic journals listed below. The peer review process of the following journals
usually takes LESS THAN 14 business days and IISTE usually publishes a qualified article within 30 days. Authors should
send their full paper to the following email address. More information can be found in the IISTE website : www.iiste.org
Business, Economics, Finance and Management PAPER SUBMISSION EMAIL
European Journal of Business and Management EJBM@iiste.org
Research Journal of Finance and Accounting RJFA@iiste.org
Journal of Economics and Sustainable Development JESD@iiste.org
Information and Knowledge Management IKM@iiste.org
Developing Country Studies DCS@iiste.org
Industrial Engineering Letters IEL@iiste.org
Physical Sciences, Mathematics and Chemistry PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research JNSR@iiste.org
Chemistry and Materials Research CMR@iiste.org
Mathematical Theory and Modeling MTM@iiste.org
Advances in Physics Theories and Applications APTA@iiste.org
Chemical and Process Engineering Research CPER@iiste.org
Engineering, Technology and Systems PAPER SUBMISSION EMAIL
Computer Engineering and Intelligent Systems CEIS@iiste.org
Innovative Systems Design and Engineering ISDE@iiste.org
Journal of Energy Technologies and Policy JETP@iiste.org
Information and Knowledge Management IKM@iiste.org
Control Theory and Informatics CTI@iiste.org
Journal of Information Engineering and Applications JIEA@iiste.org
Industrial Engineering Letters IEL@iiste.org
Network and Complex Systems NCS@iiste.org
Environment, Civil, Materials Sciences PAPER SUBMISSION EMAIL
Journal of Environment and Earth Science JEES@iiste.org
Civil and Environmental Research CER@iiste.org
Journal of Natural Sciences Research JNSR@iiste.org
Civil and Environmental Research CER@iiste.org
Life Science, Food and Medical Sciences PAPER SUBMISSION EMAIL
Journal of Natural Sciences Research JNSR@iiste.org
Journal of Biology, Agriculture and Healthcare JBAH@iiste.org
Food Science and Quality Management FSQM@iiste.org
Chemistry and Materials Research CMR@iiste.org
Education, and other Social Sciences PAPER SUBMISSION EMAIL
Journal of Education and Practice JEP@iiste.org
Journal of Law, Policy and Globalization JLPG@iiste.org Global knowledge sharing:
New Media and Mass Communication NMMC@iiste.org EBSCO, Index Copernicus, Ulrich's
Journal of Energy Technologies and Policy JETP@iiste.org Periodicals Directory, JournalTOCS, PKP
Historical Research Letter HRL@iiste.org Open Archives Harvester, Bielefeld
Academic Search Engine, Elektronische
Public Policy and Administration Research PPAR@iiste.org Zeitschriftenbibliothek EZB, Open J-Gate,
International Affairs and Global Strategy IAGS@iiste.org OCLC WorldCat, Universe Digtial Library ,
Research on Humanities and Social Sciences RHSS@iiste.org NewJour, Google Scholar.
Developing Country Studies DCS@iiste.org IISTE is member of CrossRef. All journals
Arts and Design Studies ADS@iiste.org have high IC Impact Factor Values (ICV).