A heuristic approach to n/ m job shop scheduling: fuzzy dynamic scheduling algorithms
n/m shop scheduling is a ' NP-Hard' problem. Using conventional heuristic algorithms ( priority rules) only, it is almost impossible to achieve an optimal solution. Research has been carried out to improve the heuristic algorithms to give a near-optimal solution. This paper advocates a fuz...
Saved in:
| Published in | Production planning & control Vol. 7; no. 3; pp. 299 - 311 |
|---|---|
| Main Authors | , |
| Format | Journal Article |
| Language | English |
| Published |
Taylor & Francis Group
01.05.1996
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0953-7287 1366-5871 |
| DOI | 10.1080/09537289608930356 |
Cover
| Abstract | n/m shop scheduling is a ' NP-Hard' problem. Using conventional heuristic algorithms ( priority rules) only, it is almost impossible to achieve an optimal solution. Research has been carried out to improve the heuristic algorithms to give a near-optimal solution. This paper advocates a fuzzy logic based, dynamic scheduling algoridim aimed at achieving this goal. The concept of new membership functions is discussed in die algorithm as a link to connect several priority rules. The constraints to determine the membership function of jobs for a particular priority rule are established, and three membership functions are developed. In order to decide the weight vector of priority rules, an aggregate performance measure is suggested. The methodology for constructing the weight vector is discussed in detail. Experiments have been carried out using a simulation technique to validate the proposed scheduling algorithm. |
|---|---|
| AbstractList | n/m shop scheduling is a ' NP-Hard' problem. Using conventional heuristic algorithms ( priority rules) only, it is almost impossible to achieve an optimal solution. Research has been carried out to improve the heuristic algorithms to give a near-optimal solution. This paper advocates a fuzzy logic based, dynamic scheduling algoridim aimed at achieving this goal. The concept of new membership functions is discussed in die algorithm as a link to connect several priority rules. The constraints to determine the membership function of jobs for a particular priority rule are established, and three membership functions are developed. In order to decide the weight vector of priority rules, an aggregate performance measure is suggested. The methodology for constructing the weight vector is discussed in detail. Experiments have been carried out using a simulation technique to validate the proposed scheduling algorithm. |
| Author | ZHANG, XIAOYAN ROY, UTPAL |
| Author_xml | – sequence: 1 givenname: UTPAL surname: ROY fullname: ROY, UTPAL organization: Department of Mechanical, Aerospace and Manufacturing Engineering , Syracuse University – sequence: 2 givenname: XIAOYAN surname: ZHANG fullname: ZHANG, XIAOYAN organization: Department of Mechanical, Aerospace and Manufacturing Engineering , Syracuse University |
| BookMark | eNp90F1LwzAUBuAgE-ymP8C7_IG6pGmbVLwZwy8YeOOuSz6aNaNNSpIh3a-3Y4Kg6NW5eM9zOLxzMLPONgDcYnSHEUNLVBWEZqwqEasIIkV5ARJMyjItGMUzkJzydFqgV2Aewh4hlOGySsB2Bdvm4E2IRkI-DN5x2cLooF3CHu6dgKF1AwyybdShM3Z3D_XheByhGi3vJ_OdQN7tnDex7cM1uNS8C83N11yA7dPj-_ol3bw9v65Xm1SSvIipUiIrpKaiIRVlJSs1ljynRAspKjG9qJBock1wgYTIK8mZzoqc5plgWhIlyALg813pXQi-0fXgTc_9WGNUn3qpf_UyGfrDSBN5NM5Gz033r3w4S2O18z3_cL5TdeRj57z23EoTavI3_wRzB3y7 |
| CitedBy_id | crossref_primary_10_1155_2014_463692 crossref_primary_10_1007_s10951_010_0173_1 crossref_primary_10_1016_j_rcim_2022_102435 crossref_primary_10_1016_S0888_613X_98_00014_0 crossref_primary_10_1016_S0360_8352_99_00149_7 crossref_primary_10_1016_S1367_5788_98_00013_3 crossref_primary_10_1142_S0219686705000679 crossref_primary_10_1016_S0377_2217_02_00563_5 crossref_primary_10_1016_S1474_6670_17_44603_9 crossref_primary_10_1080_10170669_1998_10433331 |
| Cites_doi | 10.1287/opre.25.1.45 10.1016/S0019-9958(65)90241-X 10.1287/opre.23.1.62 10.1287/opre.12.3.471 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Group, LLC 1996 |
| Copyright_xml | – notice: Copyright Taylor & Francis Group, LLC 1996 |
| DBID | AAYXX CITATION |
| DOI | 10.1080/09537289608930356 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1366-5871 |
| EndPage | 311 |
| ExternalDocumentID | 10_1080_09537289608930356 8930356 |
| GroupedDBID | 07I 0R~ 123 1TA 4.4 4B5 5VS 8V8 ABJNI ACGEJ ACGFS ACGOD ACIWK ADCVX ADMLS ADXEU ADXPE AEHZU AENEX AEPSL AEYOC AEZBV AFION AGBLW AGYFW AKHJE AKMBP AKOOK ALMA_UNASSIGNED_HOLDINGS ALXIB AWYRJ BGSSV C0- C5H CS3 DEXXA DU5 EBS EJD FETWF H13 HZ~ IFELN KYCEM L8C M4Z MS~ NA5 NUSFT NX~ O9- P2P PQQKQ RNS TAJZE TAP TEN TFL TFT TFW UB6 .7F .QJ 0BK 29P 30N 4R4 AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR AAYXX ABCCY ABFIM ABHAV ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACTIO ACTTO ADGTB ADUMR AEISY AEOZL AFBWG AFKVX AFRVT AGBKS AGDLA AGMYJ AGVKY AGWUF AHDZW AHQJS AIJEM AIYEW AJWEG AKBVH AKVCP ALQZU ALRRR AQRUH AVBZW BLEHA BWMZZ CAG CCCUG CE4 CITATION COF CYRSC DAOYK DGEBU DKSSO E~A E~B GTTXZ HF~ H~P IPNFZ J.P LJTGL OPCYK RIG RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ~S~ |
| ID | FETCH-LOGICAL-c345t-ddb25cf7be3978686f1ca473fbcb9b002d0be4f3150bb49ca8f254742b8fc3db3 |
| ISSN | 0953-7287 |
| IngestDate | Thu Apr 24 23:07:41 EDT 2025 Wed Oct 01 04:19:22 EDT 2025 Mon Oct 20 23:40:55 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 3 |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c345t-ddb25cf7be3978686f1ca473fbcb9b002d0be4f3150bb49ca8f254742b8fc3db3 |
| PageCount | 13 |
| ParticipantIDs | crossref_primary_10_1080_09537289608930356 informaworld_taylorfrancis_310_1080_09537289608930356 crossref_citationtrail_10_1080_09537289608930356 |
| ProviderPackageCode | CITATION AAYXX |
| PublicationCentury | 1900 |
| PublicationDate | 1996-05-01 |
| PublicationDateYYYYMMDD | 1996-05-01 |
| PublicationDate_xml | – month: 05 year: 1996 text: 1996-05-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationTitle | Production planning & control |
| PublicationYear | 1996 |
| Publisher | Taylor & Francis Group |
| Publisher_xml | – name: Taylor & Francis Group |
| References | CIT0001 YAGER R. R. (CIT0006) 1987 NAHMIAS S. (CIT0004) 1989 CONWAY R. W. (CIT0002) 1967 CIT0005 DUDEK R. A. (CIT0003) 1964; 12 CIT0007 |
| References_xml | – volume-title: Theory if Sduduling year: 1967 ident: CIT0002 – volume-title: Fuzzy Sets and Appticauons:Selected Papers year: 1987 ident: CIT0006 – ident: CIT0005 doi: 10.1287/opre.25.1.45 – ident: CIT0007 doi: 10.1016/S0019-9958(65)90241-X – ident: CIT0001 doi: 10.1287/opre.23.1.62 – volume-title: Production and OperatWns Analysis year: 1989 ident: CIT0004 – volume: 12 start-page: 471 year: 1964 ident: CIT0003 publication-title: Operations Research doi: 10.1287/opre.12.3.471 |
| SSID | ssj0002169 |
| Score | 1.5085036 |
| Snippet | n/m shop scheduling is a ' NP-Hard' problem. Using conventional heuristic algorithms ( priority rules) only, it is almost impossible to achieve an optimal... |
| SourceID | crossref informaworld |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 299 |
| SubjectTerms | dynamic scheduling fuzzy model job shop scheduling scheduling |
| Title | A heuristic approach to n/ m job shop scheduling: fuzzy dynamic scheduling algorithms |
| URI | https://www.tandfonline.com/doi/abs/10.1080/09537289608930356 |
| Volume | 7 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVEBS databaseName: Inspec with Full Text customDbUrl: eissn: 1366-5871 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0002169 issn: 0953-7287 databaseCode: ADMLS dateStart: 19900101 isFulltext: true titleUrlDefault: https://www.ebsco.com/products/research-databases/inspec-full-text providerName: EBSCOhost |
| link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1Lb9NAEF5BeoFDxVOUAtoDJyyDsy_b3CygCojSSiQo5RJlXxSUxlFxDuTXM5tdb9zQIsrFsvzYlf19npld73yD0HNeUq0yWaQZsdyJapu0zC0AYlzaonSSVS53-PCTGIzYhzEfb2WXNPKlWl2aV_I_qMIxwNVlyV4D2dgoHIB9wBe2gDBs_wnjCuK8pZdajuLgLph0gB4kZ8mPWiY_T-tFAkNYcCmzkNxsl6vVr0T7WvSdc8l09q0-_96cBgXzELMee1FYx5NFKHG0JkxY5R5_2RydOLxGw-MqTih_HVQ-J2r8vjo6CcKxOiTdic2KvjhZSNOcBNdovKmkQqS88AVUWluadyhDu3bRV0EKLpZ6-_qH9Q7LHaEz6AuGVhBLZZRfopS95cHiusJ-K3i63cRNtEPA7Gc9tFO9Pfz4OTpr0hdBjtE_YPvj28mvbzdyIXS5IGzbCUmGd9BuGEvgyhPjLrph5vfQ7Y7C5H30pcKRIrilCG5qPMev8BkGgmBHELwhwWu8pgcO9OicwRt6PECjg3fDN4M0lNJIFWW8SbWWhCubSwPxZyEKYftqynJqpZJOFZPoTBpmKQwPpGSlmhaWcJYzIgurqJb0IerN67l5hHBfMRe1GqKFZJyoqVGCikJnhihTmnIPZe1bmqigM-_KncwmV6Kzh17EWxZeZOVvF_Puq58065kt68vQTOiV9z2-Tif76NbmO3iCes350jyF6LORzwKDfgNhN3tP |
| linkProvider | EBSCOhost |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+heuristic+approach+to+n+%2F+m+job+shop+scheduling%3A+fuzzy+dynamic+scheduling+algorithms&rft.jtitle=Production+planning+%26+control&rft.au=ROY%2C+UTPAL&rft.au=ZHANG%2C+XIAOYAN&rft.date=1996-05-01&rft.issn=0953-7287&rft.eissn=1366-5871&rft.volume=7&rft.issue=3&rft.spage=299&rft.epage=311&rft_id=info:doi/10.1080%2F09537289608930356&rft.externalDBID=n%2Fa&rft.externalDocID=10_1080_09537289608930356 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0953-7287&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0953-7287&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0953-7287&client=summon |