메뉴 건너뛰기




Volumn 217, Issue 21, 2011, Pages 8248-8263

Bounding strategies for the hybrid flow shop scheduling problem

Author keywords

Heuristics; Hybrid flow shop; Lower bounds; Scheduling

Indexed keywords

BOUNDING PROCEDURES; CENTER-BASED; COMPUTATIONAL EXPERIMENT; HEURISTICS; HYBRID FLOW SHOP; HYBRID FLOW SHOP SCHEDULING; LOWER AND UPPER BOUNDS; LOWER BOUNDS; PARALLEL MACHINE PROBLEMS;

EID: 79956080278     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.amc.2011.02.108     Document Type: Article
Times cited : (22)

References (25)
  • 2
    • 0023364612 scopus 로고
    • Scheduling jobs with release dates and tails on identical machines to minimize makespan
    • DOI 10.1016/0377-2217(87)90243-8
    • J. Carlier Scheduling jobs with release dates and tails on identical machines to minimize makespan European Journal of Operational Research 29 3 1987 298 306 (Pubitemid 17598422)
    • (1987) European Journal of Operational Research , vol.29 , Issue.3 , pp. 298-306
    • Carlier Jacques1
  • 3
    • 0042857495 scopus 로고    scopus 로고
    • Exact method for solving the Multi-Processor Flow-Shop
    • J. Carlier, and E. Néron An exact method for solving the multi-processor flow-shop RAIRO Operations Research 34 2000 1 25 (Pubitemid 30556760)
    • (2000) RAIRO Recherche Operationnelle , vol.34 , Issue.1 , pp. 1-25
    • Carlier, J.1    Neron, E.2
  • 5
    • 0347649432 scopus 로고    scopus 로고
    • Minimizing makespan on parallel machines subject to release dates and delivery times
    • A. Gharbi, and M. Haouari Minimizing makespan on parallel machines subject to release dates and delivery times Journal of Scheduling 5 2002 329 355
    • (2002) Journal of Scheduling , vol.5 , pp. 329-355
    • Gharbi, A.1    Haouari, M.2
  • 6
    • 15344340708 scopus 로고    scopus 로고
    • Optimal parallel machines scheduling with availability constraints
    • DOI 10.1016/j.dam.2004.12.003, PII S0166218X04004007
    • A. Gharbi, and M. Haouari Optimal parallel machines scheduling with availability constraints Discrete Applied Mathematics 148 2005 63 87 (Pubitemid 40391287)
    • (2005) Discrete Applied Mathematics , vol.148 , Issue.1 , pp. 63-87
    • Gharbi, A.1    Haouari, M.2
  • 7
    • 33748319310 scopus 로고    scopus 로고
    • An approximate decomposition algorithm for scheduling on parallel machines with heads and tails
    • DOI 10.1016/j.cor.2005.05.012, PII S0305054805001620
    • A. Gharbi, and M. Haouari An approximate decomposition algorithm for scheduling on parallel machines with heads and tails Computers and Operations Research 34 2007 868 883 (Pubitemid 44332703)
    • (2007) Computers and Operations Research , vol.34 , Issue.3 , pp. 868-883
    • Gharbi, A.1    Haouari, M.2
  • 10
    • 49549121827 scopus 로고    scopus 로고
    • Energetic reasoning revisited: Application to parallel machine scheduling
    • L. Hidri, A. Gharbi, and M. Haouari Energetic reasoning revisited: application to parallel machine scheduling Journal of Scheduling 11 2008 239 252
    • (2008) Journal of Scheduling , vol.11 , pp. 239-252
    • Hidri, L.1    Gharbi, A.2    Haouari, M.3
  • 11
    • 0043043661 scopus 로고    scopus 로고
    • Preemptive scheduling in a two-stage multiprocessor flow shop is NP-hard
    • J.A. Hoogeveen, J.K. Lenstra, and B. Veltman Preemptive scheduling in a two-stage multiprocessor flow shop is NP-Hard European Journal of Operational Research 89 1996 172 175 (Pubitemid 126386771)
    • (1996) European Journal of Operational Research , vol.89 , Issue.1-2 , pp. 172-175
    • Hoogeveen, J.A.1    Lenstra, J.K.2    Veltman, B.3
  • 13
    • 12244249206 scopus 로고    scopus 로고
    • A review of exact solution methods for the non-preemptive multiprocessor flowshop problem
    • DOI 10.1016/j.ejor.2003.12.026, PII S0377221704001043
    • T. Kis, and E. Pesch A review of exact solution methods for the non-preemptive multiprocessor flowshop problem European Journal of Operational Research 164 3 2005 592 608 (Pubitemid 40114584)
    • (2005) European Journal of Operational Research , vol.164 , Issue.3 SPEC. ISS. , pp. 592-608
    • Kis, T.1    Pesch, E.2
  • 17
    • 18044399490 scopus 로고    scopus 로고
    • Solving hybrid flow shop problem using energetic reasoning and global operations
    • DOI 10.1016/S0305-0483(01)00040-8, PII S0305048301000408
    • E. Néron, Ph. Baptiste, and J.N.D. Gupta Solving hybrid flow shop problem using the energetic reasoning and global operations Omega 29 2001 501 511 (Pubitemid 33628766)
    • (2001) Omega , vol.29 , Issue.6 , pp. 501-511
    • Neron, E.1    Baptiste, P.2    Gupta, J.N.D.3
  • 18
    • 73449099561 scopus 로고    scopus 로고
    • Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective
    • I. Ribas, R. Leisten, and J.M. Framinan Review and classification of hybrid flow shop scheduling problems from a production system and a solutions procedure perspective Computers and Operations Research 37 2010 1439 1454
    • (2010) Computers and Operations Research , vol.37 , pp. 1439-1454
    • Ribas, I.1    Leisten, R.2    Framinan, J.M.3
  • 21
    • 0343963100 scopus 로고    scopus 로고
    • Scheduling with limited machine availability
    • DOI 10.1016/S0377-2217(98)00367-1
    • G. Schmidt Scheduling with limited machine availability European Journal of Operational Research 121 2000 1 15 (Pubitemid 30546340)
    • (2000) European Journal of Operational Research , vol.121 , Issue.1 , pp. 1-15
    • Schmidt, G.1
  • 23
    • 25144447685 scopus 로고    scopus 로고
    • Lower bounds for the head-body-tail problem on parallel machines: A computational study of the multiprocessor flow shop
    • DOI 10.1287/ijoc.1040.0082
    • A. Vandevelde, H. Hoogeveen, C. Hurkens, and J.K. Lenstra Lower bounds for the head-body-tail problem on parallel machines: a computational study of the multiprocessor flow shop INFORMS Journal on Computing 17 2005 305 320 (Pubitemid 41342311)
    • (2005) INFORMS Journal on Computing , vol.17 , Issue.3 , pp. 305-320
    • Vandevelde, A.1    Hoogeveen, H.2    Hurkens, C.3    Lenstra, J.K.4
  • 24
    • 0033284730 scopus 로고    scopus 로고
    • Les problemes d'ordonnancement de type flow-shop hybride: Etat de l'art
    • DOI 10.1051/ro:1999108
    • A. Vignier, J.-C. Billaut, and C. Proust Les problmes d'ordonnancement de type flow-shop hybride: Etat de l'art RAIRO Recherche Opérationnelle 33 2 1999 117 183 (Pubitemid 32082126)
    • (1999) RAIRO Recherche Operationnelle , vol.33 , Issue.2 , pp. 117-183
    • Vignier, A.1    Billaut, J.-C.2    Proust, C.3


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