메뉴 건너뛰기




Volumn 145, Issue 2, 2013, Pages 599-612

Bi-criteria group scheduling in hybrid flowshops

Author keywords

Bi criteria objective function; Group scheduling; Hybrid flowshop; Mixed integer linear programming; Sequence dependent setup times; Tabu search

Indexed keywords

GROUP SCHEDULING; HYBRID FLOW SHOP; MIXED INTEGER LINEAR PROGRAMMING; OBJECTIVE FUNCTIONS; SEQUENCE-DEPENDENT SETUP TIME;

EID: 84883445551     PISSN: 09255273     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ijpe.2013.05.015     Document Type: Article
Times cited : (36)

References (51)
  • 2
    • 0032114780 scopus 로고    scopus 로고
    • Composite heuristic for the single machine early/tardy job scheduling problem
    • M. Almeida, and M. Centeno Composite heuristic for the single machine early/tardy job scheduling problem Computers and Operations Research 25 1998 625 635
    • (1998) Computers and Operations Research , vol.25 , pp. 625-635
    • Almeida, M.1    Centeno, M.2
  • 3
    • 79958042273 scopus 로고    scopus 로고
    • Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min-max technique
    • J. Behnamian, M. Zandieh, and S. Fatemi Ghomi Bi-objective parallel machines scheduling with sequence-dependent setup times using hybrid metaheuristics and weighted min-max technique Soft Computing 15 2011 1313 1331
    • (2011) Soft Computing , vol.15 , pp. 1313-1331
    • Behnamian, J.1    Zandieh, M.2    Fatemi Ghomi, S.3
  • 5
    • 84859210627 scopus 로고    scopus 로고
    • Sequence-dependent group scheduling problem on unrelated-parallel machines
    • M.A. Bozorgirad, and R. Logendran Sequence-dependent group scheduling problem on unrelated-parallel machines Expert Systems with Applications 39 10 2012 9021 9030 〈10.1016/j.eswa.2012.02.032〉
    • (2012) Expert Systems with Applications , vol.39 , Issue.10 , pp. 9021-9030
    • Bozorgirad, M.A.1    Logendran, R.2
  • 6
    • 0002957133 scopus 로고    scopus 로고
    • A review of machine scheduling: Complexity, algorithms and approximability
    • D.-Z. Du, M. Pardalos, (Eds.) Kluwer Dordrecht
    • B. Chen, C. Potts, and G. Woeginger A review of machine scheduling: complexity, algorithms and approximability D.-Z. Du, M. Pardalos, Handbook of Combinatorial Optimization (Eds.) 1998 Kluwer Dordrecht 21 169
    • (1998) Handbook of Combinatorial Optimization , pp. 21-169
    • Chen, B.1    Potts, C.2    Woeginger, G.3
  • 7
    • 37349113923 scopus 로고    scopus 로고
    • Hybrid tabu search for re-entrant permutation flow-shop scheduling problem
    • J. Chen, J. Pan, and C. Wu Hybrid tabu search for re-entrant permutation flow-shop scheduling problem Expert Systems with Applications 34 2008 1924 1930
    • (2008) Expert Systems with Applications , vol.34 , pp. 1924-1930
    • Chen, J.1    Pan, J.2    Wu, C.3
  • 10
    • 84883461233 scopus 로고
    • Oakdale Engineering
    • DATAFIT 7.1.44, 1995. Oakdale Engineering.
    • (1995) DATAFIT 7.1.44
  • 11
    • 70350572217 scopus 로고    scopus 로고
    • New multi-objective method to solve reentrant hybrid flow shop scheduling problem
    • F. Dugardin, F. Yalaoui, and L. Amodeo New multi-objective method to solve reentrant hybrid flow shop scheduling problem European Journal of Operational Research 203 2010 22 31
    • (2010) European Journal of Operational Research , vol.203 , pp. 22-31
    • Dugardin, F.1    Yalaoui, F.2    Amodeo, L.3
  • 13
    • 77952424614 scopus 로고    scopus 로고
    • Group-scheduling problems in electronics manufacturing
    • C. Gelogullari, and R. Logendran Group-scheduling problems in electronics manufacturing Journal of Scheduling 13 2010 177 202
    • (2010) Journal of Scheduling , vol.13 , pp. 177-202
    • Gelogullari, C.1    Logendran, R.2
  • 14
    • 30044448688 scopus 로고    scopus 로고
    • A column generation algorithm for the carryover sequence dependent setups group scheduling problems
    • Gelogullari, C., Logendran, R., 2004. A column generation algorithm for the carryover sequence dependent setups group scheduling problems. In: Proceedings of the IIE Annual Conference and Exhibition, pp. 1775-1780.
    • (2004) Proceedings of the IIE Annual Conference and Exhibition , pp. 1775-1780
    • Gelogullari, C.1    Logendran, R.2
  • 15
    • 0022865373 scopus 로고
    • Future paths for integer programming and links to artificial intelligence
    • F. Glover Future paths for integer programming and links to artificial intelligence Computers and Operations Research 13 1986 533 549
    • (1986) Computers and Operations Research , vol.13 , pp. 533-549
    • Glover, F.1
  • 17
    • 84947908265 scopus 로고    scopus 로고
    • Minimizing total completion time in a two-machine flowshop: Analysis of special cases
    • Hoogeveen, J., Kawaguchi, T., 1996. Minimizing total completion time in a two-machine flowshop: analysis of special cases. In: Proceedings of the 5th IPCO Conference, pp. 374-388.
    • (1996) Proceedings of the 5th IPCO Conference , pp. 374-388
    • Hoogeveen, J.1    Kawaguchi, T.2
  • 20
    • 77549083772 scopus 로고    scopus 로고
    • Bi-objective group scheduling in hybrid flexible flowshop: A multi-phase approach
    • N. Karimi, M. Zandieh, and H. Karamooz Bi-objective group scheduling in hybrid flexible flowshop: a multi-phase approach Expert Systems with Applications 37 2010 4024 4032
    • (2010) Expert Systems with Applications , vol.37 , pp. 4024-4032
    • Karimi, N.1    Zandieh, M.2    Karamooz, H.3
  • 21
    • 0036609211 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with setup times using simulated annealing
    • D. Kim, K. Kim, W. Jang, and F. Chen Unrelated parallel machine scheduling with setup times using simulated annealing Robotics and Computer-Integrated Manufacturing 18 2002 223 231
    • (2002) Robotics and Computer-Integrated Manufacturing , vol.18 , pp. 223-231
    • Kim, D.1    Kim, K.2    Jang, W.3    Chen, F.4
  • 22
    • 2942674864 scopus 로고    scopus 로고
    • Scheduling flexible flow lines with sequence-dependent setup times
    • M. Kurz, and R. Askin Scheduling flexible flow lines with sequence-dependent setup times European Journal of Operational Research 159 2004 66 82
    • (2004) European Journal of Operational Research , vol.159 , pp. 66-82
    • Kurz, M.1    Askin, R.2
  • 23
    • 77955281012 scopus 로고    scopus 로고
    • An ant colony optimization meta-heuristic for machine - Part cell formation problems
    • X. Li, M. Baki, and Y. Aneja An ant colony optimization meta-heuristic for machine - part cell formation problems Computers and Operations Research 37 2010 2071 2081
    • (2010) Computers and Operations Research , vol.37 , pp. 2071-2081
    • Li, X.1    Baki, M.2    Aneja, Y.3
  • 24
    • 0033165933 scopus 로고    scopus 로고
    • A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem
    • C. Liaw A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem Computers and Operations Research 26 1999 679 693
    • (1999) Computers and Operations Research , vol.26 , pp. 679-693
    • Liaw, C.1
  • 25
    • 0042311378 scopus 로고    scopus 로고
    • Scheduling unrelated parallel machines to minimize total weighted tardiness
    • C. Liaw, Y. Lin, C. Cheng, and M. Chen Scheduling unrelated parallel machines to minimize total weighted tardiness Computers and Operations Research 30 2003 1777 1789
    • (2003) Computers and Operations Research , vol.30 , pp. 1777-1789
    • Liaw, C.1    Lin, Y.2    Cheng, C.3    Chen, M.4
  • 26
    • 78549251688 scopus 로고    scopus 로고
    • Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems
    • Y. Lin, M. Pfund, and J. Fowler Heuristics for minimizing regular performance measures in unrelated parallel machine scheduling problems Computers and Operations Research 38 2011 901 916
    • (2011) Computers and Operations Research , vol.38 , pp. 901-916
    • Lin, Y.1    Pfund, M.2    Fowler, J.3
  • 27
    • 1642328443 scopus 로고    scopus 로고
    • Unrelated parallel machine scheduling with job splitting
    • R. Logendran, and F. Subur Unrelated parallel machine scheduling with job splitting IIE Transaction 36 2004 259 372
    • (2004) IIE Transaction , vol.36 , pp. 259-372
    • Logendran, R.1    Subur, F.2
  • 30
    • 34047130624 scopus 로고    scopus 로고
    • Scheduling unrelated parallel machines with sequence-dependent setups
    • R. Logendran, B. McDonell, and B. Smucker Scheduling unrelated parallel machines with sequence-dependent setups Computers & Operations Research 34 2007 3420 3438
    • (2007) Computers & Operations Research , vol.34 , pp. 3420-3438
    • Logendran, R.1    McDonell, B.2    Smucker, B.3
  • 34
    • 0032093565 scopus 로고    scopus 로고
    • Single machine group scheduling to minimize mean flow time subject to due date constraints
    • J. Pan, and C. Wu Single machine group scheduling to minimize mean flow time subject to due date constraints Production Planning and Control 9 1998 366 370
    • (1998) Production Planning and Control , vol.9 , pp. 366-370
    • Pan, J.1    Wu, C.2
  • 35
    • 0020205577 scopus 로고
    • A decomposition algorithm for the single machine total tardiness problem
    • C. Potts, and L. Van Wassenhove A decomposition algorithm for the single machine total tardiness problem Operations Research Letters 1 1982 177 181
    • (1982) Operations Research Letters , vol.1 , pp. 177-181
    • Potts, C.1    Van Wassenhove, L.2
  • 36
    • 84883454503 scopus 로고    scopus 로고
    • R 2.13.0., 2011. The R Foundation for Statistical Computing
    • R 2.13.0., 2011. The R Foundation for Statistical Computing.
  • 37
    • 0028542281 scopus 로고
    • Group scheduling jobs on a single machine: A multi-objective approach with preemptive priority structure
    • S. Rana, and N. Singh Group scheduling jobs on a single machine: a multi-objective approach with preemptive priority structure European Journal of Operational Research 79 1994 38 50
    • (1994) European Journal of Operational Research , vol.79 , pp. 38-50
    • Rana, S.1    Singh, N.2
  • 40
    • 68249091110 scopus 로고    scopus 로고
    • Total flow time minimization in a flowshop sequence-dependent group scheduling problem
    • N. Salmasi, R. Logendran, and M. Skandari Total flow time minimization in a flowshop sequence-dependent group scheduling problem Computers and Operations Research 37 2010 199 212
    • (2010) Computers and Operations Research , vol.37 , pp. 199-212
    • Salmasi, N.1    Logendran, R.2    Skandari, M.3
  • 41
    • 0033720051 scopus 로고    scopus 로고
    • Scheduling a flowline manufacturing cell with sequence dependent family setup times
    • J. Schaller, J. Gupta, and A. Vakharia Scheduling a flowline manufacturing cell with sequence dependent family setup times European Journal of Operational Research 125 2000 324 339
    • (2000) European Journal of Operational Research , vol.125 , pp. 324-339
    • Schaller, J.1    Gupta, J.2    Vakharia, A.3
  • 42
    • 84864859523 scopus 로고    scopus 로고
    • An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems
    • O. Shahvari, N. Salmasi, R. Logendran, and B. Abbasi An efficient tabu search algorithm for flexible flow shop sequence-dependent group scheduling problems International Journal of Production Research 50 15 2012 4237 4254 〈 10.1080/00207543.2011.604051〉 〉
    • (2012) International Journal of Production Research , vol.50 , Issue.15 , pp. 4237-4254
    • Shahvari, O.1    Salmasi, N.2    Logendran, R.3    Abbasi, B.4
  • 44
    • 0032628094 scopus 로고    scopus 로고
    • Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness
    • X. Sun, J. Noble, and C. Klein Single-machine scheduling with sequence dependent setup to minimize total weighted squared tardiness IIE Transactions 31 1999 113 124
    • (1999) IIE Transactions , vol.31 , pp. 113-124
    • Sun, X.1    Noble, J.2    Klein, C.3
  • 45
    • 70449526276 scopus 로고    scopus 로고
    • Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system
    • R. Tavakkoli-Moghaddam, N. Javadian, A. Khorrami, and Y. Gholipour-Kanani Design of a scatter search method for a novel multi-criteria group scheduling problem in a cellular manufacturing system Expert Systems with Applications 37 2010 2661 2669
    • (2010) Expert Systems with Applications , vol.37 , pp. 2661-2669
    • Tavakkoli-Moghaddam, R.1    Javadian, N.2    Khorrami, A.3    Gholipour-Kanani, Y.4
  • 46
    • 34548237317 scopus 로고    scopus 로고
    • A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness
    • R. Tavakkoli-Moghaddam, A. Rahimi-Vahed, and A. Hossein Mirzaei A hybrid multi-objective immune algorithm for a flow shop scheduling problem with bi-objectives: Weighted mean completion time and weighted mean tardiness Information Sciences 177 2007 5072 5090
    • (2007) Information Sciences , vol.177 , pp. 5072-5090
    • Tavakkoli-Moghaddam, R.1    Rahimi-Vahed, A.2    Hossein Mirzaei, A.3
  • 47
    • 0032592171 scopus 로고    scopus 로고
    • Scheduling grouped jobs on single machine with genetic algorithm
    • D. Wang, M. Gen, and R. Cheng Scheduling grouped jobs on single machine with genetic algorithm Computers and Industrial Engineering 36 1999 309 324
    • (1999) Computers and Industrial Engineering , vol.36 , pp. 309-324
    • Wang, D.1    Gen, M.2    Cheng, R.3
  • 48
    • 53749093099 scopus 로고    scopus 로고
    • A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers
    • X. Wang, and L. Tang A tabu search heuristic for the hybrid flowshop scheduling with finite intermediate buffers Computers and Operations Research 36 2009 907 918
    • (2009) Computers and Operations Research , vol.36 , pp. 907-918
    • Wang, X.1    Tang, L.2
  • 49
    • 0029338650 scopus 로고
    • Scheduling groups of jobs on a single machine
    • S. Webster, and K. Baker Scheduling groups of jobs on a single machine Operations Research 43 1995 692 703
    • (1995) Operations Research , vol.43 , pp. 692-703
    • Webster, S.1    Baker, K.2
  • 50
    • 1642397400 scopus 로고    scopus 로고
    • Optimal scheduling of two-componenet products on a single facility
    • W. Yang Optimal scheduling of two-componenet products on a single facility International Journal of System Science 35 2004 49 53
    • (2004) International Journal of System Science , vol.35 , pp. 49-53
    • Yang, W.1
  • 51
    • 84855508353 scopus 로고    scopus 로고
    • An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid exible owshop with sequence-dependent setup times
    • M. Zandieh, and N. Karimi An adaptive multi-population genetic algorithm to solve the multi-objective group scheduling problem in hybrid exible owshop with sequence-dependent setup times Journal of Intelligent Manufacturing 22 2011 979 989
    • (2011) Journal of Intelligent Manufacturing , vol.22 , pp. 979-989
    • Zandieh, M.1    Karimi, N.2


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