1

FLOW JOB SCHEDULING

Members of Group 13 :
1.Kaustav Dey - 13000119056
2.Shreyashi Muhury - 13000119057
3.Subham Ghosh -13000119058
4.Debjit Datta - 13000119059

12-21-2021
 2

CONTENTS
1.Introduction
2.Formal Definition
3.Types of Schedule
4.Non-Preemptive Schedule
5.Preemptive Schedule
6.Flow Shop Scheduling Problem
7.WorkFlow in Flow Shop Scheduling
8.The Performance Criteria
9.Complexity
10.Example
11.Conclusion
12.Acknowledgement
13.Resources
12-21-2021
 3

INTRODUCTION

• Flow-shop scheduling is an optimization problem in computer science and

operations research.
• It is a variant of optimal job scheduling.
• Flow-shop scheduling is a special case of job-shop scheduling where there
is strict order of all operations to be performed on all jobs.

12-21-2021
 4

FORMAL DEFINITION
1. Flow shop scheduling problems are a class of scheduling problems with a
workshop or group shop.
2. If there is more than one machine and there are multiple jobs, then each job
must be processed by corresponding machine or processor.
3. Solution methods of Flow shop scheduling are Branch and Bound, Dynamic
programming, Heuristic algorithm and Meta-heuristics.

12-21-2021
 5

TYPES OF SCHEDULE

• Non-Preemptive Schedule

• Preemptive Schedule

12-21-2021
 6

NON- PREEMPTIVE SCHEDULE

• Non-Preemptive Schedule is processing of a task on any processor is not
terminated until the task is complete.

• It waits till the process completes its CPU burst time, and then it can
allocate the CPU to another process.

12-21-2021
 7

PREEMPTIVE SCHEDULE

• Preemptive Schedule is processing of a task on a processor may be

terminated and another task may be assigned to the processor.

• The resources (mainly CPU cycles) are allocated to the process for a
limited amount of time and then taken away, and the process is again
placed back in the ready queue if that process still has CPU burst time
remaining.

12-21-2021
 8

FLOW SHOP SCHEDULING PROBLEM

1) All ‘n’ jobs are available for processing, beginning on machine1, at time zero.

2) Once started into the process, one job may not pass another, but must remain in the same
sequence position for its entire processing through the ‘m’ machines.

3) Each job may be processed on only a single machine at one time, so that job splitting is not
permitted.

4) There is only one of each type of machine available.

5) At most, only one job at a time can be processed on an individual machine.

12-21-2021
 9

CONT…
6) The processing times of all ‘n’ jobs on each of the ‘m’ machines are predetermined.

7) The set-up times for the jobs are sequence independent so that set-up times can be considered a
part of the processing times.

8) In-process inventory is allowed between consecutive machines in the production system.

9) Non-preemption; whereas operations can not be interrupted and each machine can handle only
one job at a time.

10) Skipping is allowed in this model.

12-21-2021
 10

WORK FLOW IN FLOW SHOP SCHEDULING

MODEL

12-21-2021
 11

THE PERFORMANCE CRITERIA

The performance Criteria are those most commonly used as proposed by Stafford, for
optimizing the general flowshop.

1. Makespan: Throughout the half century of flowshop scheduling research, the

predominant objective function has been to minimize make-span. The expression used is as
follows:

Minimize: Cmax

e
12-21-2021
 12

THE PERFORMANCE CRITERIA…

2. Mean Completion Time: Conway et al. (1967), Panwalker and Khan (1975), Bensal (1977),
and Scwarc (1983) have all discussed mean job completion time or mean flow time as an
appropriate measure of the quality of a flowshop scheduling problem solution. Mean job
completion time may be expressed as follows:

12-21-2021
 13

THE PERFORMANCE CRITERIA…

3. Total Waiting Time : Minimizing total job idle time, while the jobs wait for the next machine
in the processing sequence to be ready to process them, may be expressed as follows:

12-21-2021
 14

THE PERFORMANCE CRITERIA…

4. Total Idle Time: Overall all machine idle time will be considered in this model (the time that
machines 2,…. , M spend waiting for the first job in the sequence to arrive will be counted).
Overall machine idle time may be minimized according to the following expression:

12-21-2021
 15

EXAMPLE
• Schedule two jobs on 4 machine using flow shop scheduling technique. The
time required by each operation of these jobs is given by following matrix.

12-21-2021
 16

• Given that there are 4 machines, the flow shop scheduling for these
operations is a shown below in figure 5 and 6.

12-21-2021
 17

COMPLEXITY

As presented by Garey et al. (1976),most of extensions of the flow-shop-scheduling

problems are NP-hard and few of them can be solved optimally in O(nlogn); for example,
F2|prmu|Cmax can be solved optimally by using Johnson's Rule.

e
12-21-2021
 18

APPLICATIONS

1. N machines and m jobs.

2. Each job with n operations.
3. No machine can perform more than one operation simultaneously.
4. Operations within one job must be performed in specified order
5. The problem is to determine the optimal schedule.

12-21-2021
 19

CONCLUSION

The primary concern of flow shop scheduling is to obtain the best sequence which
minimizes the makespan, flow time, idle time,tardness etc. In this work makespan and total
time of the obs are considered for minimization.

12-21-2021
 20

ACKNOWLEDGEMENT
We would like to express our special thanks of gratitude to our professor Mr Mrinal kanti Nath who
gave us the golden opportunity to work on this wonderful project, which also helped us in doing a lot of
research and we came to know about so many new things which helped in enhancing our knowledge.
Secondly , We would also like to thank our team members who helped us a lot in finalizing this project
within the limited time frame. We are really thankful to all of them.

12-21-2021
 21

RESOURCES

• https://en.wikipedia.org/wiki/Flow-shop_scheduling
• https://cupdf.com/document/flow-shop-scheduling-568cab61e8914.html
• https://link.springer.com/book/10.1007/978-1-4614-5152-5
• https://www.sciencedirect.com/science/article/abs/pii/S0957417419304774
• https://arrow.tudublin.ie/cgi/viewcontent.cgi?article=1086&context=buschmarcon
• https://www.hindawi.com/journals/jam/2020/7132469/

12-21-2021

·
 22

12-21-2021