메뉴 건너뛰기




Volumn 39, Issue 6, 2012, Pages 1197-1205

A tabu search algorithm for order acceptance and scheduling

Author keywords

Order acceptance; Scheduling; Sequence dependent setup times; Tabu search

Indexed keywords

MAKE-TO-ORDER PRODUCTION SYSTEMS; MIXED INTEGER PROGRAMMING; NEAR-OPTIMAL SOLUTIONS; OPTIMALITY; ORDER ACCEPTANCE; PRODUCTION CAPACITY; RELEASE DATE; RUNTIMES; SCHEDULING DECISIONS; SCHEDULING PROBLEM; SEQUENCE-DEPENDENT SETUP TIME; TABU SEARCH ALGORITHMS; TARDINESS PENALTIES; TEST INSTANCES; TOTAL REVENUE;

EID: 80053346127     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.cor.2010.09.018     Document Type: Conference Paper
Times cited : (132)

References (25)
  • 1
    • 0030084767 scopus 로고    scopus 로고
    • Selecting jobs for a heavily loaded shop with lateness penalties
    • S. Slotnick, and T. Morton Selecting jobs for a heavily loaded shop with lateness penalties Computers and Operations Research 23 2 1996 131 140
    • (1996) Computers and Operations Research , vol.23 , Issue.2 , pp. 131-140
    • Slotnick, S.1    Morton, T.2
  • 2
    • 0031075465 scopus 로고    scopus 로고
    • Job selection in a heavily loaded shop
    • J. Ghosh Job selection in a heavily loaded shop Computers and Operations Research 24 2 1997 141 145
    • (1997) Computers and Operations Research , vol.24 , Issue.2 , pp. 141-145
    • Ghosh, J.1
  • 3
    • 33847678988 scopus 로고    scopus 로고
    • Order acceptance with weighted tardiness
    • DOI 10.1016/j.cor.2005.11.012, PII S030505480500359X
    • S. Slotnick, and T. Morton Order acceptance with weighted tardiness Computers and Operations Research 34 10 2007 3029 3042 (Pubitemid 46356735)
    • (2007) Computers and Operations Research , vol.34 , Issue.10 , pp. 3029-3042
    • Slotnick, S.A.1    Morton, T.E.2
  • 6
    • 0026880663 scopus 로고
    • Order acceptance strategies in a production-to-order environment with setup times and due-dates
    • W. Wester, J. Wijngaard, and M. Zijm Order acceptance strategies in a production-to-order environment with setup times and due-dates International Journal of Production Research 30 1992 1313 1326
    • (1992) International Journal of Production Research , vol.30 , pp. 1313-1326
    • Wester, W.1    Wijngaard, J.2    Zijm, M.3
  • 8
    • 34648825437 scopus 로고    scopus 로고
    • A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times
    • DOI 10.1016/j.cie.2007.02.005, PII S0360835207000800
    • B. Yang, and J. Geunes A single resource scheduling problem with job-selection flexibility, tardiness costs and controllable processing times Computers and Industrial Engineering 53 2 2007 420 432 (Pubitemid 47464779)
    • (2007) Computers and Industrial Engineering , vol.53 , Issue.3 , pp. 420-432
    • Yang, B.1    Geunes, J.2
  • 9
    • 41149149606 scopus 로고    scopus 로고
    • Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling
    • DOI 10.1007/s00170-006-0904-9
    • Y. Chen, Y. Lu, and G. Yang Hybrid evolutionary algorithm with marriage of genetic algorithm and extremal optimization for production scheduling International Journal of Advanced Manufacturing Technology 36 2008 959 968 (Pubitemid 351431707)
    • (2008) International Journal of Advanced Manufacturing Technology , vol.36 , Issue.9-10 , pp. 959-968
    • Chen, Y.-W.1    Lu, Y.-Z.2    Yang, G.-K.3
  • 10
    • 33645576841 scopus 로고    scopus 로고
    • Requirements planning with pricing and order selection flexibility
    • J. Geunes, H. Romeijn, and K. Taaffe Requirements planning with pricing and order selection flexibility Operations Research 54 2006 394 401
    • (2006) Operations Research , vol.54 , pp. 394-401
    • Geunes, J.1    Romeijn, H.2    Taaffe, K.3
  • 14
    • 0007992513 scopus 로고
    • Recent developments in deterministic sequencing and scheduling a survey
    • Dempster M, Lenstra J, Rinnooy Kan A, editors
    • Lawler E, Lenstra J, Rinnooy Kan A. Recent developments in deterministic sequencing and scheduling a survey. In: Dempster M, Lenstra J, Rinnooy Kan A, editors. Deterministic and stochastic scheduling; 1982. p. 3573.
    • (1982) Deterministic and Stochastic Scheduling , pp. 3573
    • Lawler, E.1    Lenstra, J.2    Rinnooy Kan, A.3
  • 15
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • F. Glover Future paths for integer programming and links to artificial intelligence Computers and Operations Research 13 1986 533 543
    • (1986) Computers and Operations Research , vol.13 , pp. 533-543
    • Glover, F.1
  • 16
    • 33750011412 scopus 로고    scopus 로고
    • A tabu search algorithm for the single machine total weighted tardiness problem
    • DOI 10.1016/j.ejor.2005.10.030, PII S0377221705008568
    • U. Bilge, M. Kurtulan, and F. Kirac A tabu search algorithm for single machine total weighted tardiness problem European Journal of Operational Research 176 2007 1423 1435 (Pubitemid 44573658)
    • (2007) European Journal of Operational Research , vol.176 , Issue.3 , pp. 1423-1435
    • Bilge, U.1    Kurtulan, M.2    Kirac, F.3
  • 17
    • 0037120685 scopus 로고    scopus 로고
    • Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties
    • DOI 10.1016/S0377-2217(01)00302-2, PII S0377221701003022
    • G. Wan, and B. Yen Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties European Journal of Operational Research 142 2002 271 281 (Pubitemid 34803133)
    • (2002) European Journal of Operational Research , vol.142 , Issue.2 , pp. 271-281
    • Wan, G.1    Yen, B.P.-C.2
  • 18
    • 33749118013 scopus 로고    scopus 로고
    • A multi-objective tabu search for a single-machine scheduling problem with sequence-dependent setup times
    • DOI 10.1016/j.ejor.2005.04.038, PII S0377221705004522
    • F. Choobineh, E. Mohebbi, and H. Khoo A multi-objective tabu search for a single-machine scheduling problem with sequence dependent setup times European Journal of Operational Research 175 2006 318 337 (Pubitemid 44470727)
    • (2006) European Journal of Operational Research , vol.175 , Issue.1 , pp. 318-337
    • Choobineh, F.F.1    Mohebbi, E.2    Khoo, H.3
  • 19
    • 33744515419 scopus 로고    scopus 로고
    • Block approach-tabu search algorithm for single machine total weighted tardiness problem
    • DOI 10.1016/j.cie.2005.12.001, PII S0360835205001397
    • W. Bozejko, J. Grabowski, and M. Wodecki Block approach-tabu search algorithm for single machine total weighted tardiness problem Computers and Industrial Engineering 50 2006 1 14 (Pubitemid 43816784)
    • (2006) Computers and Industrial Engineering , vol.50 , Issue.1-2 , pp. 1-14
    • Bozejko, W.1    Grabowski, J.2    Wodecki, M.3
  • 20
    • 84987039881 scopus 로고
    • Sequencing and batching for two classes of jobs with deadlines and setup times
    • D. Woodruff, and M. Spearman Sequencing and batching for two classes of jobs with deadlines and setup times Production and Operations Management 1 1 1992 87 102
    • (1992) Production and Operations Management , vol.1 , Issue.1 , pp. 87-102
    • Woodruff, D.1    Spearman, M.2
  • 22
    • 0029376258 scopus 로고
    • A hybrid approach to sequencing jobs using heuristic rules and neural networks
    • S. Kim, Y. Lee, and D. Agnihotri A hybrid approach to sequencing jobs using heuristic rules and neural networks Production Planning Control 6 4 1995 445 454
    • (1995) Production Planning Control , vol.6 , Issue.4 , pp. 445-454
    • Kim, S.1    Lee, Y.2    Agnihotri, D.3
  • 23
    • 0030735290 scopus 로고    scopus 로고
    • A heuristic to minimize the total weighted tardiness with sequence-dependent setups
    • Y. Lee, K. Bhaskaran, and M. Pinedo A heuristic to minimize the total weighted tardiness with sequence dependent setups IIE Transactions 29 1997 45 52 (Pubitemid 127754351)
    • (1997) IIE Transactions (Institute of Industrial Engineers) , vol.29 , Issue.1 , pp. 45-52
    • Lee, Y.H.1
  • 24
    • 0022023671 scopus 로고
    • A branch and bound algorithm for the total weighted tardiness problem
    • C. Potts, and L.V. Wassenhove A branch and bound algorithm for the total weighted tardiness problem Operations Research 33 2 1984 363 377
    • (1984) Operations Research , vol.33 , Issue.2 , pp. 363-377
    • Potts, C.1    Wassenhove, L.V.2
  • 25
    • 0034311443 scopus 로고    scopus 로고
    • An exact approach to minimizing total weighted tardiness problem with release
    • M. Aktürk, and D. Özdemir An exact approach to minimizing total weighted tardiness problem with release IIE Transactions 32 11 2000 1091 1101
    • (2000) IIE Transactions , vol.32 , Issue.11 , pp. 1091-1101
    • Aktürk, M.1    Özdemir, D.2


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