메뉴 건너뛰기




Volumn 5, Issue 12, 2006, Pages 2819-2824

A comparison between ant colony and tabu search algorithms for job shop scheduling with sequence-dependent setups

Author keywords

Ant colony optimization; Scheduling; Single machine; Tabu search; Weighted earliness tardiness

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; OPTIMIZATION;

EID: 37849187790     PISSN: 11092777     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article
Times cited : (8)

References (23)
  • 1
    • 0033114757 scopus 로고    scopus 로고
    • A Review of Scheduling Research Involving Setup Considerations
    • Allahverdi, A., Gupta J.N.D., Aldowaisan T.A. A Review of Scheduling Research Involving Setup Considerations, Omega, Vol. 27, 1999, pp. 219-39.
    • (1999) Omega , vol.27 , pp. 219-239
    • Allahverdi, A.1    Gupta, J.N.D.2    Aldowaisan, T.A.3
  • 2
  • 3
    • 0029260612 scopus 로고
    • A Survey of US Manufacturing Practices in Make-to-order Machine Shops
    • Wisner, J.D., Siferd, S.P. A Survey of US Manufacturing Practices in Make-to-order Machine Shops, Production and Inventory Management Journal, Vol. 1, 1995, pp. 1-7.
    • (1995) Production and Inventory Management Journal , vol.1 , pp. 1-7
    • Wisner, J.D.1    Siferd, S.P.2
  • 4
    • 0030735290 scopus 로고    scopus 로고
    • A Heuristic to Minimize the Total Weighted Tardiness with Sequence Dependent Setups
    • Lee, Y.H., Bhaskaram, K., Pinedo, M. A Heuristic to Minimize the Total Weighted Tardiness with Sequence Dependent Setups, IIE Transactions, Vol. 29, 1997, pp. 45-52.
    • (1997) IIE Transactions , vol.29 , pp. 45-52
    • Lee, Y.H.1    Bhaskaram, K.2    Pinedo, M.3
  • 5
    • 18744404723 scopus 로고    scopus 로고
    • Weighted Tardiness Scheduling with Sequence-dependent Setups: A Benchmark Library
    • Technical Report, Intelligent Coordination and Logistics Laboratory, Robotics Institute, Carnegie Mellon University, USA
    • Cicirello VA. Weighted Tardiness Scheduling with Sequence-dependent Setups: a Benchmark Library. Technical Report, Intelligent Coordination and Logistics Laboratory, Robotics Institute, Carnegie Mellon University, USA, 2003.
    • (2003)
    • Cicirello, V.A.1
  • 6
    • 37949024325 scopus 로고    scopus 로고
    • http://www.iwr.uniheidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html.
  • 8
    • 33644772056 scopus 로고    scopus 로고
    • Genetic Algorithms for the Optimal Common Due Date Assignment and the Optimal Scheduling Policy in Parallel Machine Earliness/tardiness Scheduling Problems
    • Min, L., Cheng, W. Genetic Algorithms for the Optimal Common Due Date Assignment and the Optimal Scheduling Policy in Parallel Machine Earliness/tardiness Scheduling Problems, Robotics and Computer-Integrated Manufacturing, Vol. 22, No. 4, 2006, pp. 279-287.
    • (2006) Robotics and Computer-Integrated Manufacturing , vol.22 , Issue.4 , pp. 279-287
    • Min, L.1    Cheng, W.2
  • 9
    • 0037120685 scopus 로고    scopus 로고
    • Tabu Search for Single Machine Scheduling with Distinct Due Windows and Weighted Earliness/Tardiness Penalties
    • Wan, G., and Yen, B.P.-C., Tabu Search for Single Machine Scheduling with Distinct Due Windows and Weighted Earliness/Tardiness Penalties, European Journal of Operational Research, Vol. 142, Issue 2, 2002, pp. 271-281.
    • (2002) European Journal of Operational Research , vol.142 , Issue.2 , pp. 271-281
    • Wan, G.1    Yen, B.P.-C.2
  • 10
    • 37949014231 scopus 로고    scopus 로고
    • An Ant Colony Optimization for Single-machine Tardiness Scheduling with Sequence-dependent Setups
    • August
    • Liao, C., Juan, H. An Ant Colony Optimization for Single-machine Tardiness Scheduling with Sequence-dependent Setups, Computers and Operations Research, August 2005.
    • (2005) Computers and Operations Research
    • Liao, C.1    Juan, H.2
  • 11
    • 0000411214 scopus 로고
    • Tabu Search - Part I, ORSA
    • Glover, F., Tabu Search - Part I, ORSA Journal of computing, Vol. 3, 1989, pp. 190-206.
    • (1989) Journal of Computing , vol.3 , pp. 190-206
    • Glover, F.1
  • 14
    • 0031122887 scopus 로고    scopus 로고
    • Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem
    • Dorigo, M., and Gambardella, L. M., Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem, IEEE Transactions on Evolutionary Computation, Vol. 1, No.1, 1997, pp. 53-66.
    • (1997) IEEE Transactions on Evolutionary Computation , vol.1 , Issue.1 , pp. 53-66
    • Dorigo, M.1    Gambardella, L.M.2
  • 15
    • 9344232811 scopus 로고    scopus 로고
    • Ant Colony Optimization Technique for Vehicle Routing Problem
    • Bell, J.E., and McMullen P.R., Ant Colony Optimization Technique for Vehicle Routing Problem, Advanced Engineering Informatics, Vol. 18, 2004, pp. 41-48.
    • (2004) Advanced Engineering Informatics , vol.18 , pp. 41-48
    • Bell, J.E.1    McMullen, P.R.2
  • 17
    • 9644302529 scopus 로고    scopus 로고
    • Earliness - Tardiness Scheduling with Setup Considerations
    • Sourd, F. Earliness - tardiness Scheduling with Setup Considerations, Computers & Operations Research, Vol. 32, No. 7, 2005, pp. 1849-1865.
    • (2005) Computers & Operations Research , vol.32 , Issue.7 , pp. 1849-1865
    • Sourd, F.1
  • 18
    • 33644683640 scopus 로고    scopus 로고
    • Minimizing the Earliness - Tardiness Costs on a Single Machine
    • Bauman, J., Józefowska, J. Minimizing the Earliness - tardiness Costs on a Single Machine, Computers & Operations Research, Vol. 33, No. 11, 2006, pp. 3219-3230.
    • (2006) Computers & Operations Research , vol.33 , Issue.11 , pp. 3219-3230
    • Bauman, J.1    Józefowska, J.2
  • 19
    • 33344464311 scopus 로고    scopus 로고
    • A Branch-and-bound Algorithm for a Single Machine Sequencing to Minimize the Sum of Maximum Earliness and Tardiness with Idle Insert
    • Tavakkoli-Moghaddam, R., Moslehi, G., Vasei M., Azaron, A. A Branch-and-bound Algorithm for a Single Machine Sequencing to Minimize the Sum of Maximum Earliness and Tardiness with Idle Insert, Applied Mathematics and Computation, Vol. 174, No. 1, 2006, pp. 388-408.
    • (2006) Applied Mathematics and Computation , vol.174 , Issue.1 , pp. 388-408
    • Tavakkoli-Moghaddam, R.1    Moslehi, G.2    Vasei, M.3    Azaron, A.4
  • 20
    • 4744370447 scopus 로고    scopus 로고
    • Improved Heuristics for the Early/tardy Scheduling Problem with No Idle Time
    • Valente, J.M.S., Alves, R.A.F.S. Improved Heuristics for the Early/tardy Scheduling Problem with No Idle Time, Computers & Operations Research, Vol. 32, No. 3, 2005, pp. 557-569.
    • (2005) Computers & Operations Research , vol.32 , Issue.3 , pp. 557-569
    • Valente, J.M.S.1    Alves, R.A.F.S.2
  • 21
    • 3943054030 scopus 로고    scopus 로고
    • Minimizing Earliness and Tardiness Penalties in a Single-Machine Problem with a Common Due Date
    • Hino, C.M., Ronconi, D.P., Mendes, A.B. Minimizing Earliness and Tardiness Penalties in a Single-Machine Problem with a Common Due Date, European Journal of Operational Research, Vol. 160, No. 1, 2005, pp. 190-201.
    • (2005) European Journal of Operational Research , vol.160 , Issue.1 , pp. 190-201
    • Hino, C.M.1    Ronconi, D.P.2    Mendes, A.B.3
  • 22
    • 77957077792 scopus 로고    scopus 로고
    • A 'Pseudo polynomial' Algorithm for Sequencing Jobs to Minimize Total Tardiness
    • Lawler, E.L. A 'Pseudo polynomial' Algorithm for Sequencing Jobs to Minimize Total Tardiness, Annals of Discrete Mathematics, Vol. 1, 1997, pp. 331-42.
    • (1997) Annals of Discrete Mathematics , vol.1 , pp. 331-342
    • Lawler, E.L.1
  • 23
    • 33747766877 scopus 로고    scopus 로고
    • Ant Colony System for JSP
    • Springer-Verlag
    • Boryczka, U., Ant Colony System for JSP, ACRI 2004, Springer-Verlag, 2004, pp. 296-305.
    • (2004) ACRI 2004 , pp. 296-305
    • Boryczka, U.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.