메뉴 건너뛰기




Volumn 33, Issue 3-4, 1997, Pages 793-796

Search heuristics for a parallel machine scheduling problem with ready times and due dates

Author keywords

Parallel machine scheduling; Simulated Annealing; Taboo Search

Indexed keywords

ALGORITHMS; HEURISTIC METHODS; PRODUCTION CONTROL; SIMULATED ANNEALING;

EID: 0031341489     PISSN: 03608352     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0360-8352(97)00255-6     Document Type: Article
Times cited : (33)

References (13)
  • 1
    • 0021819411 scopus 로고
    • Thermodynamical approach to the traveling salesman problem: An efficient simulation algorithm
    • Cerny, V., 1985, Thermodynamical Approach to the Traveling Salesman Problem: An Efficient Simulation Algorithm, Journal of Optimization Theory and Applications, 45: 41-51
    • (1985) Journal of Optimization Theory and Applications , vol.45 , pp. 41-51
    • Cerny, V.1
  • 2
    • 84974859431 scopus 로고
    • A heuristic for common due-date assignment and job scheduling on parallel machines
    • Cheng, T.C.E., 1989, A Heuristic for Common Due-date Assignment and Job Scheduling on Parallel Machines", Journal of the Operational Research Society, 40(12): 1129-1135
    • (1989) Journal of the Operational Research Society , vol.40 , Issue.12 , pp. 1129-1135
    • Cheng, T.C.E.1
  • 3
    • 0026154209 scopus 로고
    • On the multiple-machine extension to a common due-date assignment and scheduling problem
    • De, P., Ghosh, J.B., and Well, C.E., 1991, On the Multiple-Machine Extension to a Common Due-date Assignment and Scheduling Problem, Journal of the Operational Research Society, 42: 419-422
    • (1991) Journal of the Operational Research Society , vol.42 , pp. 419-422
    • De, P.1    Ghosh, J.B.2    Well, C.E.3
  • 4
    • 0028374525 scopus 로고
    • Due-date assignment and early/tardy scheduling on identical parallel machines
    • De, P., Ghosh, J.B., and Well, C.E., 1994, Due-date Assignment and Early/Tardy Scheduling on Identical Parallel Machines, Naval Research Logistics, 41(1): 17-32
    • (1994) Naval Research Logistics , vol.41 , Issue.1 , pp. 17-32
    • De, P.1    Ghosh, J.B.2    Well, C.E.3
  • 7
    • 0002393136 scopus 로고
    • Single- and multiple-processor models for minimizing completion time variance
    • Hall, N.G., 1986, Single- and multiple-processor models for minimizing completion time variance, Naval Research Logisticts Quarterly, 33: 49-54
    • (1986) Naval Research Logisticts Quarterly , vol.33 , pp. 49-54
    • Hall, N.G.1
  • 9
    • 0027627229 scopus 로고
    • Integrating target analysis and tabu search for improved scheduling systems
    • Laguna, M., and Glover, F., 1993, Integrating Target Analysis and Tabu Search for Improved Scheduling Systems, Expert Systems with Applications, 6: 287-297
    • (1993) Expert Systems with Applications , vol.6 , pp. 287-297
    • Laguna, M.1    Glover, F.2
  • 10
    • 0022463446 scopus 로고
    • Convergence of an annealing algorithm
    • Lundy, M., and Mees, A., 1986, Convergence of an Annealing Algorithm, Mathematical Programming, 34: 111-124
    • (1986) Mathematical Programming , vol.34 , pp. 111-124
    • Lundy, M.1    Mees, A.2
  • 11
    • 5244278595 scopus 로고    scopus 로고
    • A fast taboo search algorithm for the job shop problem
    • Nowicki, E., and Smutnicki, C., 1996, A Fast Taboo Search Algorithm for the Job Shop Problem, Management Science, 42(6): 797-813
    • (1996) Management Science , vol.42 , Issue.6 , pp. 797-813
    • Nowicki, E.1    Smutnicki, C.2
  • 12
    • 0027578685 scopus 로고
    • Improving the efficiency of tabu search for machine sequencing problems
    • Reeves, C. R., 1993, Improving the Efficiency of Tabu Search for Machine Sequencing Problems, Journal of the Operational Research Society, 44(4): 375-382
    • (1993) Journal of the Operational Research Society , vol.44 , Issue.4 , pp. 375-382
    • Reeves, C.R.1


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