Documente Academic
Documente Profesional
Documente Cultură
DOI 10.1007/s10845-013-0837-8
Received: 28 December 2012 / Accepted: 17 September 2013 / Published online: 5 October 2013
Springer Science+Business Media New York 2013
Abstract This paper focus on artificial intelligence approaches to NP-hard job shop scheduling (JSS) problem. In
the literature successful approaches of artificial intelligence
techniques such as neural network, genetic algorithm, multi
agent systems, simulating annealing, bee colony optimization, ant colony optimization, particle swarm algorithm, etc.
are presented as solution approaches to job shop scheduling
problem. These studies are surveyed and their successes are
listed in this article.
Keywords Artificial intelligence Scheduling
Metaheuristic
Introduction
The scope and the purpose of this paper are to present a survey
of job shop scheduling problems (JSSs) using artificial intelligence (AI) solution techniques which covers the AI strategies for different objective function of job shop scheduling
problem. Numerous approaches have been investigated and
classifications of these techniques are given.
The remainder of the study is as follows: JSS problem is defined in detail in section Job shop scheduling
problem, history and structure of AI mentioned in section Brief history of AI. In section AI strategies for
job shop problem provides a detailed classification according to the survey. In section Analysis and discussions,
B. alis (B) S. Bulkan
Department of Industrial Engineering, Marmara University,
Gztepe Campus, Istanbul, Turkey
e-mail: bcalis@marmara.edu.tr
S. Bulkan
e-mail: sbulkan@marmara.edu.tr
123
962
Brief history of AI
The field of artificial intelligence (AI) research was founded
at a conference on the campus of Dartmouth College in the
summer of 1956 (Crevier 1993) and AI is the generic name
given to the field of computer science dedicated to the development of programs that attempt to replicate human intelligence (Fonseca and Navaresse 2002). If too many tasks are
allocated to the system, the human does not have opportunities to build up a mental model of the system. As a result,
exceptions which the system is not able to handle cannot
be solved by the human either (Wiers 1997). So AI can
be described as the study and design of intelligent agents
(Russell and Norvig 2003).
By the use of AI techniques, researchers were able to
develop clever methods to solve NP hard problems such as
JSS. Solution quality obtained by AI techniques is much better than Branch-and-Bound based heuristic solutions for JSS
and solution time is much shorter.
Some early milestones include work in problems solving
which included basic work in learning, knowledge representation, and inference as well as demonstration programs in
language understanding, translation, theorem proving, associative memory, and knowledge-based systems (Buchanan
2005).
The artificial intelligence (AI) research community has
been very active in the area of planning and scheduling since
the 1960s (Spyropoulos 2000) and early history of AI is summarized by Russell and Norvig (2003) as; (1) McCulloch and
Pitts: Boolean circuit model of brain (1943). (2) Turings
Computing Machinery and Intelligence (1950). (3) Look,
Ma, no hands! (19521969). (4) Early AI programs, including Samuels checkers program, Newell and Simons Logic
Theorist, Gelernters Geometry Engine (1950s). (5)Dartmouth meeting: Artificial Intelligence adopted (1956). (6)
Robinsons complete algorithm for logical reasoning (1965).
(7) AI discovers computational complexity. Neural network
research almost disappears (19661974). (8) Early development of knowledge-based systems (19691979). (9) Expert
systems industry booms (19801988). (10) Expert systems
industry busts: AI Winter (19881993). (11) Neural networks return to popularity (19851995). (12) Resurgence of
probabilistic and decision-theoretic method Rapid increase
in technical depth of mainstream AI Nouvelle AI: ALife,
GAs, soft computing (1988).
After this time period, Meta heuristic techniques are used
to find near optimal solution for scheduling problems.
Symbol
Interpretation
Maximum
complete time
Cmax
Mean complete
time
Maximum flow
time
Mean flow time
Fmax
Maximum
lateness
Mean lateness
L max
Maximum
tardiness
Tmax
Mean tardiness
Number of tardy
jobs
Maximum
earliness
Uj
E max
123
963
Explanation of study
Algorithm/
industry
Article
Mean flowtime
Algorithm
Bierwirth and
Mattfeld (1999)
Algorithm
Algorithm
Chryssolouris and
Subramaniam
(2001)
Algorithm
Kacem et al.
(2002)
Algorithm
Ombuki and
Ventresca (2004)
Algorithm
Mattfeld and
Bierwirth (2004)
Algorithm
Watanabe et al.
(2005)
Algorithm
Gonalves et al.
(2005)
Algorithm
Algorithm
Algorithm
Pezzella et al.
(2008)
Industry
Makespan
Makespan
Makespan
Mean job tardiness, mean
flowtime, maximum
tardiness, mimization of the
weighted number of tardy
jobs
Makespan
Makespan
Makespan
Makespan
123
964
Table 2 continued
Objective
function
Explanation of study
Algorithm/
industry
Article
Total lateness
Algorithm
Wong et al.
(2009)
Algorithm
Zhou et al.
(2009)
Algorithm
Industry
Chan et al.
(2011)
Algorithm
Rebai et al.
(2012)
Algorithm
Qing-dao-er-ji
and Wang
(2012)
Algorithm
Lei (2012b)
Algorithm
Lei (2012a)
Industry
Huang et al.
(2012)
Algorithm
Chen et al.
(2012)
Tardiness
Average transfer
time Fw
Makespan
Earliness and
Tardiness
Makespan
Makespan
Fuzzy makespan
Makespan
Total tardiness,
total machine
idle time, and
makespan
Morton (1988) and Scheduling (1995) provide detail explanation of Beam Search method. One application of beam
search is solving JSS problem is given in Table 3.
123
965
Explanation of study
Algorithm/
industry
Article
Makespan and
mean tardiness
The beam search method is a very good heuristic for the job shop problems. As
compared to other algorithms, the speed and the performance of a beam search
based algorithm are manipulated by changing search parameters and evaluation
functions. Coding of the algorithm is very simple and hence it can easily be
implemented by practitioners
Algorithm
Sabuncuoglu and
Bayiz (1999)
Explanation of study
Algorithm/
industry
Article
Makespan
Several results for the multiprocessor job-shop scheduling (MSJ) problem have been
presented in this paper. Computational experiments were conducted on three different
sets of test problems. Authors state that this integrated procedure seems to be superior
to prior heuristics for the MJS problem, and has quite satisfying results on classical
job-shop scheduling problems as well
An effective two-phase tabu search algorithm is proposed for flexible job shop
scheduling with sequence dependent setups. Computational results show that the
proposed algorithm generates good quality solutions, comparable to the branch and
bound method, very quickly. As a result it is concluded that the proposed algorithm
can attain the optimal solution for a flexible job shop scheduling problem with
sequence dependent setups in very little time
Algorithm
Peres and
Paulli (1997)
Algorithm
Mehrabad and
Fattahi (2007)
Makespan
Explanation of study
Algorithm/
industry
Article
Flowtime and
tardiness
Algorithm
Pendharkar
(1999)
Mean
tardiness
The system is composed of the agent and the simulated environment (SE).
The agent is able to perform dynamic scheduling based on the available
information provided by the SE. It makes decision for selection of the most
appropriate dispatching rule in real time. At the end of training, the agent
gives better results than the traditional alternatives (SPT, COVERT, and CR
rules)
A parallel implementation of modular simulated annealing algorithm (MSA)
is presented. In order to run the parallel MSA, multi agent systems is used.
The empirical results show that the method is quite successful comparing to
the sequential version of MSA
An experimental approach for performance analysis of a multi-agent system
for job routing in job-shop settings. Some simple but practical mechanisms
are proposed and implemented
Neural reinforcement learning method is used and the empirical evaluation on
large-scale benchmark problems leads to the conclusion that problems of
current standards of difficulty can very well be effectively solved by the
learning method. A disadvantage of this reactive scheduling approach is the
fact that only non-delay schedules can be produced, which in many cases
prohibits finding optimal schedules
The simulation results show that the principle of the algorithms is simple,
their computational quantity is small, and the algorithms can be applied to
multi-batch dynamic scheduling with unpredictable entry time due to their
favorable potential. It is suitable for multi-objective scheduling problems
that need to consider average delay time and delivery cut-off time. The
scheduling results of wasp colony algorithms are better than those of static
scheduling algorithms for divided scheduling batch by batch
Algorithm
Aydn and
Oztemel (2000)
Algorithm
Aydn and
Fogarty (2004)
Algorithm
Usher (2003)
Algorithm
Gabel and
Riedmiller
(2007)
Algorithm
Makespan
Number of
tardy job
Total
tardiness
Makespan
123
966
Explanation of study
Algorithm/
industry
Article
Total weighted
tardiness
Algorithm
Makespan
Algorithm
Algorithm
Heinonen and
Pettersson
(2007)
Algorithm
Algorithm
Surekha and
Sumathi (2010)
In the small problems, this study used LINGO to obtain the optimal solution and
confirm the efficiency of ACO. The effectiveness exceeds 88 %. For production
managers, these approximate optimal solutions can provide enterprises with
satisfactory production schedules in a short time
Knowledge based ant colony optimization (KBACO) outperforms these eight
published algorithms; 1. Temporal Decomposition, 2. Controlled Genetic
Algorithm (CGA), 3. Approach by Localization (AL), 4. AL+CGA, 5.
PSO+SA, 6. Tabu Search, 7. GENACE, 8. KBACO
Algorithm
Huang (2010)
Algorithm
Makespan
Makespan
Makespan
Sum of material
processing cost,
setup time cost and
inventory cost
Makespan
123
967
Explanation of study
Algorithm/
industry
Article
Average lateness
The results obtained by the neural network are better than these obtained either
from the fuzzy inference system or from SIPAPLUS. The approach based on an
implicit learning from several typical examples gives better results and its
performance increases as the number of examples learned by the neural
network increases
A modified BEP (back-error propagation) structure is suggested as it is able to
deal with much larger and more complex problems than any previous method
Algorithm
Geneste and
Grabot (1997)
Algorithm
This work largely focuses on the problem of resource utilization, For practical
implementation, the problem can be extended to involve the temporal
relationship on required resources for each job and model is not suitable for
large size problems
An industrial problem is expressed by a nonlinear integer programming model
and solved successfully by NN
Algorithm
Industry
Algorithm
Sabuncuoglu and
Touhami
(2002)
Algorithm
Fonseca and
Navaresse
(2002)
Industry
Algorithm
Algorithm
Weckman et al.
(2008)
Makespan
Makespan
Productivity,
inventory level,
tardiness,
flexibility and
stability
Makespan
Explanation of study
Algorithm/
industry
Article
Makespan
Algorithm
Algorithm
Ge et al. (2007)
Algorithm
Zhang et al.
(2009)
Algorithm
Algorithm
Varthanan et al.
(2012)
Makespan
Makespan, maximal
machine workload
and total workload
of machines
Makespan
Total cost
123
968
Explanation of study
Algorithm/
industry
Article
Makespan
Algorithm
Roshanaei et al.
(2009)
Algorithm
Zandieh and
Adibi (2010)
The results demonstrated that the proposed method is better than other
algorithms in the past research
Algorithm
Yazdani et al.
(2010)
Objective
function
Explanation of study
Algorithm/
industry
Article
Fuzzy makespan
Algorithm
Sakawa and
Kubota (2000)
Algorithm
Canbolat and
Gundogar
(2004)
Algorithm
Bilkay et al.
(2004)
Algorithm
Lei (2012a)
Fuzzy makespan
123
969
Explanation of study
Algorithm/
industry
Article
Machine
utilization and
product
cycle-time
This paper describes a novel approach that uses the honey bees foraging model.
Comparing the performance of peers, bee algorithm performs slightly better than
ant algorithm. Bee algorithm achieves better mean and maximum percentages as
well as higher number of best solutions in comparison to ant algorithm. The time
taken to solve the 82 job shop problems for both heuristics is approximately equal
with bee colony being slightly faster
This study was the first research on the application of artificial bee colony (ABC)
algorithm to the FJSP with makespan criterion. ABC performs better than other
algorithms on Kacem instances (Kacem and Hammadi 2002) and BRdata problems
(Brandimarte 1993) in solving almost all the instances in terms of the best results,
average results, and standard derivation
An artificial bee colony (ABC) algorithm based on criticality information for solving
job shop scheduling problems is proposed. ABC obtains better result than PSO
(particle swarm optimization) for nine instances
The computational results verify the effectiveness and efficiency of the proposed
approach, especially for larger-scale instances
Algorithm
Chong et al.
(2006)
Algorithm
Wang et al.
(2012)
Makespan
Total weighted
tardiness
Total weighted
tardiness
Algorithm
Algorithm
Zhang (2011)
Zhang et al.
(2013)
123
970
Conclusions
Job shop scheduling problems are difficult problems to be
solved due to their NP-Hard nature. Researchers and practitioners try to develop efficient solutions for these problems
during the last couple of decades. With the recent advance-
123
ment in computing techniques, artificial intelligence techniques becomes a powerful solution approaches to many
combinatorial optimization problems including JSS.
In this survey, a range of AI based solution methods are
surveyed. Since these methods are not optimization methods, none of the AI techniques guarantees the optimal solution. However, based on solution approaches as mentioned
in section Analysis and discussions, the efficiency of AI
techniques to some problems is identified.
Surveyed articles show that most of the works are focused
on testing the develop algorithm on benchmark or generated
problems.
References
Akyol, D. E., & Bayhan, G. M. (2007). A review on evolution of production scheduling with neural networks. Computers and Industrial
Engineering, 53, 95122.
Asadzadeh, L., & Zamanifar, K. (2010). An agent-based parallel
approach for the job shop scheduling problem with genetic algorithms. Mathematical and Computer Modelling, 52, 19571965.
Aydn, M. E., & Oztemel, E. (2000). Dynamic job-shop scheduling
using reinforcement learning agents. Robotics and Autonomous Systems, 33, 169178.
Aydn, E., & Fogarty, T. C. (2004). A simulated annealing algorithm
for multi-agent systems: A job shop scheduling application. Journal
of Intelligent Manufacturing, 15, 805814.
Bierwirth, C., & Mattfeld, D. C. (1999). Production scheduling and
rescheduling with genetic algorithms. Evolutionary Computation,
7(1), 117.
Bilkay, O., Anlagan, O., & Kilic, S. (2004). Job shop scheduling using
fuzzy logic. International Journal of Advanced Manufacturing Technology, 23(78), 606619.
Brandimarte, P. (1993). Routing and scheduling in a flexible job shop
by tabu search. Annals of Operations Research, 41(3), 157183.
Buchanan, G. G. (2005). A (very) brief history of artificial intelligence.
In 25th Anniversary Issue, AI Magazine winter (pp. 5360).
Canbolat, Y. B., & Gundogar, E. (2004). Fuzzy priority rule for job shop
scheduling. Journal of Intelligent Manufacturing, 15, 527533.
Cao, Y., Yang, Y., Wang, H., & Yang, L. (2009). Intelligent job shop
scheduling based on MAS and integrated routing wasp algorithm
and scheduling wasp algorithm. Journal of Software, 4(5), 487494.
Cha, Y., & Jung, M. (2003). Satisfaction assessment of multi-objective
schedules using neural fuzzy methodology. International Journal of
Production Research, 41(8), 18311849.
Chambers, L. (2001). Practical handbook of genetic algorithms: Applications (Vol. I). Boca Raton, Florida: CRC Press.
Chan, F. T. S., Chung, S. H., & Chan, P. L. Y. (2005). An adaptive
genetic algorithm with dominated genes for distributed scheduling
problems. Expert Systems with Applications, 29, 364371.
Chan, F. T. S., Wong, T. C., & Chan, L. Y. (2008). Lot streaming for
product assembly in job shop environment. Robotics and ComputerIntegrated Manufacturing, 24, 321331.
Chan, F. T. S., Wong, T. C., & Chan, L. Y. (2009). The application of
genetic algorithms to lot streaming in a job-shop scheduling problem.
International Journal of Production Research, 47(12), 33873412.
Chan, F. T. S., Choy, K. L., & Bibhushan, (2011). A genetic algorithmbased scheduler for multiproduct parallel machine sheet metal job
shop. Expert Systems with Applications, 38(7), 87038715.
Chen, M., & Dong, Y. (1999). Applications of neural networks to solving SMT scheduling problemsA case study. International Journal
of Production Research, 37(17), 40074020.
971
Hansen, P., & Mladenovic, N., Perez, J. A. M. (2008). Variable neighbourhood search: methods and applications. Annals of Operations
Research 6, 319360.
Heinonen, J., & Pettersson, F. (2007). Hybrid ant colony optimization and visibility studies applied to a job-shop scheduling problem.
Applied Mathematics and Computation, 187, 989998.
Holland, J. H. (1975). Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor: Michigan; re-issued by MIT
Press, (1992).
Holland, J. H., & Miller, J. H. (1991). Artificial adaptive agents in
economic theory. American Economic Review, 81(2), 365371.
Huang, Y. M., & Chen, R. M. (1999). Scheduling multiprocessor job
with resource and timing constraints using neural networks. IEEE
Transactions on Systems, Man and Cybernetics-Part B: Cybernetics,
29(4), 490502.
Huang, K. L., & Liao, C. J. (2008). Ant colony optimization combined
with taboo search for the job shop scheduling problem. Computers
and Operations Research, 35, 10301046.
Huang, R. H. (2010). Multi-objective job-shop scheduling with lotsplitting production. International Journal of Production Economics,
124, 206213.
Huang, J., Ser, G. A., & Urs, S. B. R. (2012). Genetic algorithm for
rotary machine scheduling with dependent processing times. Journal
of Intelligent Manufacturing, 23, 19311948.
Jain, A. S., & Meeran, S. (1998). Job shop scheduling using neural networks. International Journal of Production Research, 36(5), 1249
1272.
Kacem. I, & Hammadi, S., (2002b). Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling
problems. IEEE Transactons On Systems, Man, And Cybernetcs
Part C: Applcatons And Revews, 32(1), 113.
Kacem, I., Hammadi, S., & Borne, P. (2002a). Pareto-optimality
approach for flexible job-shop scheduling problems: Hybridization
of evolutionary algorithms and fuzzy logic. Mathematics and Computers in Simulation, 60(35), 245276.
Karaboga, D. (2005). An idea based on honey bee swarm for numerical
optimization. Technical Report TR06, Erciyes University, Engineering Faculty, Computer Engineering Department.
Kennedy, J., & Eberhart, R. (1995). Particle swarm optimization. Proceedings of IEEE International Conference on Neural Networks, 4,
19421948.
Kirkpatrick, S., Gelatt, C. D., & Vecchi, M. P. (1983). Optimization by
simulated annealing. Science, 220, 671680.
Kreipl, S. (2000). A large step random walk for minimizing total
weighted tardiness in a job shop. Journal of Scheduling, 3, 125138.
Lei, D. (2012a). Co-evolutionary genetic algorithm for fuzzy flexible
job shop scheduling. Applied Soft Computing, 12, 22372245.
Lei, D. (2012b). Minimizing makespan for scheduling stochastic job
shop with random breakdown. Applied Mathematics and Computation, 218, 1185111858.
Lenstra, J. K., Kan, A. H. G. R., & Brucker, P. (1977). Complexity of
machine scheduling problems. Annals of Discrete Mathematics, 1,
343362.
Lian, Z. G., Jiao, B., & Gu, X. S. (2006). A similar particle swarm
optimization for job-shop scheduling to minimize makespan. Applied
Mathematics and Computation, 183, 10081017.
Liepins, G. E. & Hilliard, M. R. (1987). Greedy genetics. In Proceedings
of the 2nd international conference on genetic algorithms (pp. 90
99).
Lin, T.-L., Horng, S.-J., Kao, T.-W., Chen, Y.-H., Run, R.-S., Chen, R.J., et al. (2010). An efficient job-shop scheduling algorithm based on
particle swarm optimization. Expert Systems with Applications, 37,
26292636.
Liu, M., Sun, Z. J., Yan, J. W., & Kang, J. S. (2011). An adaptive
annealing genetic algorithm for the job-shop planning and scheduling problem. Expert Systems with Applications, 38(8), 92489255.
123
972
Lowerre, B. T., (1976). The HARPY speech recognition system. Ph.D.
thesis, Carnegie Mellon University, Pittsburgh, PA.
Mattfeld, D. C., & Bierwirth, C. (2004). An efficient genetic algorithm
for job shop scheduling with tardiness objectives. European Journal
of Operational Research, 155(3), 616630.
Mehrabad, M. S., & Fattahi, P. (2007). Flexible job shop scheduling
with tabu search algorithms. The International Journal of Advanced
Manufacturing Technology, 32, 563570.
Mladenovic, N., & Hansen, P. (1997). Variable neighborhood search.
Computers and Operations Research, 24(11), 10971100.
Nait Tahar, D., Yalaoui, F., Amodeo, L., & Chu, C. (2005). An ant colony
system minimizing total tardiness for hybrid job shop scheduling
problem with sequence dependent setup times and release dates.
In International Conference on Industrial Engineering and Systems
Management, (No. 10).
Nakano, R. & Yamada, T. (1991). Conventional genetic algorithms for
job shop problems. In Proceedings of the 4th international conference on genetic algorithms (pp. 474479).
Ombuki, B. M., & Ventresca, M. (2004). Local search genetic algorithms for the job shop scheduling problem. Applied Intelligence,
21, 99109.
Ow, P. S., & Morton, T. E. (1988). Filtered beam search in scheduling.
International Journal of Production Research, 26, 297307.
Pendharkar, P. C. (1999). A computational study on design and performance issues of multi-agent intelligent systems for dynamic scheduling environments. Expert Systems with Applications, 16(2), 121
133.
Peres, S. D., & Paulli, J. (1997). An integrated approach for modeling
and solving the general multiprocessor job-shopscheduling problem
using tabu search. Annals of Operations Research, 70, 281306.
Pezzella, F., Morganti, G., & Ciaschetti, G. (2008). A genetic algorithm for the flexible job-shop scheduling problem. Computers and
Operations Research, 35, 32023212.
Pham, D. T., Ghanbarzadeh, A., Koc, E., Otri, S., Rahim, S., & Zaidi, M.
(2005). The Bees Algorithm. Technical Note: Manufacturing Engineering Centre, Cardiff University, UK.
Qing-dao-er-ji, R., & Wang, Y. (2012). A new hybrid genetic algorithm for job shop scheduling problem. Computers and Operations
Research, 39, 22912299.
Rebai, M., Kacem, I., & Adjallah, K. H. (2012). Earliness-tardiness
minimization on a single machine to schedule preventive maintenance tasks: Metaheuristic and exact methods. Journal of Intelligent
Manufacturing, 23, 12071224.
Roshanaei, V., Naderi, B., Jolai, F., & Khalili, M. (2009). A variable
neighborhood search for job shop scheduling with set-up times to
minimize makespan. Future Generation Computer Systems, 25, 654
661.
Ross, E. H. P., & Corne, D. (2005). Evolutionary scheduling: A review.
Genetic Programming and Evolvable Machines, 6, 191220.
Rossi, A., & Dini, G. (2007). Flexible job-shop scheduling with routing flexibility and separable setup times using ant colony optimization method. Robotics and Computer-Integrated Manufacturing, 23,
503516.
Russell, Stuart J., & Norvig, Peter. (2003). Artificial intelligence: A
modern approach (2nd ed.). Upper Saddle River, New Jersey: Prentice Hall.
Sabuncuoglu, I., & Gurgun, B. (1996). A neural network model for
scheduling problems. European Journal of Operational Research,
93(2), 288299.
Sabuncuoglu, I., & Bayiz, M. (1999). Job shop scheduling with beam
search. European Journal of Operational Research, 118(2), 390
412.
Sabuncuoglu, I., & Touhami, S. (2002). Simulation metamodelling with
neural networks: An experimental investigation. International Journal of Production Research, 40(11), 24832505.
123
973
Zhang, R., Song, S., & Wu, C. (2013). A hybrid artificial bee colony
algorithm for the job shop scheduling problem. International Journal
of Production Economics, 141, 167178.
Zhou, H., Cheung, W., & Leung, L. C. (2009). Minimizing weighted
tardiness of job-shop scheduling using a hybrid genetic algorithm
European Journal of Operational Research. Vol., 194, 637649.
Zurada, J. M. (1992). Introduction to Artificial Neural Systems. New
York: West Publishing Company.
123