메뉴 건너뛰기




Volumn 37, Issue 7-8, 2008, Pages 793-802

Parallel machine scheduling with earliness-tardiness penalties and space limits

Author keywords

Earliness tardiness penalties; Heuristic algorithm; Parallel machine scheduling

Indexed keywords

HEURISTIC ALGORITHMS; HIERARCHICAL SYSTEMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

EID: 42649132207     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1027-7     Document Type: Article
Times cited : (18)

References (25)
  • 2
    • 0025474221 scopus 로고
    • A state-of-the-art review of parallel-machine scheduling research
    • 3
    • Cheng TCE, Sin CCS (1990) A state-of-the-art review of parallel-machine scheduling research. Eur J Oper Res 47(3):271-292
    • (1990) Eur J Oper Res , vol.47 , pp. 271-292
    • Cheng, T.C.E.1    Sin, C.C.S.2
  • 3
    • 0028445470 scopus 로고
    • Parallel-machine scheduling problems with earliness and tardiness penalties
    • 6
    • Cheng TCE, Chen Z-L (1994) Parallel-machine scheduling problems with earliness and tardiness penalties. J Oper Res Soc 45(6):685-695
    • (1994) J Oper Res Soc , vol.45 , pp. 685-695
    • Cheng, T.C.E.1    Chen, Z.-L.2
  • 4
    • 0029371267 scopus 로고
    • Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms
    • 1-4
    • Cheng R, Gen M, Tozawa T (1995) Minmax earliness/tardiness scheduling in identical parallel machine system using genetic algorithms. Comput Ind Eng 29(1-4):513-517
    • (1995) Comput Ind Eng , vol.29 , pp. 513-517
    • Cheng, R.1    Gen, M.2    Tozawa, T.3
  • 5
    • 0032026499 scopus 로고    scopus 로고
    • Scheduling under a common due-date on parallel unrelated machines
    • 3
    • Adamopoulos GI, Pappis CP (1998) Scheduling under a common due-date on parallel unrelated machines. Eur J Oper Res 105(3):494-501
    • (1998) Eur J Oper Res , vol.105 , pp. 494-501
    • Adamopoulos, G.I.1    Pappis, C.P.2
  • 6
    • 0032792188 scopus 로고    scopus 로고
    • Multiple-machine scheduling with earliness, tardiness and completion time penalty
    • 1
    • Biskup D, Cheng TCE (1999) Multiple-machine scheduling with earliness, tardiness and completion time penalty. Comput Oper Res 26(1):45-57
    • (1999) Comput Oper Res , vol.26 , pp. 45-57
    • Biskup, D.1    Cheng, T.C.E.2
  • 7
    • 0032641373 scopus 로고    scopus 로고
    • A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem
    • 1
    • Chen Z-L, Powell WB (1999) A column generation based decomposition algorithm for a parallel machine just-in-time scheduling problem. Eur J Oper Res 116(1):220-232
    • (1999) Eur J Oper Res , vol.116 , pp. 220-232
    • Chen, Z.-L.1    Powell, W.B.2
  • 8
    • 0036466579 scopus 로고    scopus 로고
    • Parallel machine scheduling with a common due window
    • 3
    • Chen Z-L, Lee C-Y (2002) Parallel machine scheduling with a common due window. Eur J Oper Res 136(3):512-527
    • (2002) Eur J Oper Res , vol.136 , pp. 512-527
    • Chen, Z.-L.1    Lee, C.-Y.2
  • 9
    • 0037395532 scopus 로고    scopus 로고
    • Parallel machine earliness and tardiness scheduling with proportional weights
    • 5
    • Sun H, Wang G (2003) Parallel machine earliness and tardiness scheduling with proportional weights. Comput Oper Res 30(5):801-808
    • (2003) Comput Oper Res , vol.30 , pp. 801-808
    • Sun, H.1    Wang, G.2
  • 10
    • 33751080722 scopus 로고    scopus 로고
    • A simulated annealing approach to makespan minimization on identical parallel machines
    • 3-4
    • Lee W-C, Wu C-C, Chan P (2006) A simulated annealing approach to makespan minimization on identical parallel machines. Int J Adv Manuf Technol 31(3-4):328-334
    • (2006) Int J Adv Manuf Technol , vol.31 , pp. 328-334
    • Lee, W.-C.1    Wu, C.-C.2    Chan, P.3
  • 11
    • 34748843393 scopus 로고    scopus 로고
    • Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning
    • DOI 10.1007/s00170-006-0662-8
    • Zhang Z, Zheng L, Weng MX (2007) Dynamic parallel machine scheduling with mean weighted tardiness objective by Q-Learning. Int J Adv Manuf Technol (in press). DOI 10.1007/s00170-006-0662-8
    • (2007) Int J Adv Manuf Technol (In Press)
    • Zhang, Z.1    Zheng, L.2    Weng, M.X.3
  • 12
    • 33744535196 scopus 로고    scopus 로고
    • Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models
    • 1-2
    • Hu P-C (2006) Further study of minimizing total tardiness for the worker assignment scheduling problem in the identical parallel-machine models. Int J Adv Manuf Technol 29(1-2):165-169
    • (2006) Int J Adv Manuf Technol , vol.29 , pp. 165-169
    • Hu, P.-C.1
  • 13
    • 34547326656 scopus 로고    scopus 로고
    • Makespan minimization for two parallel machines with an unavailable period on each machine
    • doi 10.1007/s00170-006-0524-4
    • Lin C-H, Liao C-J (2007) Makespan minimization for two parallel machines with an unavailable period on each machine. Int J Adv Manuf Technol (in press) DOI 10.1007/s00170-006-0524-4
    • (2007) Int J Adv Manuf Technol (In Press)
    • Lin, C.-H.1    Liao, C.-J.2
  • 14
    • 33745698694 scopus 로고    scopus 로고
    • Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups
    • 5
    • Chen J-F (2006) Minimization of maximum tardiness on unrelated parallel machines with process restrictions and setups. Int J Adv Manuf Technol 29(5):557-563
    • (2006) Int J Adv Manuf Technol , vol.29 , pp. 557-563
    • Chen, J.-F.1
  • 16
    • 0042812478 scopus 로고    scopus 로고
    • Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints
    • 13
    • Ventura JA, Kim D (2003) Parallel machine scheduling with earliness-tardiness penalties and additional resource constraints. Comput Oper Res 30(13):1945-1958
    • (2003) Comput Oper Res , vol.30 , pp. 1945-1958
    • Ventura, J.A.1    Kim, D.2
  • 17
    • 0033166361 scopus 로고    scopus 로고
    • Parallel machine scheduling with earliness and tardiness penalties
    • 8
    • Sivrikaya-Serifoglu F, Ulusoy G (1999) Parallel machine scheduling with earliness and tardiness penalties. Comput Oper Res 26(8):773-787
    • (1999) Comput Oper Res , vol.26 , pp. 773-787
    • Sivrikaya-Serifoglu, F.1    Ulusoy, G.2
  • 18
    • 0033079828 scopus 로고    scopus 로고
    • Early/tardy scheduling with sequence dependent setups on uniform parallel machines
    • 2
    • Balakrishnan N, Kanet JJ, Sridharan SV (1999) Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput Oper Res 26(2):127-141
    • (1999) Comput Oper Res , vol.26 , pp. 127-141
    • Balakrishnan, N.1    Kanet, J.J.2    Sridharan, S.V.3
  • 19
    • 0031246527 scopus 로고    scopus 로고
    • Parallel machine scheduling with release time and machine eligibility restrictions
    • 1-2
    • Centeno G, Armacost RL (1997) Parallel machine scheduling with release time and machine eligibility restrictions. Comput Ind Eng 33(1-2):273-276
    • (1997) Comput Ind Eng , vol.33 , pp. 273-276
    • Centeno, G.1    Armacost, R.L.2
  • 20
    • 0000902813 scopus 로고
    • A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights
    • 8
    • Lee CY, Choi JY (1995) A genetic algorithm for job sequencing problems with distinct due dates and general early-tardy penalty weights. Comput Oper Res 22(8):857-869
    • (1995) Comput Oper Res , vol.22 , pp. 857-869
    • Lee, C.Y.1    Choi, J.Y.2
  • 24
    • 0000411214 scopus 로고
    • Tabu search-part i
    • 3
    • Glover F (1989) Tabu search-part I. ORSA J Comput 1(3):190-206
    • (1989) ORSA J Comput , vol.1 , pp. 190-206
    • Glover, F.1
  • 25
    • 0001724713 scopus 로고
    • Tabu search-part II
    • 1
    • Glover F (1989) Tabu search-part II. ORSA J Comput 2(1):4-32
    • (1989) ORSA J Comput , vol.2 , pp. 4-32
    • Glover, F.1


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