메뉴 건너뛰기




Volumn 39, Issue 3-4, 2008, Pages 355-366

Minimizing flow-time variance in a single-machine system using genetic algorithms

Author keywords

Completion time variance (CTV); Genetic algorithm; Scheduling; Single machine problem; Spreadsheets

Indexed keywords

ALGORITHMS; ANNEALING; BIOELECTRIC PHENOMENA; DIESEL ENGINES; POPULATION STATISTICS; SIMULATED ANNEALING; SPREADSHEETS; TABU SEARCH; TESTING;

EID: 52749090080     PISSN: 02683768     EISSN: 14333015     Source Type: Journal    
DOI: 10.1007/s00170-007-1221-7     Document Type: Article
Times cited : (15)

References (47)
  • 1
    • 0001127702 scopus 로고
    • Variance minimization in single-machine sequencing problem
    • AG Merten ME Muller 1972 Variance minimization in single-machine sequencing problem Manage Sci 18 518 528
    • (1972) Manage Sci , vol.18 , pp. 518-528
    • Merten, A.G.1    Muller, M.E.2
  • 2
    • 0017460225 scopus 로고
    • Minimizing the waiting time variance in the single-machine problem
    • S Eilon IC Chowdhuary 1977 Minimizing the waiting time variance in the single-machine problem Manage Sci 23 567 575
    • (1977) Manage Sci , vol.23 , pp. 567-575
    • Eilon, S.1    Chowdhuary, I.C.2
  • 3
    • 0019704009 scopus 로고
    • Minimizing variation of flow times in single-machine systems
    • JJ Kanet 1981 Minimizing variation of flow times in single-machine systems Manage Sci 27 1453 1459
    • (1981) Manage Sci , vol.27 , pp. 1453-1459
    • Kanet, J.J.1
  • 4
    • 0023170104 scopus 로고
    • Deterministic and random single machine with variance minimization
    • V Vani M Raghvachari 1987 Deterministic and random single machine with variance minimization Oper Res 35 111 120
    • (1987) Oper Res , vol.35 , pp. 111-120
    • Vani, V.1    Raghvachari, M.2
  • 5
    • 0025476901 scopus 로고
    • Minimizing the flow-time variance in single-machine systems
    • MC Gupta YP Gupta CR Bector 1990 Minimizing the flow-time variance in single-machine systems J Oper Res Soc 41 767 779
    • (1990) J Oper Res Soc , vol.41 , pp. 767-779
    • Gupta, M.C.1    Gupta, Y.P.2    Bector, C.R.3
  • 6
    • 52749095975 scopus 로고
    • A hybrid simulated annealing approach for single-machine scheduling problem with non-regular penalty functions
    • J Mittenthal M Ragavachari AI Rana 1993 A hybrid simulated annealing approach for single-machine scheduling problem with non-regular penalty functions Comput Ind Eng 20 130 131
    • (1993) Comput Ind Eng , vol.20 , pp. 130-131
    • Mittenthal, J.1    Ragavachari, M.2    Rana, A.I.3
  • 7
    • 0027906589 scopus 로고
    • Minimizing the flow-time variance in a single-machine system using genetic algorithms
    • MC Gupta YP Gupta A Kumar 1993 Minimizing the flow-time variance in a single-machine system using genetic algorithms Eur J Oper Res 70 289 303
    • (1993) Eur J Oper Res , vol.70 , pp. 289-303
    • Gupta, M.C.1    Gupta, Y.P.2    Kumar, A.3
  • 8
    • 0027644930 scopus 로고
    • Completion time variance minimization on a single machine is difficult
    • W Kubiak 1993 Completion time variance minimization on a single machine is difficult Oper Res Lett 14 49 59
    • (1993) Oper Res Lett , vol.14 , pp. 49-59
    • Kubiak, W.1
  • 9
    • 0000949693 scopus 로고
    • Minimizing single-machine completion time variance
    • J Ventura MX Weng 1995 Minimizing single-machine completion time variance Manage Sci 41 1448 1455
    • (1995) Manage Sci , vol.41 , pp. 1448-1455
    • Ventura, J.1    Weng, M.X.2
  • 10
    • 0033115816 scopus 로고    scopus 로고
    • Bounds for the position of the smallest job in completion time variance minimization
    • DK Manna VR Prasad 1999 Bounds for the position of the smallest job in completion time variance minimization Eur J Oper Res 114 411 419
    • (1999) Eur J Oper Res , vol.114 , pp. 411-419
    • Manna, D.K.1    Prasad, V.R.2
  • 11
    • 0035480298 scopus 로고    scopus 로고
    • Tabu search for a class of single-machine scheduling problems
    • U Al-Turki C Fedjiki A Andijani 2001 Tabu search for a class of single-machine scheduling problems Comput Ind Eng 28 1223 1230
    • (2001) Comput Ind Eng , vol.28 , pp. 1223-1230
    • Al-Turki, U.1    Fedjiki, C.2    Andijani, A.3
  • 12
    • 0037410975 scopus 로고    scopus 로고
    • A branch-and-bound algorithm to minimize completion time variance on a single processor
    • G Viswanathkumar G Srinivasan 2003 A branch-and-bound algorithm to minimize completion time variance on a single processor Comput Oper Res 30 1135 1150
    • (2003) Comput Oper Res , vol.30 , pp. 1135-1150
    • Viswanathkumar, G.1    Srinivasan, G.2
  • 13
    • 0036644620 scopus 로고    scopus 로고
    • Permutation polyhedra and minimisation of the variance of completion times on a single machine
    • 4
    • P Sharma 2002 Permutation polyhedra and minimisation of the variance of completion times on a single machine J Heurist 8 4 467 485
    • (2002) J Heurist , vol.8 , pp. 467-485
    • Sharma, P.1
  • 14
    • 17444423668 scopus 로고    scopus 로고
    • Minimizing completion time variance with compressible processing times
    • 2
    • CT Ng X Cai TCE Cheng SS Lam 2005 Minimizing completion time variance with compressible processing times J Glob Optim 31 2 333 352
    • (2005) J Glob Optim , vol.31 , pp. 333-352
    • Ng, C.T.1    Cai, X.2    Cheng, T.C.E.3    Lam, S.S.4
  • 17
    • 33644668514 scopus 로고    scopus 로고
    • Hybrid approach to production scheduling using genetic algorithm and simulation
    • Jeong SJ, Lim, SJ, Kim, KS (2006) Hybrid approach to production scheduling using genetic algorithm and simulation. Int J Adv Manuf Technol 28:1-2
    • (2006) Int J Adv Manuf Technol , vol.28 , pp. 1-2
    • Jeong, S.J.1    Lim, S.J.2    Kim, K.S.3
  • 18
    • 52749084934 scopus 로고    scopus 로고
    • A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion
    • Chou F-D (2006) A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion. Int J Adv Manuf Technol 27:15-24
    • (2006) Int J Adv Manuf Technol , vol.27 , pp. 15-24
    • Chou, F.-D.1
  • 19
    • 31844443720 scopus 로고    scopus 로고
    • Improved genetic algorithm for the job-shop scheduling problem
    • Liu, T-K, Tsai, J-T, Chou J-H (2006) Improved genetic algorithm for the job-shop scheduling problem. Int J Adv Manuf Technol 27(9-10):1021-1029
    • (2006) Int J Adv Manuf Technol , vol.27 , Issue.9-10 , pp. 1021-1029
    • Liu, T.-K.1    Tsai, J.-T.2    Chou, J.-H.3
  • 20
    • 33847709085 scopus 로고    scopus 로고
    • A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families
    • 10
    • S Malve R Uzsoy 2007 A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job families Comput Oper Res 34 10 3016 3028
    • (2007) Comput Oper Res , vol.34 , pp. 3016-3028
    • Malve, S.1    Uzsoy, R.2
  • 21
    • 33751418065 scopus 로고    scopus 로고
    • An effective architecture for learning and evolving flexible job-shop schedules
    • 2
    • NB Ho JC Tay M-K E 2007 An effective architecture for learning and evolving flexible job-shop schedules Eur J Oper Res 179 2 316 333
    • (2007) Eur J Oper Res , vol.179 , pp. 316-333
    • Ho, N.B.1    Tay, J.C.2
  • 22
    • 33846451096 scopus 로고    scopus 로고
    • Multiobjective single-machine scheduling with nontraditional requirements
    • 2
    • U Haral R-W Chen Jr WG Ferrell MB Kurz 2007 Multiobjective single-machine scheduling with nontraditional requirements Int J Prod Econ 106 2 574 584
    • (2007) Int J Prod Econ , vol.106 , pp. 574-584
    • Haral, U.1    Chen Jr, R.-W.2    Ferrell, W.G.3    Kurz, M.B.4
  • 23
    • 52749084419 scopus 로고    scopus 로고
    • A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
    • Corrected Proof, Available online 16 February 2007
    • Essafi I, Mati Y, Dauzère-Pérès S (2007) A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem. Compute Oper Res (in press), Corrected Proof, Available online 16 February 2007
    • (2007) Compute Oper Res (In Press)
    • Essafi, I.1    Mati, Y.2    Dauzère-Pérès, S.3
  • 24
    • 52749092841 scopus 로고    scopus 로고
    • Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm
    • Corrected Proof, Available online 10 January 2007
    • Shiau D-F, Cheng S-C, Huang Y-M (2007) Proportionate flexible flow shop scheduling via a hybrid constructive genetic algorithm. Exp Sys Appl (in press), Corrected Proof, Available online 10 January 2007
    • (2007) Exp Sys Appl (In Press)
    • Shiau, D.-F.1    Cheng, S.-C.2    Huang, Y.-M.3
  • 25
    • 70349390484 scopus 로고    scopus 로고
    • A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming
    • Corrected Proof, Available online 26 December 2006
    • Martin CH (2006) A hybrid genetic algorithm/mathematical programming approach to the multi-family flowshop scheduling problem with lot streaming. Omega (in press), Corrected Proof, Available online 26 December 2006
    • (2006) Omega (In Press)
    • Martin, C.H.1
  • 26
    • 51949084003 scopus 로고    scopus 로고
    • Evolutionary algorithms for scheduling m-machine flow shop with lot streaming
    • (in press) Corrected Proof, Available online 20 October 2006
    • Marimuthu S, Ponnambalam SG, Jawaha N (2006) Evolutionary algorithms for scheduling m-machine flow shop with lot streaming. Robot Compute Int Manuf, (in press), Corrected Proof, Available online 20 October 2006
    • (2006) Robot Compute Int Manuf
    • Marimuthu, S.1    Ponnambalam, S.G.2    Jawaha, N.3
  • 27
    • 43549094319 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem
    • In Press Corrected Proof, Available online 12 October 2006
    • Chen J-S, Pan J C-H, Lin C-M (2006) A hybrid genetic algorithm for the re-entrant flow-shop scheduling problem. Expert Systems with Applications, In Press, Corrected Proof, Available online 12 October 2006
    • (2006) Expert Systems with Applications
    • Chen, J.-S.1    Pan, J.C.-H.2    Lin, C.-M.3
  • 28
    • 33745846840 scopus 로고    scopus 로고
    • A case-injected genetic algorithm for single-machine scheduling problems with release time
    • 2
    • P-C Chang J-C Hsieh C-H Liu 2006 A case-injected genetic algorithm for single-machine scheduling problems with release time Int J Prod Econ 103 2 551 564
    • (2006) Int J Prod Econ , vol.103 , pp. 551-564
    • Chang, P.-C.1    Hsieh, J.-C.2    Liu, C.-H.3
  • 29
    • 33745817107 scopus 로고    scopus 로고
    • Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms
    • 2
    • P Damodaran PK Manjeshwar K Srihari 2006 Minimizing makespan on a batch-processing machine with non-identical job sizes using genetic algorithms Int J Prod Econ 103 2 882 891
    • (2006) Int J Prod Econ , vol.103 , pp. 882-891
    • Damodaran, P.1    Manjeshwar, P.K.2    Srihari, K.3
  • 30
    • 33746855485 scopus 로고    scopus 로고
    • Solving distributed FMS scheduling problems subject to maintenance: Genetic algorithms approach
    • 5-6
    • FTS Chan SH Chung LY Chan G Finke MK Tiwari 2006 Solving distributed FMS scheduling problems subject to maintenance: genetic algorithms approach Robot Comput-Integr Manuf 22 5-6 493 504
    • (2006) Robot Comput-Integr Manuf , vol.22 , pp. 493-504
    • Chan, F.T.S.1    Chung, S.H.2    Chan, L.Y.3    Finke, G.4    Tiwari, M.K.5
  • 31
    • 52749094565 scopus 로고    scopus 로고
    • Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines
    • (in press), Corrected Proof, Available online 22 September 2006
    • Jenabi M, Fatemi Ghomi SMT, Torabi SA, Karimi B (2006) Two hybrid meta-heuristics for the finite horizon ELSP in flexible flow lines with unrelated parallel machines. Appl Math Computat, (in press), Corrected Proof, Available online 22 September 2006
    • (2006) Appl Math Computat
    • Jenabi, M.1    Fatemi Ghomi, S.M.T.2    Torabi, S.A.3    Karimi, B.4
  • 32
    • 52749093118 scopus 로고    scopus 로고
    • A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes
    • (in press), Corrected Proof, Available online 17 August 2006
    • Kashan AH, Karimi B, Jenabi M (2006) A hybrid genetic heuristic for scheduling parallel batch processing machines with arbitrary job sizes. Compute Oper Res, (in press), Corrected Proof, Available online 17 August 2006
    • (2006) Compute Oper Res
    • Kashan, A.H.1    Karimi, B.2    Jenabi, M.3
  • 33
    • 33646106327 scopus 로고    scopus 로고
    • A genetic algorithm for solving a fuzzy economic lot-size scheduling problem
    • 2
    • P-T Chang M-J Yao S-F Huang C-T Chen 2006 A genetic algorithm for solving a fuzzy economic lot-size scheduling problem Int J Prod Econ 102 2 265 288
    • (2006) Int J Prod Econ , vol.102 , pp. 265-288
    • Chang, P.-T.1    Yao, M.-J.2    Huang, S.-F.3    Chen, C.-T.4
  • 34
    • 33644772056 scopus 로고    scopus 로고
    • Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems
    • 4
    • L Min W Cheng 2006 Genetic algorithms for the optimal common due date assignment and the optimal scheduling policy in parallel machine earliness/tardiness scheduling problems Robot Comput-Integr Manuf 22 4 279 287
    • (2006) Robot Comput-Integr Manuf , vol.22 , pp. 279-287
    • Min, L.1    Cheng, W.2
  • 35
    • 52749085453 scopus 로고    scopus 로고
    • Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems
    • (in press), Corrected Proof, Available online 13 July 2006
    • Chang P-C, Chen S-H, Liu C-H (2006) Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems. Expert Sys Appl, (in press), Corrected Proof, Available online 13 July 2006
    • (2006) Expert Sys Appl
    • Chang, P.-C.1    Chen, S.-H.2    Liu, C.-H.3
  • 36
    • 33747786647 scopus 로고    scopus 로고
    • Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry
    • 3
    • ZX Guo WK Wong SYS Leung JT Fan SF Chan 2006 Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: a case study based on the apparel industry Comput Ind Eng 50 3 202 219
    • (2006) Comput Ind Eng , vol.50 , pp. 202-219
    • Guo, Z.X.1    Wong, W.K.2    Leung, S.Y.S.3    Fan, J.T.4    Chan, S.F.5
  • 37
    • 32544433960 scopus 로고    scopus 로고
    • Learning-based multi-pass adaptive scheduling for a dynamic manufacturing cell environment
    • 3
    • Y-R Shiue R-S Guh 2006 Learning-based multi-pass adaptive scheduling for a dynamic manufacturing cell environment Robot Comput-Integr Manuf 22 3 203 216
    • (2006) Robot Comput-Integr Manuf , vol.22 , pp. 203-216
    • Shiue, Y.-R.1    Guh, R.-S.2
  • 38
    • 27144540137 scopus 로고    scopus 로고
    • A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility
    • 3
    • R Ruiz C Maroto 2006 A genetic algorithm for hybrid flowshops with sequence dependent setup times and machine eligibility Eur J Oper Res 169 3 781 800
    • (2006) Eur J Oper Res , vol.169 , pp. 781-800
    • Ruiz, R.1    Maroto, C.2
  • 39
    • 13544269251 scopus 로고    scopus 로고
    • A hybrid genetic algorithm for the job shop scheduling problem
    • 1
    • JF Gonçalves J José de Magalhães Mendes MGC Resende 2005 A hybrid genetic algorithm for the job shop scheduling problem Eur J Oper Res 167 1 77 95
    • (2005) Eur J Oper Res , vol.167 , pp. 77-95
    • Gonçalves, J.F.1    De M.M.J.José2    Resende, M.G.C.3
  • 41
    • 0039376196 scopus 로고
    • Spreadsheet modeling as a stepping stone
    • SE Bodily 1986 Spreadsheet modeling as a stepping stone Interfaces 16 34 52
    • (1986) Interfaces , vol.16 , pp. 34-52
    • Bodily, S.E.1
  • 42
    • 0039552748 scopus 로고
    • Closing the loop in manufacturing resource planning systems?
    • Burcher P (1991) Closing the loop in manufacturing resource planning systems? BIPCS Control 35-39
    • (1991) BIPCS Control , vol.35-39
    • Burcher, P.1
  • 43
    • 52749096700 scopus 로고
    • Axcelis, Inc., Seattle, WA, USA
    • Evolver User's Guide (1994) Axcelis, Inc., Seattle, WA, USA
    • (1994) Evolver User's Guide
  • 46
    • 31744439035 scopus 로고    scopus 로고
    • An ant-colony optimization algorithm for minimizing the completion time variance of jobs in flowshops
    • Y Gajpal C Rajendran 2006 An ant-colony optimization algorithm for minimizing the completion time variance of jobs in flowshops Int J Prod Econ 101 259 272
    • (2006) Int J Prod Econ , vol.101 , pp. 259-272
    • Gajpal, Y.1    Rajendran, C.2


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