Flow shop scheduling with two batch processing machines and nonidentical job sizes View Full Text


Ontology type: schema:ScholarlyArticle     


Article Info

DATE

2009-11

AUTHORS

H. S. Mirsanei, B. Karimi, F. Jolai

ABSTRACT

A batch processing machine can process several jobs simultaneously. In this research, we consider the problem of a two-stage flow shop with two batch processing machines to minimize the makespan. We assume that the processing time of a batch is the longest processing time among all the jobs in that batch and the sizes of the jobs are nonidentical. There is a limitation on batch sizes and the sum of job sizes in a batch must be less than or equal to the machine capacity. Since this problem is strongly nondeterministic polynomial time hard, we propose two heuristic algorithms. The first one is knowledge-based and the other is based on the batch first fit heuristic proposed previously. To further enhance the solution quality, two different simulated annealing (SA) algorithms based on the two constructive heuristics is also developed. Since heuristic methods for this problem has not been proposed previously, a lower bound is developed for evaluating the performance of the proposed methods. Several test problems have been solved by SAs and lower bound method and the results are compared. Computational studies show that both algorithms provide good results but the first SA (ARSA) algorithm considerably outperforms the second one (FLSA). In addition, the results of ARSA algorithm, optimal solutions, and lower bounds are compared for several small problems. The comparisons show that except for one instance, the ARSA could find the optimal solutions and the proposed lower bound provides small gaps comparing with the optimal solutions. More... »

PAGES

553

References to SciGraph publications

  • 1984. Approximation Algorithms for Bin-Packing — An Updated Survey in ALGORITHM DESIGN FOR COMPUTER SYSTEM DESIGN
  • 2007-12. A joint GA+DP approach for single burn-in oven scheduling problems with makespan criterion in THE INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • 2005-01. Two-Machine Flowshop Batching and Scheduling in ANNALS OF OPERATIONS RESEARCH
  • 2006-07. A literature review, classification and simple meta-analysis on scheduling of batch processors in semiconductor in THE INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • 2004-10. A heuristic for a batch processing machine scheduled to minimise total completion time with non-identical job sizes in THE INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY
  • Identifiers

    URI

    http://scigraph.springernature.com/pub.10.1007/s00170-009-1986-y

    DOI

    http://dx.doi.org/10.1007/s00170-009-1986-y

    DIMENSIONS

    https://app.dimensions.ai/details/publication/pub.1049224610


    Indexing Status Check whether this publication has been indexed by Scopus and Web Of Science using the SN Indexing Status Tool
    Incoming Citations Browse incoming citations for this publication using opencitations.net

    JSON-LD is the canonical representation for SciGraph data.

    TIP: You can open this SciGraph record using an external JSON-LD service: JSON-LD Playground Google SDTT

    [
      {
        "@context": "https://springernature.github.io/scigraph/jsonld/sgcontext.json", 
        "about": [
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/0801", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Artificial Intelligence and Image Processing", 
            "type": "DefinedTerm"
          }, 
          {
            "id": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/08", 
            "inDefinedTermSet": "http://purl.org/au-research/vocabulary/anzsrc-for/2008/", 
            "name": "Information and Computing Sciences", 
            "type": "DefinedTerm"
          }
        ], 
        "author": [
          {
            "affiliation": {
              "alternateName": "Mazandaran University of Science and Technology", 
              "id": "https://www.grid.ac/institutes/grid.444712.0", 
              "name": [
                "Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Mirsanei", 
            "givenName": "H. S.", 
            "id": "sg:person.013256176555.72", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013256176555.72"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "Amirkabir University of Technology", 
              "id": "https://www.grid.ac/institutes/grid.411368.9", 
              "name": [
                "Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Karimi", 
            "givenName": "B.", 
            "id": "sg:person.012157602505.22", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012157602505.22"
            ], 
            "type": "Person"
          }, 
          {
            "affiliation": {
              "alternateName": "University of Tehran", 
              "id": "https://www.grid.ac/institutes/grid.46072.37", 
              "name": [
                "Department of Industrial Engineering, University of Tehran, Tehran, Iran"
              ], 
              "type": "Organization"
            }, 
            "familyName": "Jolai", 
            "givenName": "F.", 
            "id": "sg:person.010630670505.07", 
            "sameAs": [
              "https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010630670505.07"
            ], 
            "type": "Person"
          }
        ], 
        "citation": [
          {
            "id": "sg:pub.10.1007/s00170-003-1740-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000837418", 
              "https://doi.org/10.1007/s00170-003-1740-9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00170-003-1740-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1000837418", 
              "https://doi.org/10.1007/s00170-003-1740-9"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00170-006-0738-5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1004346192", 
              "https://doi.org/10.1007/s00170-006-0738-5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00170-006-0738-5", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1004346192", 
              "https://doi.org/10.1007/s00170-006-0738-5"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0305-0483(83)90088-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005417958"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/0305-0483(83)90088-9", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005417958"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00170-005-2585-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005525893", 
              "https://doi.org/10.1007/s00170-005-2585-1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s00170-005-2585-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005525893", 
              "https://doi.org/10.1007/s00170-005-2585-1"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0305-0548(00)00071-x", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1005877529"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0360-8352(02)00216-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009103310"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0925-5273(03)00092-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009769685"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0925-5273(03)00092-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1009769685"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0305-0548(99)00138-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012675220"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0895-7177(99)00085-0", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1012954044"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0377-2217(02)00352-1", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018156008"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0377-2217(99)00447-6", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1018599936"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1080/00207549408957026", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1019606803"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10479-004-5029-7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022306404", 
              "https://doi.org/10.1007/s10479-004-5029-7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/s10479-004-5029-7", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1022306404", 
              "https://doi.org/10.1007/s10479-004-5029-7"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.mcm.2005.01.005", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1033010984"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1080/00207540500525254", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1039595848"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/s0377-2217(99)00031-4", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044273859"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "sg:pub.10.1007/978-3-7091-4338-4_3", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1044943422", 
              "https://doi.org/10.1007/978-3-7091-4338-4_3"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1080/07408179808966485", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1047102265"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1016/j.cor.2005.05.028", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1053000696"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1287/ijoc.13.2.120.10521", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1064707035"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1287/mnsc.35.5.607", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1064720579"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1287/opre.40.4.750", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1064730474"
            ], 
            "type": "CreativeWork"
          }, 
          {
            "id": "https://doi.org/10.1287/opre.40.4.764", 
            "sameAs": [
              "https://app.dimensions.ai/details/publication/pub.1064730475"
            ], 
            "type": "CreativeWork"
          }
        ], 
        "datePublished": "2009-11", 
        "datePublishedReg": "2009-11-01", 
        "description": "A batch processing machine can process several jobs simultaneously. In this research, we consider the problem of a two-stage flow shop with two batch processing machines to minimize the makespan. We assume that the processing time of a batch is the longest processing time among all the jobs in that batch and the sizes of the jobs are nonidentical. There is a limitation on batch sizes and the sum of job sizes in a batch must be less than or equal to the machine capacity. Since this problem is strongly nondeterministic polynomial time hard, we propose two heuristic algorithms. The first one is knowledge-based and the other is based on the batch first fit heuristic proposed previously. To further enhance the solution quality, two different simulated annealing (SA) algorithms based on the two constructive heuristics is also developed. Since heuristic methods for this problem has not been proposed previously, a lower bound is developed for evaluating the performance of the proposed methods. Several test problems have been solved by SAs and lower bound method and the results are compared. Computational studies show that both algorithms provide good results but the first SA (ARSA) algorithm considerably outperforms the second one (FLSA). In addition, the results of ARSA algorithm, optimal solutions, and lower bounds are compared for several small problems. The comparisons show that except for one instance, the ARSA could find the optimal solutions and the proposed lower bound provides small gaps comparing with the optimal solutions.", 
        "genre": "research_article", 
        "id": "sg:pub.10.1007/s00170-009-1986-y", 
        "inLanguage": [
          "en"
        ], 
        "isAccessibleForFree": false, 
        "isPartOf": [
          {
            "id": "sg:journal.1043671", 
            "issn": [
              "0268-3768", 
              "1433-3015"
            ], 
            "name": "The International Journal of Advanced Manufacturing Technology", 
            "type": "Periodical"
          }, 
          {
            "issueNumber": "5-6", 
            "type": "PublicationIssue"
          }, 
          {
            "type": "PublicationVolume", 
            "volumeNumber": "45"
          }
        ], 
        "name": "Flow shop scheduling with two batch processing machines and nonidentical job sizes", 
        "pagination": "553", 
        "productId": [
          {
            "name": "readcube_id", 
            "type": "PropertyValue", 
            "value": [
              "ea7ecc621832ae6275b808e7e5b0694a7264d1c25ec6b864206e7242eb27d933"
            ]
          }, 
          {
            "name": "doi", 
            "type": "PropertyValue", 
            "value": [
              "10.1007/s00170-009-1986-y"
            ]
          }, 
          {
            "name": "dimensions_id", 
            "type": "PropertyValue", 
            "value": [
              "pub.1049224610"
            ]
          }
        ], 
        "sameAs": [
          "https://doi.org/10.1007/s00170-009-1986-y", 
          "https://app.dimensions.ai/details/publication/pub.1049224610"
        ], 
        "sdDataset": "articles", 
        "sdDatePublished": "2019-04-11T14:33", 
        "sdLicense": "https://scigraph.springernature.com/explorer/license/", 
        "sdPublisher": {
          "name": "Springer Nature - SN SciGraph project", 
          "type": "Organization"
        }, 
        "sdSource": "s3://com-uberresearch-data-dimensions-target-20181106-alternative/cleanup/v134/2549eaecd7973599484d7c17b260dba0a4ecb94b/merge/v9/a6c9fde33151104705d4d7ff012ea9563521a3ce/jats-lookup/v90/0000000373_0000000373/records_13104_00000001.jsonl", 
        "type": "ScholarlyArticle", 
        "url": "http://link.springer.com/10.1007%2Fs00170-009-1986-y"
      }
    ]
     

    Download the RDF metadata as:  json-ld nt turtle xml License info

    HOW TO GET THIS DATA PROGRAMMATICALLY:

    JSON-LD is a popular format for linked data which is fully compatible with JSON.

    curl -H 'Accept: application/ld+json' 'https://scigraph.springernature.com/pub.10.1007/s00170-009-1986-y'

    N-Triples is a line-based linked data format ideal for batch operations.

    curl -H 'Accept: application/n-triples' 'https://scigraph.springernature.com/pub.10.1007/s00170-009-1986-y'

    Turtle is a human-readable linked data format.

    curl -H 'Accept: text/turtle' 'https://scigraph.springernature.com/pub.10.1007/s00170-009-1986-y'

    RDF/XML is a standard XML format for linked data.

    curl -H 'Accept: application/rdf+xml' 'https://scigraph.springernature.com/pub.10.1007/s00170-009-1986-y'


     

    This table displays all metadata directly associated to this object as RDF triples.

    155 TRIPLES      21 PREDICATES      50 URIs      19 LITERALS      7 BLANK NODES

    Subject Predicate Object
    1 sg:pub.10.1007/s00170-009-1986-y schema:about anzsrc-for:08
    2 anzsrc-for:0801
    3 schema:author Ncec430a5a0554674862999da94633146
    4 schema:citation sg:pub.10.1007/978-3-7091-4338-4_3
    5 sg:pub.10.1007/s00170-003-1740-9
    6 sg:pub.10.1007/s00170-005-2585-1
    7 sg:pub.10.1007/s00170-006-0738-5
    8 sg:pub.10.1007/s10479-004-5029-7
    9 https://doi.org/10.1016/0305-0483(83)90088-9
    10 https://doi.org/10.1016/j.cor.2005.05.028
    11 https://doi.org/10.1016/j.mcm.2005.01.005
    12 https://doi.org/10.1016/s0305-0548(00)00071-x
    13 https://doi.org/10.1016/s0305-0548(99)00138-0
    14 https://doi.org/10.1016/s0360-8352(02)00216-4
    15 https://doi.org/10.1016/s0377-2217(02)00352-1
    16 https://doi.org/10.1016/s0377-2217(99)00031-4
    17 https://doi.org/10.1016/s0377-2217(99)00447-6
    18 https://doi.org/10.1016/s0895-7177(99)00085-0
    19 https://doi.org/10.1016/s0925-5273(03)00092-6
    20 https://doi.org/10.1080/00207540500525254
    21 https://doi.org/10.1080/00207549408957026
    22 https://doi.org/10.1080/07408179808966485
    23 https://doi.org/10.1287/ijoc.13.2.120.10521
    24 https://doi.org/10.1287/mnsc.35.5.607
    25 https://doi.org/10.1287/opre.40.4.750
    26 https://doi.org/10.1287/opre.40.4.764
    27 schema:datePublished 2009-11
    28 schema:datePublishedReg 2009-11-01
    29 schema:description A batch processing machine can process several jobs simultaneously. In this research, we consider the problem of a two-stage flow shop with two batch processing machines to minimize the makespan. We assume that the processing time of a batch is the longest processing time among all the jobs in that batch and the sizes of the jobs are nonidentical. There is a limitation on batch sizes and the sum of job sizes in a batch must be less than or equal to the machine capacity. Since this problem is strongly nondeterministic polynomial time hard, we propose two heuristic algorithms. The first one is knowledge-based and the other is based on the batch first fit heuristic proposed previously. To further enhance the solution quality, two different simulated annealing (SA) algorithms based on the two constructive heuristics is also developed. Since heuristic methods for this problem has not been proposed previously, a lower bound is developed for evaluating the performance of the proposed methods. Several test problems have been solved by SAs and lower bound method and the results are compared. Computational studies show that both algorithms provide good results but the first SA (ARSA) algorithm considerably outperforms the second one (FLSA). In addition, the results of ARSA algorithm, optimal solutions, and lower bounds are compared for several small problems. The comparisons show that except for one instance, the ARSA could find the optimal solutions and the proposed lower bound provides small gaps comparing with the optimal solutions.
    30 schema:genre research_article
    31 schema:inLanguage en
    32 schema:isAccessibleForFree false
    33 schema:isPartOf N17d983016f1c49e5a4ab8fbd96a7888c
    34 N88e9165db8c34031867ab7c91e63f609
    35 sg:journal.1043671
    36 schema:name Flow shop scheduling with two batch processing machines and nonidentical job sizes
    37 schema:pagination 553
    38 schema:productId N751e620e6dbe4c92b3f081b94c8ee398
    39 Naaf310455ccc4d928320dd1824853342
    40 Neeeee31f73f04ab08abf99f73dbda628
    41 schema:sameAs https://app.dimensions.ai/details/publication/pub.1049224610
    42 https://doi.org/10.1007/s00170-009-1986-y
    43 schema:sdDatePublished 2019-04-11T14:33
    44 schema:sdLicense https://scigraph.springernature.com/explorer/license/
    45 schema:sdPublisher N85ecfe40dc1045fea033f8f5fc0373a7
    46 schema:url http://link.springer.com/10.1007%2Fs00170-009-1986-y
    47 sgo:license sg:explorer/license/
    48 sgo:sdDataset articles
    49 rdf:type schema:ScholarlyArticle
    50 N17d983016f1c49e5a4ab8fbd96a7888c schema:volumeNumber 45
    51 rdf:type schema:PublicationVolume
    52 N751e620e6dbe4c92b3f081b94c8ee398 schema:name dimensions_id
    53 schema:value pub.1049224610
    54 rdf:type schema:PropertyValue
    55 N85ecfe40dc1045fea033f8f5fc0373a7 schema:name Springer Nature - SN SciGraph project
    56 rdf:type schema:Organization
    57 N88e9165db8c34031867ab7c91e63f609 schema:issueNumber 5-6
    58 rdf:type schema:PublicationIssue
    59 Naaf310455ccc4d928320dd1824853342 schema:name doi
    60 schema:value 10.1007/s00170-009-1986-y
    61 rdf:type schema:PropertyValue
    62 Ncec430a5a0554674862999da94633146 rdf:first sg:person.013256176555.72
    63 rdf:rest Nd72fd4b09d3340f9a8f4dc1e3cb59996
    64 Nd72fd4b09d3340f9a8f4dc1e3cb59996 rdf:first sg:person.012157602505.22
    65 rdf:rest Nddeceec1e93e4dddbea9c405ce5eae1c
    66 Nddeceec1e93e4dddbea9c405ce5eae1c rdf:first sg:person.010630670505.07
    67 rdf:rest rdf:nil
    68 Neeeee31f73f04ab08abf99f73dbda628 schema:name readcube_id
    69 schema:value ea7ecc621832ae6275b808e7e5b0694a7264d1c25ec6b864206e7242eb27d933
    70 rdf:type schema:PropertyValue
    71 anzsrc-for:08 schema:inDefinedTermSet anzsrc-for:
    72 schema:name Information and Computing Sciences
    73 rdf:type schema:DefinedTerm
    74 anzsrc-for:0801 schema:inDefinedTermSet anzsrc-for:
    75 schema:name Artificial Intelligence and Image Processing
    76 rdf:type schema:DefinedTerm
    77 sg:journal.1043671 schema:issn 0268-3768
    78 1433-3015
    79 schema:name The International Journal of Advanced Manufacturing Technology
    80 rdf:type schema:Periodical
    81 sg:person.010630670505.07 schema:affiliation https://www.grid.ac/institutes/grid.46072.37
    82 schema:familyName Jolai
    83 schema:givenName F.
    84 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.010630670505.07
    85 rdf:type schema:Person
    86 sg:person.012157602505.22 schema:affiliation https://www.grid.ac/institutes/grid.411368.9
    87 schema:familyName Karimi
    88 schema:givenName B.
    89 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.012157602505.22
    90 rdf:type schema:Person
    91 sg:person.013256176555.72 schema:affiliation https://www.grid.ac/institutes/grid.444712.0
    92 schema:familyName Mirsanei
    93 schema:givenName H. S.
    94 schema:sameAs https://app.dimensions.ai/discover/publication?and_facet_researcher=ur.013256176555.72
    95 rdf:type schema:Person
    96 sg:pub.10.1007/978-3-7091-4338-4_3 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044943422
    97 https://doi.org/10.1007/978-3-7091-4338-4_3
    98 rdf:type schema:CreativeWork
    99 sg:pub.10.1007/s00170-003-1740-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1000837418
    100 https://doi.org/10.1007/s00170-003-1740-9
    101 rdf:type schema:CreativeWork
    102 sg:pub.10.1007/s00170-005-2585-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005525893
    103 https://doi.org/10.1007/s00170-005-2585-1
    104 rdf:type schema:CreativeWork
    105 sg:pub.10.1007/s00170-006-0738-5 schema:sameAs https://app.dimensions.ai/details/publication/pub.1004346192
    106 https://doi.org/10.1007/s00170-006-0738-5
    107 rdf:type schema:CreativeWork
    108 sg:pub.10.1007/s10479-004-5029-7 schema:sameAs https://app.dimensions.ai/details/publication/pub.1022306404
    109 https://doi.org/10.1007/s10479-004-5029-7
    110 rdf:type schema:CreativeWork
    111 https://doi.org/10.1016/0305-0483(83)90088-9 schema:sameAs https://app.dimensions.ai/details/publication/pub.1005417958
    112 rdf:type schema:CreativeWork
    113 https://doi.org/10.1016/j.cor.2005.05.028 schema:sameAs https://app.dimensions.ai/details/publication/pub.1053000696
    114 rdf:type schema:CreativeWork
    115 https://doi.org/10.1016/j.mcm.2005.01.005 schema:sameAs https://app.dimensions.ai/details/publication/pub.1033010984
    116 rdf:type schema:CreativeWork
    117 https://doi.org/10.1016/s0305-0548(00)00071-x schema:sameAs https://app.dimensions.ai/details/publication/pub.1005877529
    118 rdf:type schema:CreativeWork
    119 https://doi.org/10.1016/s0305-0548(99)00138-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012675220
    120 rdf:type schema:CreativeWork
    121 https://doi.org/10.1016/s0360-8352(02)00216-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009103310
    122 rdf:type schema:CreativeWork
    123 https://doi.org/10.1016/s0377-2217(02)00352-1 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018156008
    124 rdf:type schema:CreativeWork
    125 https://doi.org/10.1016/s0377-2217(99)00031-4 schema:sameAs https://app.dimensions.ai/details/publication/pub.1044273859
    126 rdf:type schema:CreativeWork
    127 https://doi.org/10.1016/s0377-2217(99)00447-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1018599936
    128 rdf:type schema:CreativeWork
    129 https://doi.org/10.1016/s0895-7177(99)00085-0 schema:sameAs https://app.dimensions.ai/details/publication/pub.1012954044
    130 rdf:type schema:CreativeWork
    131 https://doi.org/10.1016/s0925-5273(03)00092-6 schema:sameAs https://app.dimensions.ai/details/publication/pub.1009769685
    132 rdf:type schema:CreativeWork
    133 https://doi.org/10.1080/00207540500525254 schema:sameAs https://app.dimensions.ai/details/publication/pub.1039595848
    134 rdf:type schema:CreativeWork
    135 https://doi.org/10.1080/00207549408957026 schema:sameAs https://app.dimensions.ai/details/publication/pub.1019606803
    136 rdf:type schema:CreativeWork
    137 https://doi.org/10.1080/07408179808966485 schema:sameAs https://app.dimensions.ai/details/publication/pub.1047102265
    138 rdf:type schema:CreativeWork
    139 https://doi.org/10.1287/ijoc.13.2.120.10521 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064707035
    140 rdf:type schema:CreativeWork
    141 https://doi.org/10.1287/mnsc.35.5.607 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064720579
    142 rdf:type schema:CreativeWork
    143 https://doi.org/10.1287/opre.40.4.750 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064730474
    144 rdf:type schema:CreativeWork
    145 https://doi.org/10.1287/opre.40.4.764 schema:sameAs https://app.dimensions.ai/details/publication/pub.1064730475
    146 rdf:type schema:CreativeWork
    147 https://www.grid.ac/institutes/grid.411368.9 schema:alternateName Amirkabir University of Technology
    148 schema:name Department of Industrial Engineering, Amirkabir University of Technology, Tehran, Iran
    149 rdf:type schema:Organization
    150 https://www.grid.ac/institutes/grid.444712.0 schema:alternateName Mazandaran University of Science and Technology
    151 schema:name Department of Industrial Engineering, Mazandaran University of Science and Technology, Babol, Iran
    152 rdf:type schema:Organization
    153 https://www.grid.ac/institutes/grid.46072.37 schema:alternateName University of Tehran
    154 schema:name Department of Industrial Engineering, University of Tehran, Tehran, Iran
    155 rdf:type schema:Organization
     




    Preview window. Press ESC to close (or click here)


    ...