Scheduling of Flowshop Type Production with

Dannenbring Method to Obtain Optimal Results with

Observing Waiting Time and Weight of Jobs

Ulfa Rahmani1, Elis Ratna Wulan2, Arief Fatchul Huda2, Sudradjat Supian3,
Subiyanto4
1Master Program in Mathematics, Faculty Mathematics and Natural Science, Universitas Padjadjaran,
Indonesia
2Department of Mathematics, Faculty Science and Technology, Universitas Islam Negeri Sunan
Gunung Djati Bandung, Indonesia
3Department of Mathematics, Faculty of Mathematics and Natural Science, Universitas Padjadjaran,
Indonesia
4Department of Marine Science, Faculty of Fishery and Marine Science, Universitas Padjadjaran,
Indonesia

*E-mail address: [email protected]

ABSTRACT
Linear programming is a step or process to get maximum results with existing resources or it can be
said the process of looking for optimal value. One part of scheduling is production scheduling.
production scheduling is the use of resources that are few but make the most profit. This paper discusses
production scheduling using flowshop type production scheduling by taking into account transportation
times and work weights used the Dannenbring method with the aim of finding the optimal sequence of
problems by considering the total production time (makespan) and the average Weigted Mean Flow
Time (WMFT). Based on the results of the Dannenbring method, the results of flowshop scheduling are
obtained with a total makespan of 75 hours and the WMFT value is 28,87 hours.
Keywords : Linear Programming, Makespan, Weigted Mean Flow Time.

1. INTRODUCTION
Linear programming is a method used to make a decision in solving numerical problems
[Pugazhenthi., R et all 2014]. In linear programming, there is one of the most frequently
discussed aspects, namely scheduling [González-Neira. E. M et all., 2017] Scheduling is a step
to place resources at a certain time to get the most optimal results. Production scheduling is a
step in making decisions in placing the resources in a production process in order to get optimal
results so as to generate large amounts of profit [Allahverdi., 2015]. Through scheduling we
can determine the amount of use of available resources with existing problems so that we get
the most optimal results [Pinedo, 2012]. Production scheduling process itself there are two
kinds of scheduling, the scheduling and rescheduling flowshop Jobshop [Garey, MR 1976].
The very basic difference between the two is the process flow on the machine used. In the
flowhop scheduling process, it can be said that the flow or plot created is serial or chain flow
[Lee, T et all 2019], while the jobshop type production scheduling is random [TC Edwin Cheng
et.al]. Decisions made for processing flow affect work processing time (Ahonen et all 2016).
In a production process the possibility of scheduling will have several problems in its
implementation [Rahmani, D ,. Et all 2014]. This happens because there are several factors
such as, on some machines there is maximum capacity in its used [Javad, S 2018], machine
availability, the arrival of a new job, a change of priority job, an employee vacancy, and an
order cancellation, are common events on production scheduling [Nasr., Et all 2011], [Fahmy,
S. A et all 2008], [Subramaniam, V., et all 2005]. Therefore, it is necessary to examine the
constraints that cause the production process to not be good. Many studies have examined
various kinds of problems in the production process, Lin, TK. et all 2014] parallel machine
scheduling that is not related to the installation time depending on the sequence and the
machine and time is ready to minimize the total weighted delay (TWT). [Ahmad. Q. S et all
2015] Scheduling problems with setting time, transportation time, loading time, loading time
minimizes total production costs, total workload and release process. [Ribas., I et all 2015]
Discusses the blocking flow shop problem to minimize total flow time. [Gupta et.al 2012] also
proves algorithms for scheduling and workflow shop scheduling problems with the time of
transport and processing. [Chen, W., et all 2016] Rescheduling is known as complete rerouting
(CR) for an easy manufacturing system. Machines. [Pandian et all 2010] optimal scheduling
for flow-shop scheduling problems involving transportation time, strike time and work weight
(constraints of flow-shop scheduling) with 3-machines. [Abdeljaouad, M.A., et all 2015] job-
shop scheduling problem with reverse flows, which is characterized by two work streams that
include the same machine in the opposite direction aiming to minimize the maximum
completion time of the work (makespan). [Wan, L et all 2013] the new primary – secondary
criteria scheduling problem on identical machines with the intention of is to minimize the total
T-time of all machines, where the total completion time of all jobs is to minimize the maximum
completion time. [Lin, S] The permutation flowshop scheduling problem with the objective of
minimizing total flow time is known as NP-hard problems, events for the two-machine cases.
In general, scheduling aims to obtain efficient use of facilities, time and reduce
production costs. The obstacles faced in scheduling are basically related to [2]:
1. Limited available resources.
2. Technology constraints in relation to the sequence of implementation of activities.
3. The deadline for completion is in accordance with the target.
4. The nature and conditions of a job.
The preparation of a scheduling that is solely based on intuition or mere estimates will
affect the amount of actual and produced production. In this case the production scheduling
will cause idle time and also the idle capacity of the engine used in the production process.
This is clearly a factor that can harm the company. Therefore, in this paper the optimal time
for each machine and job is considered , and the method used is the Heuristic method where
this method sorts the scheduling of types of flowshop production so that it can generate
displacement between machines and jobs based on makespan value which is an effective
method of resource utilization [Aydilek, A., et all]. The main objective is to determine the best
possible schedule and order of work to minimize the total production time by taking into
account the waiting time and work weight. The most common goal for this problem is
makespan [Yenisey, M et all 2015]. Job evaluation and differentiation are crucial in scheduling.
Since jobs can be represented by vectors of processing times, the average, standard deviation,
and skewness of job processing times can be defined as the moments of their probability
distribution. The first and the second moments of processing times are effective in sorting jobs
(Dong et al., 2008), however they are not yet optimized to characterize and differentiate
distributions of similar jobs.

2. MATERIAL AND METHOD

2.1. Flowshop Scheduling

The flowshop scheduling model is an effective tool for management that can be used
to model multiple services and has excellent adaptability with most real-world problems
[Ebrahimi, M., et all 2014]. Flowshop configuration are commonplace in munafacturing setting
where a set of jobs 𝑁 = {1,2, … , 𝑛} are processed by a set of machines 𝑀 = {1,2, … , 𝑚}. Each
job goes through the machines in the same technological order, i.e. it starts at machine 1, the
goes to machine 2, … up to mechine 𝑚 [Rossit, D. A., et all 2018]. In the Flowshop problem,
it is assumed thatthe jobs have to pass through all stages in the same order and there are at least
one stage having multiple machines. Addition-ally, one machine can only process one job at a
time. As to one single job, it can be processed by only one machine at a time. Preemption of
processing is not allowed [Cui, Z., et all 2015]

Scheduling flowshop divided into 2 flowshop pure and general flowshop. Scheduling
pure flowshop is a production planning problem with n jobs (of items, tasks, etc.) that must be
processed in the same order on each machine 𝑚. Examples of scheduling pure flowshop are
cake making, where each production must go through a machine in sequence.

Figure 1. Flowshop Workflow

General Flowshop is a production plan that must be in the same order and does not have
to go through every machine. Each job has a different processing time for different machines.
Examples of general flowshop scheduling such as clothing production, not all clothing
produced produces perfect results, there are some clothes that may not be perfect in the
production process, for example when through sewing machines, the clothes are good, but
when entering a screen printing machine, there may be some not good, poor clothes can be
reproduced again and do not need to go through a sewing machine, but directly through a screen
printing machine. In essence, public flowshop does not have to go through all the machines in
the production flow.
Some characteristics of flowshop scheduling include [ Li, W et all 2015 ]:
1. is available machine 𝑚 and jobs 𝑛.
 2. Each job consists of operation 𝑚 and each operation requires a different machine.
3. Job 𝑛th selected in the same order as machine 𝑚.
4. The processing time of the job 𝑖th engine 𝑗th is denoted by.𝑡𝑖,𝑗 (𝑖 = 1,2, … , 𝑛 and
𝑗 = 1,2, … , m)
5. A schedule is arranged in the form of a job sequence , which will fulfill a specific goal.
The purpose often used is to minimize makespan.
2.2. Processing Time
Scheduling can be said to be optimal if you get the most results by using the most
minimal resources. The most expensive resource used in a scheduling or production process is
time. A production process can be said to be optimal if the time used for production is small.
That is, the amount of time used for a production must be inversely proportional to the results
achieved so that a production process can be said to be optimal.
The time passed in a production process has several aspects, namely the start time, the
time of transfer between machines, waiting time, and time to finish. As for what is said to be
breaktime or pause time, that is the time in the event of an error or obstacle that makes the
production process stop. So, it can be concluded that the time passed by a production is the
difference between the production time and the time when the production begins. In order to
be able to reduce the time used to a little possible, a company must be able to schedule a
production process taking into account the time of transfer between machines and waiting
times. In scheduling production types of flowshop the time used can be used up to a little
possible by considering several things. So, we can sort the scheduling of types of flowhop
production so that it can produce the transfer time between machines and the waiting time to
be a little. There are several methods that are generally used to get the most optimal results
using the least amount of time.
2.3. Transportation Time
Transportation time (𝑡𝑖) is the time of transfer that occurs on one machine to another
or in other words waiting time ( waiting time ) or no activity occurs while the engine is working.
Time of transportation is one of the things that need to be considered, because it
involves the production process. In other words, transportation time is one of the capacity
constraints which means the different capacities of each machine in one production process.
This is a consideration in measuring the performance of production scheduling, namely
flowtime . Generally there are several jobs that must be completed, each of which has a
different processing time, therefore there is an average of each processing time in each job,
namely Mean Flow Time (MFT) , which becomes the scheduling performance measurement
criteria in this thesis. This criterion shows the average time spent on each job on the factory
floor. Flowtime is the difference between the completion time and the start time for each job 𝑖.
𝑛
1
𝐹= ∑ 𝐹𝑖
𝑛𝑖=1

𝑛 = the number of parts produced

2.4. Weight of Jobs

Weight of Jobs is a value determined by priority rules, so a high-weight job is generally
completed earlier than a low-weight job. Even the priority rules used are a company policy
regarding production scheduling. Shortest Processing Time (SPT) is a method that prioritizes
the completion of the production process based on the fastest processing time.
Weight of Jobs is one thing that needs to be considered, because it involves the
production process. In other words, work weight is one of managerial constraint, which means
an obstacle that occurs due to incompatibility of company policy with a operated production
system. This is a consideration in measuring the performance of production scheduling, namely
the flowtime that has been weighted. Generally there are several jobs that must be completed,
each of which has a different processing time after being weighted according to the priority
rules of the company, therefore there is an average of each processing time in each job that has
been weighted namely Weight Mean Flow Time (WMFT) , which became the scheduling
performance measurement criteria in this paper [Y.Liu., et all 2014]. Definition of weight mean
flowtime is similar to the mean flowtime, but considers the priority of work for each job in its
calculation.
∑𝑛𝑖=1 𝑊𝑖 𝐹𝑖
𝐹̅𝑤 =
∑𝑛𝑖=1 𝑊𝑖

2.5. Johnson Rules

Johnson's rule is a technique to minimize processing time in a production. This Johnson
rule is used for production that uses more than 2 machines. That is, a product passes several
operations from start to finish [Dang., F et all 2018].
However, to be able to use Johnson's rules, several conditions must be met, including:
1. The time of production or operation on the certiap job or order must be known and
constant or fixed.
2. Processing time does not depend on the order.
3. Job priority rules are not taken into account.
4. Every job must go through the same processes or operations.
The use of this Johnson rule is to reduce the pause time or production waiting time on
one machine to the next. To get the order using Johnson rules are as follows [Conway, RW et
all 1967]:
1. Sort all orders based on production time, the order made is from the job with the least
production time until the job with the longest production time.
2. If there are two or more production machines.
3. Job that has the same production time on a machine, then jobs that have longer time on
the next machine will be produced first.
4. The saving time is the difference in time before using Johnson's rules after using
Johnson's rules in the production process.
2.6 The Dannenbring Method
The Dannenbring method is a method developed or derived from the Johnson method
(1954). This method is able to solve scheduling problems involving more than two (2)
machines [Panneerselvan., 1999].
Problems that involve more than two machines are converted into a recapitulation table
consisting of two 𝑃𝑖 values, i.e. 𝑃𝑖1 and 𝑃𝑖2 , which is the job 1st processing time in the 𝑛th
engine. The following equation shows the formula of the Dannenbring method [Dannenbring,
D. G 1977].
𝑚
𝑇𝑗1 = ∑ (𝑚 − 𝑖 + 1)∗ 𝑡𝑖𝑗
𝑖=1

from the equations 3 above, the time for the first engine and the processing time. After that the
job scheduled with Johnson's algorithm, using parameters is 𝑇𝑗1 the process time on machine 1
and for the second machine will be obtained
𝑚
𝑇𝑗2 = ∑ 𝑖 ∗ 𝑡𝑖𝑗
𝑖=1

and is 𝑇𝑗2 the processing time on machine 2 [Wang, F. Et all 2011].

The Local Search Mechanism design is obtained based on the values in the table 𝑃𝑖1
and 𝑃𝑖2 , the results of the study find six local search categories for the data of job processing
time 𝑖th for machines 1 and 2, the first category is with [Dannenbring, D.G 1977]:
1. Positioning the minimum value in table 1 as the last job sequence, the process begins
by looking for the minimum value in the column 𝑃𝑖2 ;
2. Positioning the minimum value in table 1 as the last job sequence, the process begins
by looking for the minimum value in the column 𝑃𝑖1 ;
3. Positioning the minimum value at 𝑃𝑖1 the beginning and the minimum value at 𝑃𝑖2 the
end of the sequence, the process starts from 𝑃𝑖1 ;
4. Positioning the minimum value at 𝑃𝑖1 the beginning and the minimum value at 𝑃𝑖2 the
end of the sequence, the process starts from 𝑃𝑖2 ;
5. Positioning the minimum value in the initial order, the process starts from 𝑃𝑖1 ;
6. Positioning the minimum value in the initial sequence, the process starts from 𝑃𝑖2 .

3. RESULT AND DISCUSSION

The first step in the Dannenbring method is to get a table of expectation values for
each job.
Table 1. Data Scheduling Production of Case Examples
Job A 𝑡𝑎→𝑏 B 𝑡𝑏→𝑐 C 𝑊𝑖
1 5 5 8 3 8 4
2 8 3 9 2 6 3
3 10 1 4 4 7 2
4 9 4 7 5 5 1
5 7 5 6 1 9 5

𝐴: Process time on machine A

𝐵: Process time on machine B
C: Process time on machine C
𝐴𝑖 : Expactation of the 𝑖-th job process time on machine A
𝐵𝑖 : Expactation of the 𝑖-th job process time on machine B
𝐶𝑖 : Expactation of the 𝑖-th job process time on machine C
𝑡𝑠→𝑠+1 : The transport time of the 𝑖-th job moves to the next machine (𝑠 = 1, … 𝑚 − 2)
For the next step, the value will be calculated 𝐴𝑖 , 𝐵𝑖 and 𝐶𝑖
 𝐴𝑖 = 𝐴 + 𝑡𝑎→𝑏
𝐵𝑖 = 𝐵 + 𝑡𝑏→𝑐
𝐶𝑖 = 𝐶

Table 2. Processing Time on Fictive Machines

Job 𝐴′ 𝐵′ 𝐶′ 𝑊𝑖
1 10 11 8 4
2 11 11 6 3
3 11 8 7 2
4 13 12 5 1
5 12 7 9 5
After obtaining a value of 𝐴𝑖 , 𝐵𝑖 and 𝐶𝑖 calculated value from 𝐴𝑖 , 𝐵𝑖 and 𝐶𝑖
𝐴𝑖 𝐵𝑖 𝐶𝑖
𝐴𝑖 = 𝐵𝑖 = 𝐶𝑖 =
𝑊𝑖 𝑊𝑖 𝑊𝑖

Table 3. Process Time that has been weighted on a Fictitious Machine

Job 𝐴" 𝐵" 𝐶"
1 2,5 2,75 2
2 3,67 3,67 2
3 5,5 4 3,5
4 13 12 5
5 2,4 1,4 1,8

The next step is to find the value 𝑃𝑖1 and 𝑃𝑖2

Table 4. Job Processing Time to 𝑃𝑖1 and 𝑃𝑖2

Job 𝑃𝑖1 𝑃𝑖2
1 21,75 14
2 28,02 17,01
3 39 24
4 90 52
5 16.8 10.6

From the calculation of the values of 𝑃𝑖1 and 𝑃𝑖2 , the optimal order from the Dannenbring
method is obtained 4 − 3 − 2 − 1 − 5

Table 5. Makespan Value

Job A B C 𝑤𝑖 𝐹𝑖 𝑤𝑖 . 𝐹𝑖
4 0 – 13 13 – 25 25 – 30 1 30 30
 3 13 – 24 25 – 33 33 –40 2 27 54
2 24 – 35 35 – 46 46 – 52 3 28 84
1 35 – 45 46 – 57 57 – 65 4 30 120
5 45 – 57 57 – 64 65 – 74 5 29 145
15 144 433
MFT 28.8
WMFT 28.867

the result of makespan from the optimal sequence is obtained from 4 − 3 − 2 − 1 − 5

is 75 calculated by weighted mean flowtime using the formula
∑𝑛𝑖=1 𝑊𝑖 𝐹𝑖
𝐹= 𝑛
∑𝑖=1 𝑊𝑖

30+54+84+120+145 433
𝐹= = = 28.867jam
15 15

4. CONCLUSION
From the discussion above we see that the Dannenbring method is able to solve
flowshop scheduling problems with the optimal sequence 3 − 2 − 4 − 1 − 5 of the total
makespan of 75 hours. Then, from Table 3 we see flow time and weighted flow time of each
jobs. So, in the end we get the value of weighted mean flow time of 28.867 hours. In this study
the most optimal value is seen from the makespan value. But the value of weighted mean flow
time is affected by the mean flow time multiplied by the weight value of each job. Thus, it is
not possible to find results where the smallest makespan does not have a small weighted mean
flow time.

References
[1] A. Chaudhry, S. Mahmood, No-wait Flowshop Scheduling Using Genetic Algorithm,
Proceedings of the World Congress on Engineering ISSN: 2078- 0966 (Online), Vol. 3,
(2012).
[2] Abdeljaouad, M.A., Bahroun, A. Omrane, A. Fondrevelle. 2015. Job-shop Production
Scheduling with Reserve Flows. European Journal of Operational Research Vol. 244
pages 117-128 http://dx.doi.org/10.1016/j.ejor.2015.01.013
[3] Ahmad, Q. S. Khan, M. (2015). Constrained Flow-Shop Scheduling Problem with m
Machines. Journal of Multidisciplinary Engineering Science and Technology Vol. 2
Issue 2, 169-172.
[4] Ahonen, H. & de Alvarenga, A. G. (2016). Scheduling flexible flow shop with
recirculation and machine sequence dependent processing times: formulation ans
solution procedures. International Journal of Advance Manufacturing Technology, 89(1-
4), 765-777. doi:10.1007/s00170-016-9093-3
[5] Allahverdi, A. (2015). The Third Comprehensive Survey on Scheduling Problems with
Setup Times/costs. European Journal of Operational Reseach. 246(2), 345-378.
[6] Aydilek, A., Aydilek, H., & Allahverdi, A. (2015). Production in a two-machine
flowshop scheduling environment with uncertain processing and setup times to minimize
 makespan. International Journal of Production Research, 53(9), 2803–2819.
https://doi.org/10.1080/00207543.2014.997403
[7] Chen, W., Li, J., & Ma, W. (2016). Hybrid flow shop rescheduling algorithm for
perishable products subject to a due date with random invalidity to the operational unit.
International Journal of Advanced Manufacturing Technology, 93(1-4), 225-239.
doi:10.1007/s00170-016-8859-y
[8] Cui, Z., & Gu, X. (2015). An improved discrete artificial bee colony algorithm to
minimize the makespan on hybrid flow shop problems. Neurocomputing, 148, 248-259.
doi:10.1016/j.neucom.2013.07.056
[9] Conway, R. W., Maxwell, W. L. and Miller, L. W. 1967 Theory Of Scheduling Dover
Publications INC.
[10] Dang, F., Li, W., & Ye, H. (2018) An Efficient Constructive Heuristic to Balance Trade-
offs Between Makespan and Flowtime in Permutation Flow Shop Scheduling. 46th SME
North American Manufacturing Research Conference, NAMRC 46, Texas, USA
10.1016/j.promfg.2018.07.005
[11] D.G. Dannenbring, An evaluation of flow shop sequencing heuristics, Management Sci.
23, 1273-1283, (1977).
[12] X. Dong, H. Huang, P. ChenAn improved NEH-based heuristic for the permutation
flowshop problem Comput. Oper. Res., 35 (2008), pp. 3962-3968
[13] Ebrahimi, M., Fatemi Ghomi, S. M. T., & Karimi, B. (2014). Hybrid flow shop
scheduling with sequence dependent family setup time and uncertain due dates. Applied
Mathematical Modelling, 38(9-10), 2490-2504. doi:10.1016/j.apm.2013.10.061
[14] Fahmy S.A, Balakhrihman S, EIMekkawy TY (2008) A Generic deadlock-free Reactive
Scheduling Approach. Int J Proud Res 46(1):1-20
[15] Fuchigami, H.Y et all (2017). A Survey of Case Studies in Production Scheduling:
Analysis and Perspectives. Journal of Computational Science
https://doi.org/10.1016/j.jocs.2017.06.004
[16] Garey, M.R., D.S.. Johnson, and R. Sethi. 1976. The complexity of flowshop and job
shop scheduling. Mathematics of Operations Research, 1 (2), 117-121
[17] Ginting, Rosnani. (2009). Penjadwalan Mesin. Yogyakarta : Graha Ilmu

[18] Gonzalez-Neira, E.M et all (2017). Flow-Shop Sceduling under Uncertainties: Riview
and Trends. International Journal of Industrial Engineering Computation 8 (2017) 399–
426 doi: 10.5267/j.ijiec.2017.2.001
[19] Grabowski J, Wodecki M (2004). A very fast tabu search algorithm for the permutation
flow shop problem with makespan criterion. Computers & OR, 31: 1891-1909
[20] Gupta, D,. Singla,. P and Bala., “Constrained n-job, 3-machine flow shop scheduling
problem with transportation time” IJRAES, Vol.2 Issue2,Feb(2012), ISSN 2249-
3905.pp782-785.
[21] Hossain, M., Asadujjaman, M., Nayon, M. A. Bhattacharya, P. (2014). Minimization of
Makespan in Flow Shop Scheduling Using Heuristics. International Conference on
Mechanical, Industrial and Energy Engineering 2014 ICMIEE-PI-140163-2.
[22] Javad,. S (2018) "The Integration of Maintenance Decisions and Flow Shop Scheduling.
" PhD diss., University of Tennessee, 2018.
https://trace.tennessee.edu/utk_graddiss/4965
[23] Lee, T., et all (2019). A Riview of Scheduling Problem and Resolution Methods in
Flexible Flow Shop. International Journal of Industrial Engineering Computation, 10(1),
67-88.
[24] Li, Dai & Zhang (2015). Relationship between Maximum Completion Time and Total
Completion Time. Procedia Manufacturing, Vol. 1, 2015, Pages 146-156
[25] Lin, S. Huang, C. Lu, C. & Ying, K (2012). Minimizing Total Flow Time in Permutation
Flowshop Environment. ICIC International, Vol 8, Number 10(A)
[26] Lin, Y. K., & Hsieh, F. Y. (2014). Unrelated Parallel Machine Scheduling with
SetupTimes and Ready Times. International Journal of Production Research, 52(4),
1200-1214 https://doi.org/10.1080/00207543.2013.848305
[27] Maflahah, I., Mahcfud., Udin, F., “Model Penunjang Keputusan Jadwal Produksi Jus
Buah Segar”, Jurnal Teknik Industri, Februari 2012; hal. 51-59.
[28] Nasr A-H, EIMekkawy TY (2011) Robust and stable flexible job shop scheduling with
random machine breakdowns using a hybrid genetic algorithm. Int J Prod Econ
132(2):279–291
[29] Pandian, P. Rajendran, P. (2010). Solving Constrained Flow-Shop Scheduling Problems
with Three Machines. Int. J. Contemp. Math. Sciences, Vol. 5, 2010, Pages. 19, 921 -
929.
[30] Panneerselvam, R. (1999). Heuristic for Moderated Job Shop Scheduling Problem to
Minimize Makespan. Industrial Engineering Journal, 28, 26-29.Note that the journal title,
volume number and issue number are set in italics.
[31] Pinedo, M.L. (2012). Scheduling Theory, Algorithms, and Systems. Springer, New York,
USA
[32] Pugazhenthi., R & Xavior, A. M (2014). A Genetic Algorithm Applied Heuristic to
Minimize the Makespan in a Flow Shop. Procedia Engineering 97 (2014) 1735 – 1744
doi:10.1016/j.proeng.2014.12.325
[33] Rahmani, D., & Heydari, M. (2014). Robust and stable flow shop scheduling with
unexpected arrivals of new jobs and uncertain processing times. Journal of
Manufacturing Systems, 33(1), 84–92. https://doi.org/10.1016/j.jmsy.2013.03.004
[34] Ribas, I., & Companys, R. (2015). Efficient heuristic algorithms for the blocking flow
shop scheduling problem with total flow time minimization. Computers & Industrial
Engineering, 87, 30-39. doi:10.1016/j.cie.2015.04.013
[35] Rossit, D. A., Tohmé, F., & Frutos, M. (2018). The non-permutation flow-shop
scheduling problem: a literature review. Omega, 77, 143-153.
[36] Sadjadi, S., Aryanezhad, M. Ziaee, M. (2008). The General Flowshop Scheduling
Problem: Mathematical Models. Journal of Applied Science 8(17), 3032-3037.
[37] Semančo, P. Modrák, V. (2012). A Comparison of Constructive Heuristics with the
Objective of Minimizing Makespan in the Flow-Shop Scheduling Problem. Acta
Polytechnica Hungarica Vol. 9, No. 5, 177-190.
[38] Subramaniam V, Raheja AS, Reddy KRB (2005) Reactive Repair Tool for Job Shop
Schedule. Int J Prod Res 43:1-23
[39] T. C. Edwin Cheng, Jatinder N. D. Gupta, Guoqing Wang “A review of flowshop
scheduling research with setup times” Production and operation management, Volume 9,
Issue 3,September 2000 , Pages 262–282, ISSN 1937-5956.
[40] Wang,F., Rao, Y., Desaign and Application of a New Hybrid Heuristic Algorithm for
Flowshop Scheduling, International Journal Computer Network and Information
Security, March 2011; hal. 41 – 49.
[41] Wan, L. Ma, Ran. & Yuan, J., 2013 Primary–secondary bicriteria scheduling on identical
machines to minimize the total completion time of all jobs and the maximum T-time of
all machines. Theorical Computer Science, Vol 518 pages 117-123
http://dx.doi.org/10.1016/j.tcs.2013.05.034
[42] Yenisey, M., & Yagmahan, B. (2014). Multi-objective permutation flow shop scheduling
problem: Literature review, classification and current trends. Omega, 45, 119-135.
[43] Y.Liu, H. Dong, N. Lohse,S. Petrovic, N. Gindy, An investigation into minimizing total
energy consumption and total weighted tardiness in job shops, J. Clean. Prod. 65 (2014)
87–96