메뉴 건너뛰기




Volumn 67, Issue 1, 2014, Pages 10-19

Application of graph search and genetic algorithms for the single machine scheduling problem with sequence-dependent setup times and quadratic penalty function of completion times

Author keywords

Genetic algorithm; Graph search; Quadratic penalty; Sequence dependent setup; Single machine scheduling

Indexed keywords

GRAPH SEARCH; GRAPH SEARCH ALGORITHM; QUADRATIC PENALTY; QUADRATIC PENALTY FUNCTION; SEQUENCE DEPENDENT SETUPS; SEQUENCE-DEPENDENT SETUP TIME; SINGLE MACHINE SCHEDULING PROBLEMS; SINGLE-MACHINE SCHEDULING;

EID: 84888352558     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cie.2013.10.005     Document Type: Article
Times cited : (14)

References (54)
  • 1
    • 67349193270 scopus 로고    scopus 로고
    • Criteria selection and analysis for single machine dynamic on-line scheduling with multiple objectives and sequence-dependent setups
    • A.T.H. Ang, A.I. Sivakumar, and C. Qi Criteria selection and analysis for single machine dynamic on-line scheduling with multiple objectives and sequence-dependent setups Computers & Industrial Engineering 56 4 2009 1223 1231
    • (2009) Computers & Industrial Engineering , vol.56 , Issue.4 , pp. 1223-1231
    • Ang, A.T.H.1    Sivakumar, A.I.2    Qi, C.3
  • 2
    • 52049112160 scopus 로고    scopus 로고
    • A new discrete particle swarm optimization for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times
    • D. Anghinolfi, and M. Paolucci A new discrete particle swarm optimization for the single-machine total weighted tardiness scheduling problem with sequence-dependent setup times European Journal of Operational Research 193 1 2009 73 85
    • (2009) European Journal of Operational Research , vol.193 , Issue.1 , pp. 73-85
    • Anghinolfi, D.1    Paolucci, M.2
  • 3
    • 0023440150 scopus 로고
    • Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date
    • U. Bagchi, Y.-L. Chang, and R.S. Sullivan Minimizing absolute and squared deviations of completion times with different earliness and tardiness penalties and a common due date Naval Research Logistics 34 5 1987 739 751 (Pubitemid 17651770)
    • (1987) Naval Research Logistics , vol.34 , Issue.5 , pp. 739-751
    • Bagchi Uttarayan1    Chang Yih-Long2    Sullivan Robert, S.3
  • 4
    • 0001723283 scopus 로고
    • Minimizing mean squared deviation of completion times about a common due date
    • U. Bagchi, R.S. Sullivan, and Y.-L. Chang Minimizing mean squared deviation of completion times about a common due date Management Science 33 7 1987 894 906
    • (1987) Management Science , vol.33 , Issue.7 , pp. 894-906
    • Bagchi, U.1    Sullivan, R.S.2    Chang, Y.-L.3
  • 5
    • 0005463643 scopus 로고
    • A node elimination procedure for Townsend's algorithm for solving the single machine quadratic penalty function scheduling problem
    • P.C. Bagga, and K.R. Kalra A node elimination procedure for Townsend's algorithm for solving the single machine quadratic penalty function scheduling problem Management Science 26 6 1980 633 636
    • (1980) Management Science , vol.26 , Issue.6 , pp. 633-636
    • Bagga, P.C.1    Kalra, K.R.2
  • 6
    • 43849098003 scopus 로고    scopus 로고
    • Single-machine scheduling against due dates with past-sequence-dependent setup times
    • D. Biskup, and J. Herrmann Single-machine scheduling against due dates with past-sequence-dependent setup times European Journal of Operational Research 191 2 2008 587 592
    • (2008) European Journal of Operational Research , vol.191 , Issue.2 , pp. 587-592
    • Biskup, D.1    Herrmann, J.2
  • 7
    • 33745846840 scopus 로고    scopus 로고
    • A case-injected genetic algorithm for single machine scheduling problems with release time
    • DOI 10.1016/j.ijpe.2005.11.003, PII S0925527306000314
    • P.-C. Chang, J.-C. Hsieh, and C.-H. Liu A case-injected genetic algorithm for single machine scheduling problems with release time International Journal of Production Economics 103 2 2006 551 564 (Pubitemid 44038489)
    • (2006) International Journal of Production Economics , vol.103 , Issue.2 , pp. 551-564
    • Chang, P.-C.1    Hsieh, J.-C.2    Liu, C.-H.3
  • 8
    • 0035565786 scopus 로고    scopus 로고
    • Using Genetic Algorithms and Heuristics for Job Shop Scheduling with Sequence-Dependent Setup Times
    • DOI 10.1023/A:1014990729837
    • W. Cheung, and H. Zhou Using genetic algorithms and heuristics for job shop scheduling with sequence-dependent setup times Annals of Operations Research 107 1 2001 65 81 (Pubitemid 33634450)
    • (2001) Annals of Operations Research , vol.107 , Issue.1-4 , pp. 65-81
    • Cheung, W.1    Zhou, H.2
  • 9
    • 0036533228 scopus 로고    scopus 로고
    • A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent setups
    • DOI 10.1016/S0360-8352(02)00002-5, PII S0360835202000025
    • I.-C. Choi, and D.-S. Choi A local search algorithm for jobshop scheduling problems with alternative operations and sequence-dependent set-ups Computers & Industrial Engineering 42 1 2002 43 58 (Pubitemid 34182034)
    • (2002) Computers and Industrial Engineering , vol.42 , Issue.1 , pp. 43-58
    • Choi, I.-C.1    Choi, D.-S.2
  • 10
    • 0037394108 scopus 로고    scopus 로고
    • A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
    • DOI 10.1016/S0305-0548(02)00050-3, PII S0305054802000503
    • I.-C. Choi, S.-I. Kim, and H.-S. Kim A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem Computers & Operations Research 30 5 2003 773 786 (Pubitemid 36175283)
    • (2003) Computers and Operations Research , vol.30 , Issue.5 , pp. 773-786
    • Choi, I.-C.1    Kim, S.-I.2    Kim, H.-S.3
  • 11
    • 84977334163 scopus 로고
    • Minimizing the weighted sum of quadratic completion times on a single machine
    • F.D. Croce, W. Szwarc, R. Tadei, P. Baracco, and R. di Tullio Minimizing the weighted sum of quadratic completion times on a single machine Naval Research Logistics 42 8 1995 1263 1270
    • (1995) Naval Research Logistics , vol.42 , Issue.8 , pp. 1263-1270
    • Croce, F.D.1    Szwarc, W.2    Tadei, R.3    Baracco, P.4    Di Tullio, R.5
  • 12
    • 15844419376 scopus 로고    scopus 로고
    • Ant colony optimization for the examination scheduling problem
    • DOI 10.1057/palgrave.jors.2601830
    • K.A. Dowsland, and J.M. Thompson Ant colony optimization for the examination scheduling problem Journal of the Operational Research Society 56 4 2005 426 438 (Pubitemid 40424118)
    • (2005) Journal of the Operational Research Society , vol.56 , Issue.4 , pp. 426-438
    • Dowsland, K.A.1    Thompson, J.M.2
  • 15
    • 0021427379 scopus 로고
    • On the single machine scheduling problem with quadratic penalty function of completion times: An improved branching procedure
    • S.K. Gupta, and T. Sen On the single machine scheduling problem with quadratic penalty function of completion times: An improved branching procedure Management Science 30 5 1984 644 647 (Pubitemid 14585816)
    • (1984) Management Science , vol.30 , Issue.5 , pp. 644-647
    • Gupta Sushil, K.1    Sen Tapan2
  • 16
    • 33748423575 scopus 로고    scopus 로고
    • Algorithms for single machine total tardiness scheduling with sequence dependent setups
    • DOI 10.1016/j.ejor.2005.05.018, PII S0377221705005060
    • S.R. Gupta, and J.R. Smith Algorithms for single machine total tardiness scheduling with sequence-dependent setups European Journal of Operational Research 175 2 2006 722 739 (Pubitemid 44345073)
    • (2006) European Journal of Operational Research , vol.175 , Issue.2 , pp. 722-739
    • Gupta, S.R.1    Smith, J.S.2
  • 19
    • 0001193147 scopus 로고    scopus 로고
    • The traveling salesman problem: A case study in local optimization
    • E. H. L. Aarts, J. K. Lenstra (Eds.) John Wiley and Sons
    • Johnson, D. S., McGeoch, L. A. (1997). The traveling salesman problem: A case study in local optimization. In E. H. L. Aarts, J. K. Lenstra (Eds.), Local search in combinatorial optimization. John Wiley and Sons, pp. 215-310.
    • (1997) Local Search in Combinatorial Optimization , pp. 215-310
    • Johnson, D.S.1    McGeoch, L.A.2
  • 20
    • 68649085140 scopus 로고    scopus 로고
    • Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times
    • J.-G. Kim, and D.-H. Lee Algorithms for common due-date assignment and sequencing on a single machine with sequence-dependent setup times Journal of the Operational Research Society 60 9 2009 1264 1272
    • (2009) Journal of the Operational Research Society , vol.60 , Issue.9 , pp. 1264-1272
    • Kim, J.-G.1    Lee, D.-H.2
  • 21
    • 36849022486 scopus 로고    scopus 로고
    • Single-machine scheduling problems with past-sequence-dependent setup times
    • DOI 10.1016/j.ejor.2006.03.066, PII S0377221706008198
    • C. Koulamas, and G.J. Kyparisis Single-machine scheduling problems with past-sequence-dependent setup times European Journal of Operational Research 187 3 2008 1045 1049 (Pubitemid 350236621)
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 1045-1049
    • Koulamas, C.1    Kyparisis, G.J.2
  • 23
    • 0000902813 scopus 로고
    • A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
    • C.Y. Lee, and J.Y. Choi A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights Computers & Operations Research 22 8 1995 857 869
    • (1995) Computers & Operations Research , vol.22 , Issue.8 , pp. 857-869
    • Lee, C.Y.1    Choi, J.Y.2
  • 24
    • 33845332680 scopus 로고    scopus 로고
    • An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups
    • DOI 10.1016/j.cor.2005.07.020, PII S0305054805002467
    • C.-J. Liao, and H.-C. Juan An ant colony optimization for single-machine tardiness scheduling with sequence-dependent setups Computers & Operations Research 34 7 2007 1899 1909 (Pubitemid 44879763)
    • (2007) Computers and Operations Research , vol.34 , Issue.7 , pp. 1899-1909
    • Liao, C.-J.1    Juan, H.-C.2
  • 25
    • 0015604699 scopus 로고
    • An effective heuristic algorithm for the travelling salesman problem
    • S. Lin, and B. Kernighan An effective heuristic algorithm for the travelling salesman problem Operations Research 21 2 1973 498 516
    • (1973) Operations Research , vol.21 , Issue.2 , pp. 498-516
    • Lin, S.1    Kernighan, B.2
  • 26
    • 47049122982 scopus 로고    scopus 로고
    • A hybrid approach for single-machine tardiness problems with sequence-dependent setup times
    • S.W. Lin, and K.C. Ying A hybrid approach for single-machine tardiness problems with sequence-dependent setup times Journal of the Operational Research Society 59 8 2008 1109 1119
    • (2008) Journal of the Operational Research Society , vol.59 , Issue.8 , pp. 1109-1119
    • Lin, S.W.1    Ying, K.C.2
  • 27
    • 33846312457 scopus 로고    scopus 로고
    • A branch-and-bound algorithm of the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness
    • DOI 10.1016/j.ejor.2005.06.069, PII S037722170500860X
    • X. Luo, and C. Chu A branch-and-bound algorithm for the single machine schedule with sequence-dependent setup times for minimizing maximum tardiness European Journal of Operational Research 180 1 2007 68 81 (Pubitemid 46123840)
    • (2007) European Journal of Operational Research , vol.180 , Issue.1 , pp. 68-81
    • Luo, X.1    Chu, C.2
  • 28
    • 33745140543 scopus 로고    scopus 로고
    • Some dominance properties for single-machine tardiness problems with sequence-dependent setup
    • DOI 10.1080/00207540500543257, PII V7048467678267
    • X. Luo, C. Chu, and C. Wang Some dominance properties for single-machine tardiness problems with sequence-dependent setup International Journal of Production Research 44 17 2006 3367 3378 (Pubitemid 43898307)
    • (2006) International Journal of Production Research , vol.44 , Issue.17 , pp. 3367-3378
    • Luo, X.1    Chu, C.2    Wang, C.3
  • 31
    • 77952536066 scopus 로고    scopus 로고
    • TCBB scheme: Applications to single machine sequencing problems
    • Mondal, S. A., Sen, A. K. (2000b). TCBB scheme: Applications to single machine sequencing problems. In Proceedings of AAAI-2000, pp. 792-797.
    • (2000) Proceedings of AAAI-2000 , pp. 792-797
    • Mondal, S.A.1    Sen, A.K.2
  • 32
    • 0033723865 scopus 로고    scopus 로고
    • An improved precedence rule for single machine sequencing problems with quadratic penalty
    • S.A. Mondal, and A.K. Sen An improved precedence rule for single machine sequencing problems with quadratic penalty European Journal of Operational Research 125 2 2000 425 428
    • (2000) European Journal of Operational Research , vol.125 , Issue.2 , pp. 425-428
    • Mondal, S.A.1    Sen, A.K.2
  • 33
    • 0035371947 scopus 로고    scopus 로고
    • Single machine weighted earlines-tardiness penalty problem with a common due date
    • DOI 10.1016/S0305-0548(99)00153-7, PII S0305054899001537
    • S.A. Mondal, and A.K. Sen Single machine weighted earliness-tardiness penalty problem with a common due date Computers & Operations Research 28 7 2001 649 669 (Pubitemid 32379142)
    • (2001) Computers and Operations Research , vol.28 , Issue.7 , pp. 649-669
    • Mondal, S.A.1    Sen, A.K.2
  • 34
    • 79955590808 scopus 로고    scopus 로고
    • Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time
    • N. Nekoiemehr, and G. Moslehi Minimizing the sum of maximum earliness and maximum tardiness in the single-machine scheduling problem with sequence-dependent setup time Journal of the Operational Research Society 62 7 2011 1403 1412
    • (2011) Journal of the Operational Research Society , vol.62 , Issue.7 , pp. 1403-1412
    • Nekoiemehr, N.1    Moslehi, G.2
  • 35
    • 0033101911 scopus 로고    scopus 로고
    • A genetic algorithm methodology for complex scheduling problems
    • B.A. Norman, and J.C. Bean A genetic algorithm methodology for complex scheduling problems Naval Research Logistics 46 2 1999 199 211
    • (1999) Naval Research Logistics , vol.46 , Issue.2 , pp. 199-211
    • Norman, B.A.1    Bean, J.C.2
  • 39
    • 27144540137 scopus 로고    scopus 로고
    • A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
    • DOI 10.1016/j.ejor.2004.06.038, PII S0377221705001451
    • R. Ruiz, and C. Maroto A genetic algorithm for hybrid flowshops with sequence-dependent setup times and machine eligibility European Journal of Operational Research 169 3 2006 781 800 (Pubitemid 41492016)
    • (2006) European Journal of Operational Research , vol.169 , Issue.3 , pp. 781-800
    • Ruiz, R.1    Maroto, C.2
  • 40
    • 28444498089 scopus 로고    scopus 로고
    • Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance
    • DOI 10.1016/j.apm.2005.03.017, PII S0307904X05000521
    • A. Sadegheih Scheduling problem using genetic algorithm, simulated annealing and the effects of parameter values on GA performance Applied Mathematical Modelling 30 2006 147 154 (Pubitemid 41723074)
    • (2006) Applied Mathematical Modelling , vol.30 , Issue.2 , pp. 147-154
    • Sadegheih, A.1
  • 41
    • 0030246266 scopus 로고    scopus 로고
    • Graph search methods for non-order-preserving evaluation functions: Applications to job sequencing problems
    • DOI 10.1016/0004-3702(95)00094-1
    • A.K. Sen, and A. Bagchi Graph search methods for non-order-preserving evaluation functions: Applications to job sequencing problems Artificial Intelligence 86 1 1996 43 73 (Pubitemid 126364348)
    • (1996) Artificial Intelligence , vol.86 , Issue.1 , pp. 43-73
    • Sen, A.K.1    Bagchi, A.2
  • 42
    • 0025227153 scopus 로고
    • Minimizing a generalized quadratic penalty function of job completion times. An improved branch-and-bound approach
    • DOI 10.1016/0167-188X(90)90121-W
    • T. Sen, P. Dileepan, and B. Ruparel Minimizing a generalized quadratic penalty function of job completion times: An improved branch-and-bound approach Engineering Costs and Production Economics 18 1990 197 202 (Pubitemid 20638505)
    • (1990) Engineering costs and production economics , vol.18 , Issue.3 , pp. 197-202
    • Sen, T.1    Dileepan, P.2    Ruparel, B.3
  • 43
    • 0005506580 scopus 로고
    • The single machine scheduling problem with a quadratic cost function of completion times
    • W. Szwarc, M.E. Posner, and J.J. Liu The single machine scheduling problem with a quadratic cost function of completion times Management Science 34 2 1988 1480 1488
    • (1988) Management Science , vol.34 , Issue.2 , pp. 1480-1488
    • Szwarc, W.1    Posner, M.E.2    Liu, J.J.3
  • 44
    • 56749104341 scopus 로고    scopus 로고
    • A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence-dependent setup times
    • M.F. Tasgetiren, Q.-K. Pan, and Y.-C. Liang A discrete differential evolution algorithm for the single machine total weighted tardiness problem with sequence-dependent setup times Computers & Operations Research 36 6 2009 1900 1915
    • (2009) Computers & Operations Research , vol.36 , Issue.6 , pp. 1900-1915
    • Tasgetiren, M.F.1    Pan, Q.-K.2    Liang, Y.-C.3
  • 45
    • 67349221528 scopus 로고    scopus 로고
    • Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints
    • R. Tavakkoli, F. Taheri, M. Bazzazi, M. Izadi, and F. Sassani Design of a genetic algorithm for bi-objective unrelated parallel machines scheduling with sequence-dependent setup times and precedence constraints Computers & Operations Research 36 12 2009 3224 3230
    • (2009) Computers & Operations Research , vol.36 , Issue.12 , pp. 3224-3230
    • Tavakkoli, R.1    Taheri, F.2    Bazzazi, M.3    Izadi, M.4    Sassani, F.5
  • 46
    • 0034692672 scopus 로고    scopus 로고
    • Solving machine loading problems in a flexible manufacturing system using a genetic algorithm based heuristic approach
    • DOI 10.1080/002075400418298
    • M.K. Tiwari, and N.K. Vidyarthi Solving machine loading problems in a flexible manufacturing system using a genetic algorithm based heuristic approach International Journal of Production Research 38 14 2000 3357 3384 (Pubitemid 35401964)
    • (2000) International Journal of Production Research , vol.38 , Issue.14 , pp. 3357-3384
    • Tiwari, M.K.1    Vidyarthi, N.K.2
  • 47
    • 0017921371 scopus 로고
    • Single machine problem with quadratic penalty function of completion times: A branch-and-bound solution
    • W. Townsend The single machine problem with quadratic penalty function of completion times: A branch-and-bound solution Management Science 24 5 1978 530 534 (Pubitemid 8576487)
    • (1978) Management Science , vol.24 , Issue.5 , pp. 530-534
    • Townsend, W.1
  • 48
    • 36348983818 scopus 로고    scopus 로고
    • Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups
    • DOI 10.1016/j.cor.2006.11.004, PII S0305054806002966, Selected Papers Presented at the ECCO'04 European Conference on Combinatorial Optimization
    • J.M.S. Valente, and R.A.F.S. Alves Beam search algorithms for the single machine total weighted tardiness scheduling problem with sequence-dependent setups Computers & Operations Research 35 7 2008 2388 2405 (Pubitemid 350161143)
    • (2008) Computers and Operations Research , vol.35 , Issue.7 , pp. 2388-2405
    • Valente, J.M.S.1    Alves, R.A.F.S.2
  • 49
    • 79952187971 scopus 로고    scopus 로고
    • A genetic algorithm for the unrelated parallel machine scheduling problem with sequence-dependent setup times
    • E. Vallada, and R. Ruiz A genetic algorithm for the unrelated parallel machine scheduling problem with sequence-dependent setup times European Journal of Operational Research 211 3 2011 612 622
    • (2011) European Journal of Operational Research , vol.211 , Issue.3 , pp. 612-622
    • Vallada, E.1    Ruiz, R.2
  • 50
    • 77952239692 scopus 로고    scopus 로고
    • Local search and genetic algorithm for the job shop scheduling problem with sequence-dependent setup times
    • C.R. Vela, R. Varela, and M.A. Gonzalez Local search and genetic algorithm for the job shop scheduling problem with sequence-dependent setup times Journal of Heuristics 16 2 2010 139 165
    • (2010) Journal of Heuristics , vol.16 , Issue.2 , pp. 139-165
    • Vela, C.R.1    Varela, R.2    Gonzalez, M.A.3
  • 51
    • 85046100453 scopus 로고    scopus 로고
    • Stochastic greedy algorithms: A learning-based approach to combinatorial optimization
    • Viswanathan, K. V., Sen, A. K., Chakraborty, S. (2011). Stochastic greedy algorithms: A learning-based approach to combinatorial optimization. International Journal on Advances in Software (http://www.iariajournals.org/ software). 4(1&2), 1-11.
    • (2011) International Journal on Advances in Software. , vol.4 , Issue.1-2 , pp. 1-11
    • Viswanathan, K.V.1    Sen, A.K.2    Chakraborty, S.3
  • 52
    • 53049086739 scopus 로고    scopus 로고
    • Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect
    • J.-B. Wang Single-machine scheduling with past-sequence-dependent setup times and time-dependent learning effect Computers & Industrial Engineering 55 3 2008 584 591
    • (2008) Computers & Industrial Engineering , vol.55 , Issue.3 , pp. 584-591
    • Wang, J.-B.1
  • 53
    • 75449095635 scopus 로고    scopus 로고
    • A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times
    • X. Wang, and L. Tang A hybrid metaheuristic for the prize-collecting single machine scheduling problem with sequence-dependent setup times Computers & Operations Research 37 9 2010 1624 1640
    • (2010) Computers & Operations Research , vol.37 , Issue.9 , pp. 1624-1640
    • Wang, X.1    Tang, L.2
  • 54
    • 78049392244 scopus 로고    scopus 로고
    • Single machine scheduling with past-sequence-dependent setup times and deteriorating jobs
    • Zhao, C., and Tang, H. (2010). Single machine scheduling with past-sequencedependent setup times and deteriorating jobs. Computers & Industrial Engineering, 59(4), 663666.
    • (2010) Computers & Industrial Engineering , vol.59 , Issue.4 , pp. 663-666
    • Zhao, C.1    Tang, H.2


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