메뉴 건너뛰기




Volumn 36, Issue 4, 2004, Pages 359-372

Unrelated parallel machine scheduling with job splitting

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; FUNCTIONS; HEURISTIC METHODS; INVENTORY CONTROL; JOB ANALYSIS; JUST IN TIME PRODUCTION; PROBLEM SOLVING; WORK-REST SCHEDULES;

EID: 1642328443     PISSN: 0740817X     EISSN: None     Source Type: Journal    
DOI: 10.1080/07408170490279598     Document Type: Article
Times cited : (70)

References (38)
  • 1
    • 0003781665 scopus 로고
    • The MathWorks, Inc., Natick, MA
    • Anon. (1984) MATLAB version 4.2, The MathWorks, Inc., Natick, MA.
    • (1984) MATLAB Version 4.2
  • 3
    • 0141654518 scopus 로고    scopus 로고
    • LINDO Systems, Inc., Chicago, IL
    • Anon (1998) Hyper LINGO version 4.0, LINDO Systems, Inc., Chicago, IL.
    • (1998) Hyper LINGO Version 4.0
  • 4
    • 0032628095 scopus 로고    scopus 로고
    • Scheduling jobs on unrelated parallel machines to minimize regular total cost functions
    • Azizoglu, M. and Kirca, O. (1999) Scheduling jobs on unrelated parallel machines to minimize regular total cost functions. IIE Transactions, 31, 153-159.
    • (1999) IIE Transactions , vol.31 , pp. 153-159
    • Azizoglu, M.1    Kirca, O.2
  • 5
    • 0042350495 scopus 로고
    • An overview of tabu-search approaches to production scheduling problems
    • Brown, D. E. and Scherer, W.T. (eds.), Kluwer Publishers, Boston, MA
    • Barnes, J.W., Laguna, M. and Glover, F. (1995) An overview of tabu-search approaches to production scheduling problems, in Intelligent Scheduling Systems, Brown, D. E. and Scherer, W.T. (eds.), pp. 101-127, Kluwer Publishers, Boston, MA.
    • (1995) Intelligent Scheduling Systems , pp. 101-127
    • Barnes, J.W.1    Laguna, M.2    Glover, F.3
  • 8
    • 0031246527 scopus 로고    scopus 로고
    • Parallel machine scheduling with release time and machine eligibility restrictions
    • Centeno, G. and Armacost, R.L. (1997) Parallel machine scheduling with release time and machine eligibility restrictions. Journal of Computers and Industrial Engineering, 33(1), 273-276.
    • (1997) Journal of Computers and Industrial Engineering , vol.33 , Issue.1 , pp. 273-276
    • Centeno, G.1    Armacost, R.L.2
  • 11
    • 0002908970 scopus 로고
    • Algorithms for scheduling tasks on unrelated processors
    • Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA
    • Davis, E. and Jaffe, J.M. (1979) Algorithms for scheduling tasks on unrelated processors. Technical report, Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, MA.
    • (1979) Technical Report
    • Davis, E.1    Jaffe, J.M.2
  • 12
  • 13
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • Glover, F. (1986) Future paths for integer programming and links to artificial intelligence. Computers and Operations Research, 13(5), 533-549.
    • (1986) Computers and Operations Research , vol.13 , Issue.5 , pp. 533-549
    • Glover, F.1
  • 14
    • 0000411214 scopus 로고
    • Tabu search-part I
    • Glover, F. (1989) Tabu search-part I. ORSA Journal on Computing, 1(3), 190-206.
    • (1989) ORSA Journal on Computing , vol.1 , Issue.3 , pp. 190-206
    • Glover, F.1
  • 15
    • 0002703574 scopus 로고
    • Tabu search: A tutorial
    • Glover, F. (1990a) Tabu search: a tutorial. Interfaces, 20, 74-94.
    • (1990) Interfaces , vol.20 , pp. 74-94
    • Glover, F.1
  • 16
    • 0001724713 scopus 로고
    • Tabu search-part II
    • Glover, F. (1990b) Tabu search-part II. ORSA Journal on Computing, 2(1), 4-32.
    • (1990) ORSA Journal on Computing , vol.2 , Issue.1 , pp. 4-32
    • Glover, F.1
  • 18
    • 0141543210 scopus 로고
    • Converting the 0-1 polynomial programming problem to a 0-1 linear program
    • no. 72-3, Business Research Division, University of Colorado, Boulder, CO
    • Glover, F. and Woolsey, E. (1972) Converting the 0-1 polynomial programming problem to a 0-1 linear program. Management Science Report Series, no. 72-3, Business Research Division, University of Colorado, Boulder, CO.
    • (1972) Management Science Report Series
    • Glover, F.1    Woolsey, E.2
  • 20
    • 0030735290 scopus 로고    scopus 로고
    • A heursitic to minimize the total weighted tardiness with sequence-dependent setups
    • Lee, Y.H., Bhaskaran, K. and Pinedo, M. (1997) A heursitic to minimize the total weighted tardiness with sequence-dependent setups. IIE Transactions, 29, 45-52.
    • (1997) IIE Transactions , vol.29 , pp. 45-52
    • Lee, Y.H.1    Bhaskaran, K.2    Pinedo, M.3
  • 23
    • 0031103522 scopus 로고    scopus 로고
    • A tabu-search-based approach for scheduling job-shop type flexible manufacturing systems
    • Logendran, R. and Sonthinen, A. (1997) A tabu-search-based approach for scheduling job-shop type flexible manufacturing systems. Journal of the Operational Research Society, 48, 264-277.
    • (1997) Journal of the Operational Research Society , vol.48 , pp. 264-277
    • Logendran, R.1    Sonthinen, A.2
  • 27
    • 0000245614 scopus 로고
    • The single machine early/tardy problem
    • Ow, P.S. and Morton, T.E. (1989) The single machine early/tardy problem. Management Science, 35(2), 177-191.
    • (1989) Management Science , vol.35 , Issue.2 , pp. 177-191
    • Ow, P.S.1    Morton, T.E.2
  • 28
    • 0030295335 scopus 로고    scopus 로고
    • A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search
    • Piersma, N. and Van Dijk, W. (1996) A local search heuristic for unrelated parallel machine scheduling with efficient neighborhood search. Mathematical and Computer Modeling, 24(9), 11-19.
    • (1996) Mathematical and Computer Modeling , vol.24 , Issue.9 , pp. 11-19
    • Piersma, N.1    Van Dijk, W.2
  • 30
    • 0041776646 scopus 로고
    • Myopic heuristics for the single machine weighted tardiness problem
    • Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA
    • Rachamadugu, R.V. and Morton, T.E. (1981) Myopic heuristics for the single machine weighted tardiness problem. Working paper 28-81-82, Graduate School of Industrial Administration, Carnegie-Mellon University, Pittsburgh, PA.
    • (1981) Working Paper 28-81-82
    • Rachamadugu, R.V.1    Morton, T.E.2
  • 31
    • 0030398342 scopus 로고    scopus 로고
    • Parallel machine scheduling with release dates, due dates, and family setup times
    • Schutten, J.M.J. and Leussink, R.A.M. (1996) Parallel machine scheduling with release dates, due dates, and family setup times. International Journal of Production Economics, 46/47, 119-125.
    • (1996) International Journal of Production Economics , vol.46-47 , pp. 119-125
    • Schutten, J.M.J.1    Leussink, R.A.M.2
  • 32
    • 0030182052 scopus 로고    scopus 로고
    • Scheduling jobs on several machines with job splitting property
    • Serafini, P. (1996) Scheduling jobs on several machines with job splitting property. Operations Research, 44, 617-628.
    • (1996) Operations Research , vol.44 , pp. 617-628
    • Serafini, P.1
  • 34
    • 0030196424 scopus 로고    scopus 로고
    • Scheduling of unrelated parallel machines when machine availability is specified
    • Suresh, V. and Chaudhuri, D. (1996) Scheduling of unrelated parallel machines when machine availability is specified. Production Planning and Control, 7(4), 393-400.
    • (1996) Production Planning and Control , vol.7 , Issue.4 , pp. 393-400
    • Suresh, V.1    Chaudhuri, D.2
  • 35
    • 0023399009 scopus 로고
    • Priority rules for job shops with weighted tardiness costs
    • Vepsalainen, A.P.J. and Morton, I.E. (1987) Priority rules for job shops with weighted tardiness costs. Management Science, 33(8), 1035-1047.
    • (1987) Management Science , vol.33 , Issue.8 , pp. 1035-1047
    • Vepsalainen, A.P.J.1    Morton, I.E.2
  • 36
    • 0005638765 scopus 로고
    • Reduction of integer polynomial programming problems to zero-one linear programming problems
    • Watters, L. J. (1967) Reduction of integer polynomial programming problems to zero-one linear programming problems. Operations Research, 15, 1111-1114.
    • (1967) Operations Research , vol.15 , pp. 1111-1114
    • Watters, L.J.1
  • 37
    • 0347934513 scopus 로고    scopus 로고
    • Parallel machine scheduling with splitting jobs
    • Xing, W. and Zhang, J. (2000) Parallel machine scheduling with splitting jobs. Discrete Applied Mathematics, 103, 259-269.
    • (2000) Discrete Applied Mathematics , vol.103 , pp. 259-269
    • Xing, W.1    Zhang, J.2


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