Industrial Engineering and Management Systems

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지
DOI QR코드

DOI QR Code

Non-Identical Parallel Machine Scheduling with Sequence and Machine Dependent Setup Times Using Meta-Heuristic Algorithms

  • Joo, Cheol-Min (Department of Industrial and Management Engineering, Dongseo University) ;
  • Kim, Byung-Soo (Graduate School of Management of Technology (MOT), Pukyong National University)
  • Received : 2011.08.23
  • Accepted : 2012.02.09
  • Published : 2012.03.01
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers a non-identical parallel machine scheduling problem with sequence and machine dependent setup times. The objective of this problem is to determine the allocation of jobs and the scheduling of each machine to minimize makespan. A mathematical model for optimal solution is derived. An in-depth analysis of the model shows that it is very complicated and difficult to obtain optimal solutions as the problem size becomes large. Therefore, two meta-heuristics, genetic algorithm (GA) and a new population-based evolutionary meta-heuristic called self-evolution algorithm (SEA), are proposed. The performances of the meta-heuristic algorithms are evaluated through compare with optimal solutions using randomly generated several examples.

Keywords

References

  1. Allahverdi, A., Ng, C. T., Cheng, T. C. E., and Kolvalyov, M. Y. (2008), A survey of scheduling problems with setup times and costs, European Journal of Operational Research, 187, 985-1032. https://doi.org/10.1016/j.ejor.2006.06.060
  2. Agarwal, A., Colak, C., Jacob, V., and Pirkul, H., 2006. Heuristics and augmented neural networks for task scheduling with non-identical machines, European Journal of Operational Research, 175(1), 296-317. https://doi.org/10.1016/j.ejor.2005.03.045
  3. Balin, S. (2011), Non-identical parallel machine scheduling using genetic algorithm, Expert Systems with Applications, 38, 6814-6821 https://doi.org/10.1016/j.eswa.2010.12.064
  4. Behnamian, J., Zandieh M., and Ghomi, F. (2009), Parallel-machine scheduling problems with sequencedependent setup times using an ACO, SA and VNS hybrid algorithm, Expert Systems with Applications, 36, 9637-9644. https://doi.org/10.1016/j.eswa.2008.10.007
  5. Cheng, R. and Gen, M. (1997), Parallel Machine Scheduling Problems Using Memetic Algorithms, Computers and Industrial Engineering, 33(3/4), 761-764. https://doi.org/10.1016/S0360-8352(97)00247-7
  6. Garey, M. and Johnson, D. (1997), Computers and intractability: A guide to the theory of NP-completeness, New York: W. H. Freeman.
  7. Gen, M. and Cheng, R. (2000), Genetic Algorithms and Engineering Optimization, New York: Wiley.
  8. Holland, J. H. (1975), Adaptation in natural and artificial systems, Ann Arbor, IL: University of Michigan Press.
  9. Hop, N. V. and Nagarur, N. N. (2004), The scheduling problem of PCBs for multiple non-identical parallel machines, European Journal of Operational Research, 158, 577-594. https://doi.org/10.1016/S0377-2217(03)00376-X
  10. Joo, C. M. (2009), An Improved Ant Colony System for Parallel-Machine Scheduling Problem with Job Release Times and Sequence-dependent Setup Times, Journal of the Korean Institute of Industrial Engineers, 35(4), 218-225.
  11. Mendes, A. S., Muller, F. M., Franca, P. M., and Moscato, P. (2002), Comparing metaheuristic approaches for parallel machine scheduling problems, Production Planning and Control, 13, 143-154. https://doi.org/10.1080/09537280110069649
  12. Nait, T. D., Chu, C., Yalaoui, F., and Amodeo, L. (2003), A new approach for identical parallel machine scheduling with job splitting and sequence-dependent setup times based on linear programming, In International conference on industrial engineering and production management (IEPM'03), 3, 266-274.
  13. Pinedo, M. (1995), Scheduling theory, algorithms, and systems, Prentice-Hall.
  14. Pfund, M., Fowler, J., Gadkari, A., and Chen, Y. (2008), Scheduling jobs on parallel machines with setup times and ready times, Computers and Industrial Engineering, 54, 764-782. https://doi.org/10.1016/j.cie.2007.08.011
  15. Sveltana, A., Kravchenko, S., and Werner, F. (2001), A heuristic algorithm for minimizing mean flow time with unit setups, Information Processing Letters, 79, 291-296. https://doi.org/10.1016/S0020-0190(01)00136-3
  16. Tavakkoli-Moghaddam, R., Taheri, F., Bazzazi, M., Izadi, M., and Sassani, F. (2009), Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints, Computers and Operations Research, 36, 3224-3230. https://doi.org/10.1016/j.cor.2009.02.012
  17. Tahar, D., Yalaoui, F., Chu, C., and Amodeo, L. (2006), A linear programming approach for identical parallel machine scheduling with job splitting and sequence- dependent setup times, International Journal of Production Economics, 99, 63-73. https://doi.org/10.1016/j.ijpe.2004.12.007
  18. Vallada, E. and Ruiz, R. (2011), A genetic algorithm for the unrelated parallel machine scheduling problem with sequence dependent setup times, European Journal of Operational Research, 211, 612-622. https://doi.org/10.1016/j.ejor.2011.01.011
  19. Yalaoui, F. and Chu, C. (2003), An efficient heuristic approach for parallel machine scheduling with job splitting and sequence-dependent setup times, IIE Transactions, 35(2), 183-190. https://doi.org/10.1080/07408170304382

Cited by

  1. Heuristics for Non-Identical Parallel Machine Scheduling with Sequence Dependent Setup Times vol.40, pp.3, 2014, https://doi.org/10.7232/JKIIE.2014.40.3.305
  2. A production scheduling problem with sequence-dependent changeover costs vol.52, pp.13, 2014, https://doi.org/10.1080/00207543.2014.889860
  3. Meta-Heuristic Algorithms for a Multi-Product Dynamic Lot-Sizing Problem with a Freight Container Cost vol.11, pp.3, 2012, https://doi.org/10.7232/iems.2012.11.3.288
  4. Tabu Search Algorithm Based on Lower Bound and Exact Algorithm Solutions for Minimizing the Makespan in Non-Identical Parallel Machines Scheduling vol.2021, pp.None, 2012, https://doi.org/10.1155/2021/1856734