메뉴 건너뛰기




Volumn 281, Issue , 2011, Pages 5-19

Multi-objective variable neighborhood search algorithms for a single machine scheduling problem with distinct due windows

Author keywords

job scheduling; local search heuristics; Multi objective optimization

Indexed keywords

COMPUTATIONAL RESULTS; DUE-WINDOW; IMPROVE-A; JOB SCHEDULING; LOCAL SEARCH HEURISTICS; MULTI OBJECTIVE; MULTI OBJECTIVE ALGORITHM; SEQUENCE-DEPENDENT SETUP TIME; SINGLE MACHINE SCHEDULING PROBLEMS; SOLUTION QUALITY; TOTAL FLOWTIME; VARIABLE NEIGHBORHOOD SEARCH; WEIGHTED EARLINESS;

EID: 84855280955     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2011.11.022     Document Type: Conference Paper
Times cited : (54)

References (30)
  • 1
    • 36849082395 scopus 로고    scopus 로고
    • A survey of scheduling problems with setup times or costs
    • DOI 10.1016/j.ejor.2006.06.060, PII S0377221706008174
    • A. Allahverdi, C.T. Ng, T.C.E. Cheng, and M.Y. Kovalyov A survey of scheduling problems with setup times or costs Eur. Jour. of Operational Research 187 2008 985 1032 (Pubitemid 350236619)
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 985-1032
    • Allahverdi, A.1    Ng, C.T.2    Cheng, T.C.E.3    Kovalyov, M.Y.4
  • 2
    • 38749083109 scopus 로고    scopus 로고
    • A GRASP algorithm for the multi-criteria minimum spanning tree problem
    • J.E.C. Arroyo, P.S. Vieira, and D.S. Vianna A GRASP algorithm for the multi-criteria minimum spanning tree problem Annals of Operations Research 159 2008 125 133
    • (2008) Annals of Operations Research , vol.159 , pp. 125-133
    • Arroyo, J.E.C.1    Vieira, P.S.2    Vianna, D.S.3
  • 3
    • 0025211593 scopus 로고
    • Sequencing with earliness and tardiness penalties: A review
    • K.R. Baker, and G.D. Scudder Sequencing with earliness and tardiness penalties: a review Operations Research 38 1990 22 36
    • (1990) Operations Research , vol.38 , pp. 22-36
    • Baker, K.R.1    Scudder, G.D.2
  • 4
    • 33645218963 scopus 로고    scopus 로고
    • Minimizing total flow time in the single-machine scheduling problem with periodic maintenance
    • W.J. Chen Minimizing total flow time in the single-machine scheduling problem with periodic maintenance Jour. of the Operational Research Society 57 2005 410 415
    • (2005) Jour. of the Operational Research Society , vol.57 , pp. 410-415
    • Chen, W.J.1
  • 5
    • 85018104842 scopus 로고    scopus 로고
    • Pareto Simulated Annealing - a Metaheuristic Technique for Multiple-Objective Combinatorial Optimization
    • DOI 10.1002/(SICI)1099-1360(199801)7:1<34::AID-MCDA161>3.0.CO;2-6
    • P. Czyzak, and A. Jaszkiewicz Pareto simulated annealing - a metaheuristic technique for multiple objective optimization J Multi-Crit Decis Making 7 1998 34 47 (Pubitemid 128016907)
    • (1998) Journal of multi-criteria decision analysis , vol.7 , Issue.1 , pp. 34-47
    • Czyzak, P.1    Jaszkiewicz, A.2
  • 6
    • 0000474126 scopus 로고
    • Minimizing total tardiness on one machine is NP-hard
    • J. Du, and J.Y.T. Leung Minimizing total tardiness on one machine is NP-hard Mathematics of Operations Research 15 1990 483 495
    • (1990) Mathematics of Operations Research , vol.15 , pp. 483-495
    • Du, J.1    Leung, J.Y.T.2
  • 7
    • 47849084195 scopus 로고    scopus 로고
    • A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
    • J.M. Framinan, and R. Leisten A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria OR Spectrum 30 2008 787 804
    • (2008) OR Spectrum , vol.30 , pp. 787-804
    • Framinan, J.M.1    Leisten, R.2
  • 8
  • 10
    • 12344307797 scopus 로고    scopus 로고
    • Variable Neighborhood Search
    • G.A Kochenberger, F. Glover, Kluwer Academic
    • P. Hansen, and N. Mladenovic Variable Neighborhood Search G.A Kochenberger, F. Glover, Handbook of metaheuristics 2003 Kluwer Academic 145 184
    • (2003) Handbook of Metaheuristics , pp. 145-184
    • Hansen, P.1    Mladenovic, N.2
  • 11
    • 3943054030 scopus 로고    scopus 로고
    • Minimizing earliness and tardiness penalties in a single-machine problem with a common due date
    • C.M. Hino, D.P. Ronconi, and A.B. Mendes Minimizing earliness and tardiness penalties in a single-machine problem with a common due date Eur. Jour. of Operational Research 160 2005 190 201
    • (2005) Eur. Jour. of Operational Research , vol.160 , pp. 190-201
    • Hino, C.M.1    Ronconi, D.P.2    Mendes, A.B.3
  • 12
    • 0038273913 scopus 로고    scopus 로고
    • Balance between genetic local search in memetic algorithms for multiobjective permutation flowshop scheduling
    • H. Ishibuchi, T. Yoshida, and T. Murata Balance between genetic local search in memetic algorithms for multiobjective permutation flowshop scheduling IEEE Trans Evol Comput 7 2003 204 223
    • (2003) IEEE Trans Evol Comput , vol.7 , pp. 204-223
    • Ishibuchi, H.1    Yoshida, T.2    Murata, T.3
  • 15
    • 28244442171 scopus 로고    scopus 로고
    • Minimizing the makespan in a single machine scheduling problem with a time-based learning effect
    • DOI 10.1016/j.ipl.2005.09.007, PII S0020019005002607
    • W.-H. Kuo, and D.-L. Yang Minimizing the makespan in a single machine scheduling problem with a time-based learning effect Information Processing Letters vol. 97 2006 64 67 (Pubitemid 41699775)
    • (2006) Information Processing Letters , vol.97 , Issue.2 , pp. 64-67
    • Kuo, W.-H.1    Yang, D.-L.2
  • 17
    • 0000902813 scopus 로고
    • A Genetic Algorithm for Job Sequencing Problems with Distinct Due Dates and General Early-Tardy Penalty Weights
    • C.Y. Lee, and Y.J. Choi A Genetic Algorithm for Job Sequencing Problems with Distinct Due Dates and General Early-Tardy Penalty Weights Computers & Operations Research 22 8 1995 857 869
    • (1995) Computers & Operations Research , vol.22 , Issue.8 , pp. 857-869
    • Lee, C.Y.1    Choi, Y.J.2
  • 19
    • 77952241821 scopus 로고    scopus 로고
    • Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm
    • Y.-C. Liang, and M.-H. Lo Multi-objective redundancy allocation optimization using a variable neighborhood search algorithm Jour. of Heuristics 16 2010 511 535
    • (2010) Jour. of Heuristics , vol.16 , pp. 511-535
    • Liang, Y.-C.1    Lo, M.-H.2
  • 20
    • 34248179019 scopus 로고    scopus 로고
    • A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date
    • DOI 10.1016/j.cie.2007.01.004, PII S0360835207000150
    • C.-J. Liao, and C.-Cg. Cheng A variable neighborhood search for minimizing single machine weighted earliness and tardiness with common due date Comp Ind Eng. 52 2007 404 413 (Pubitemid 46719704)
    • (2007) Computers and Industrial Engineering , vol.52 , Issue.4 , pp. 404-413
    • Liao, C.-J.1    Cheng, C.-C.2
  • 21
    • 33847618314 scopus 로고    scopus 로고
    • Minimizing total earliness and tardiness on a single machine using a hybrid heuristic
    • R. M Hallah Minimizing total earliness and tardiness on a single machine using a hybrid heuristic Computers & Operations Research 34 2007 3126 3142
    • (2007) Computers & Operations Research , vol.34 , pp. 3126-3142
    • Hallah, M.R.1
  • 23
    • 74849100605 scopus 로고    scopus 로고
    • An adaptive genetic algorithm for solving the single machine scheduling problem with earliness and tardiness penalties
    • San Antonio, USA
    • Ribeiro, F.F.; Souza, S.R. and Souza, M.J.F.; An adaptive genetic algorithm for solving the single machine scheduling problem with earliness and tardiness penalties, in: Proc. of the IEEE International Conference on Systems, Man, and Cybernetics. San Antonio, USA, (2009), 698-703.
    • (2009) Proc. of the IEEE International Conference on Systems, Man, and Cybernetics , pp. 698-703
    • Ribeiro, F.F.1    Souza, S.R.2    Souza, M.J.F.3
  • 25
    • 33750841084 scopus 로고    scopus 로고
    • A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
    • DOI 10.1016/j.ejor.2005.12.009, PII S0377221705008507
    • R. Ruiz, and T. Stützle A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem Eur. Jour. of Operational Research 177 2007 2033 2049 (Pubitemid 44712036)
    • (2007) European Journal of Operational Research , vol.177 , Issue.3 , pp. 2033-2049
    • Ruiz, R.1    Stutzle, T.2
  • 26
    • 37049022197 scopus 로고    scopus 로고
    • An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives
    • DOI 10.1016/j.ejor.2006.07.029, PII S0377221706008277
    • R. Ruiz, and T. Stützle An Iterated Greedy heuristic for the sequence dependent setup times flowshop problem with makespan and weighted tardiness objectives Eur. Jour. of Operational Research 187 2008 1143 1159 (Pubitemid 350245722)
    • (2008) European Journal of Operational Research , vol.187 , Issue.3 , pp. 1143-1159
    • Ruiz, R.1    Stutzle, T.2
  • 27
    • 0034196175 scopus 로고    scopus 로고
    • A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times
    • K.C. Tan, R. Narasimhan, P.A. Rubin, and G.L. Ragatz A comparison of four methods for minimizing total tardiness on a single processor with sequence dependent setup times OMEGA 28 2000 313 326
    • (2000) OMEGA , vol.28 , pp. 313-326
    • Tan, K.C.1    Narasimhan, R.2    Rubin, P.A.3    Ragatz, G.L.4
  • 28
    • 85067266862 scopus 로고    scopus 로고
    • Tabu Search for Single Machine Scheduling with Distinct Due windows and Weighted Earliness/Tardiness Penalties
    • G. Wang, and B.P. Yen Tabu Search for Single Machine Scheduling with Distinct Due windows and Weighted Earliness/Tardiness Penalties Eur. Jour. of Operational Research 142 2002 129 146
    • (2002) Eur. Jour. of Operational Research , vol.142 , pp. 129-146
    • Wang, G.1    Yen, B.P.2
  • 29
    • 74849094249 scopus 로고    scopus 로고
    • Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm
    • K.C. Ying Minimizing earliness-tardiness penalties for common due date single-machine scheduling problems by a recovering beam search algorithm Computers and Industrial Engineering 55 2008 494 502
    • (2008) Computers and Industrial Engineering , vol.55 , pp. 494-502
    • Ying, K.C.1


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