Anda di halaman 1dari 3


JOURNAL: Int. J. Logistics Economics and Globalisation

PAPER TITLE: Optimisation of sequencing and scheduling in hybrid flow shop environment using heuristic

Page Section Paragraph Line Delete Add/amend

No. No.
1 Keywords 1 2 algorithm; SAA algorithm; Scheduling.
3 Literature 2 1 ……….time needed.
survey Tsubone et al (1993) addressed the production
scheduling system for photographic film
manufacturing industries. The system designed for this
study showed more favourable results than the
conventional system. Uetake et al. (1995)…….
3 Literature 2 3 ……..performance. Delaney et al (1995) addressed the
survey method for the design of hybrid, cellular/functional,
facilities for minimization of inter-cell material
handling and the maximization of intra-cell directional
material flow and develop a shop redesign plan that
maximizes the net benefit obtained from the facility
3 Literature 3 1 Ouz and Fkret Ercan (1997) addressed the several
survey efficient heuristic algorithms to schedule unit
processing time multiprocessor tasks in a two-stage
hybrid flow-shop for minimizing makespan. Portmann
et al. (1998) …………
3 Literature 3 5 ………of this algorithm. Linn et al (1999) addressed
survey survey of hybrid flow shop scheduling the state of art
and discusses in details their contributions and
concluded with suggestions for future research
directions. Riane et al. (1999)..............
3 Literature 3 10 solutions. Shambu and Suresh (2000) addressed the
survey performance of hybrid cellular manufacturing (CM)
systems is compared with that of functional layouts
that use traditional job shop procedures as well as part
family scheduling rules, under a variety of shop
operating conditions. Lee and Shaw (2000) addressed
the problem of sequencing a set of jobs that arrive in
different combinations over time in a manufacturing
flow-shop and focus on the development of a two-
level neural network. Moursli and Pochet (2000)…….
3 Literature 3 13 bounds. Emmanuel Neron et al (2001) addressed the
survey use of satisfiability tests and time-bound adjustments
based on energetic reasoning and global operations can
enhance the efficiency of branch and bound
procedures for optimally solving the hybrid flow shop
scheduling problem. Riane et al. (2001)...............
4 Literature 1 2 ………..the makespan. Engin and Döyen (2004)
survey addressed the intelligent problem-solving technique
that has been used in scheduling problems through
Artificial immune system (AIS). The n-job, k-stage
hybrid flow shop problem is one of the general
production scheduling problems for minimize the
makespan. Ruiz and Maroto…….
4 Literature 1 2 Ruiz and Maroto Ruiz and Maroto (2005) presented......
survey (2004) presented......
4 Literature 1 29 ………..weighted waiting time. Liu et al (2008)
survey addressed the permutation flow shop scheduling
problem (PFSSP) with the limited buffers between
consecutive machines to minimize the maximum
completion time by using an effective hybrid
algorithm based on particle swarm optimization
(HPSO). Figielska (2009) addressed for solving the
problem of scheduling in a two-stage flow shop with
parallel unrelated machines and additional renewable
resources at the first stage and a single machine at the
second stage to minimization of makespan by using
heuristic approach. Kuo et al. (2009)……….
5 Literature 1 14 ……..near-optimal solutions. Nearchou (2004)
survey addressed the use of new hybrid simulated annealing
algorithm (hybrid SAA) for solving the flow-shop
scheduling problem. Singh et al. (2004)………….
5 Literature 1 40 Joly and Frein (2007) addressed the problem of
survey sequencing a set of vehicles within an industrial
environment considering the assembly shop
objectives, but also the objectives of the paint shop.
Meer (2007) addressed the Simulated Annealing beats
Metropolis in combinatorial optimization for Traveling
Salesman Problem to construct a suitable TSP instance
for which SA outperforms MA when using the well
known 2-Opt local search heuristics. Dimitris et al.
6 Literature 1 8 proposed model. Akella et al (2008) addressed a
survey mathematical programming formulation for this
channel allocation problem with both types of
interference constraints; it also includes decisions on
location of cell towers using simulated annealing
procedure. Rodriguez -Tello et al (2008) addressed an
improved two-stage simulated annealing algorithm for
the minimum linear arrangement problem for graphs.
Marimuthua et al. (2008)..............
6 Literature 4 1 flow time criteria.
survey Vasan and Raju (2009) addressed with the
application of non-traditional optimization techniques,
namely, Simulated Annealing (SA), Simulated
Quenching (SQ) and Real-coded Genetic Algorithms
(RGA) to a case study of Mahi Bajaj Sagar Project,
India, to maximize the annual net benefits subjected to
various irrigation planning constraints for 75%
dependable flow scenario.
3 Problem descriptions
13 Numerical 1 1 ........operation is given ........operation is given in Table 3. The
illustration in Table 5.1. The illustration...........
13 Numerical 1 2 ........problem given in ........problem given in Table 3 is explained….
illustration Table 5.1 is
15 Result 1 2 Table 5.1. The Table 3. The makespan time……..
comparison makespan time……..
15 Results and 1 2 ..........given in the .........given in the Table 3.
discussion Table 5.1.
15 Results and 3 1 Table 6.1 represents Table 6 represents the comparison……..
discussion the comparison……..
19 References 15 1 Vasan, A. and Raju, Vasan, A. and Raju, K.S. (2009) ‘Comparative
K.S. (2008) analysis…….
19 References 17 1 Yokoyama, M. (2001) Yokoyama, M. (2008) ‘Hybrid flow-shop
‘Hybrid flow-shop scheduling……….

For comment [ae9], delete the reference in the reference section.

Chen, G. (2008) ‘A novel heuristic method for obtaining s-boxes’, Chaos, Solitons & Fractals, Vol. 36, No. 4, pp.1028–1036.

For comment [ae12], delete the reference in the reference section.

Erdemir, E.T., Batta, R., Spielman, S., Rogerson, P.A., Blatt, A. and Flanigan, M. (2008) ‘Location coverage models with demand originating from
nodes and paths: application to cellular network design’, European Journal of Operational Research, Vol. 190, No. 3, pp.610–632.

For comment [ae15], delete the reference in the reference section.

Jacob, D., Raben, A., Sarkar, A., Grimm, J. and Simpson, L. (2008) ‘Anatomy-based inverse planning simulated annealing optimization in high
dose-rate prostate brachytherapy: significant dosimetric advantage over other optimization techniques’, International Journal of Radiation
Biology Physics.

For comment [ae18], delete the reference in the reference section.

Li, K., Sivakumar, A.I. and Ganesan, V.K. (2008) ‘Complexities and algorithms for synchronized scheduling of parallel
machine assembly and air transportation in consumer electronics supply chain’, European Journal of Operational Research, Vol.
187, No. 2, pp.442–455.

For comment [ae25], delete the reference in the reference section.

Ntuen, C.A. and Park, E.H. (1995) ‘An experiment in scheduling and planning of non-structured jobs: lessons learned from artificial intelligence and
operational research toolbox’, European Journal of Operational Research, Vol. 84, No. 1, pp.96-115.

For comment [ae27], delete the reference in the reference section.

Ricca, F. and Simeone, B. (2008) ‘Local search algorithms for political districting’, European Journal of Operational Research, Vo. 189, No. 3,

For comment [ae35], delete the reference in the reference section.

Zhang, X., Yuan, X. and Yuan, Y. (2008b) ‘Improved hybrid simulated annealing algorithm for navigation scheduling for the two dams of the three
gorges project’, Computers & Mathematics with Applications.