[ { "key": "6DKXE5C6", "version": 305, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/6DKXE5C6", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/6DKXE5C6", "type": "text/html" }, "up": { "href": "https://api.zotero.org/groups/246019/items/2HXIRZBU", "type": "application/json" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } } }, "data": { "key": "6DKXE5C6", "version": 305, "parentItem": "2HXIRZBU", "itemType": "attachment", "linkMode": "imported_url", "title": "ScienceDirect Snapshot", "accessDate": "2014-05-12T13:47:13Z", "url": "http://www.sciencedirect.com.libproxy.mit.edu/science/article/pii/0272696383900220#", "note": "", "contentType": "text/html", "charset": "utf-8", "filename": "0272696383900220.html", "md5": "0c5b88e7716bc9880a3bc569b7fcd516", "mtime": 1399902433442, "tags": [], "relations": {}, "dateAdded": "2014-05-12T13:47:13Z", "dateModified": "2014-05-12T13:47:13Z" } }, { "key": "K39EETNV", "version": 305, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/K39EETNV", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/K39EETNV", "type": "text/html" }, "up": { "href": "https://api.zotero.org/groups/246019/items/2HXIRZBU", "type": "application/json" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "numChildren": 0 }, "data": { "key": "K39EETNV", "version": 305, "parentItem": "2HXIRZBU", "itemType": "attachment", "linkMode": "imported_url", "title": "ScienceDirect Full Text PDF", "accessDate": "2014-05-12T13:47:06Z", "url": "http://www.sciencedirect.com.libproxy.mit.edu/science/article/pii/0272696383900220/pdf?md5=279add6995ae071285844b211e883ead&pid=1-s2.0-0272696383900220-main.pdf", "note": "", "contentType": "application/pdf", "charset": "", "filename": "Baker e Kanet - 1983 - Job shop scheduling with modified due dates.pdf", "md5": "1878ca12efa7374a4e6eabe0a51e8c96", "mtime": 1399902429281, "tags": [], "relations": {}, "dateAdded": "2014-05-12T13:47:06Z", "dateModified": "2014-05-12T13:47:09Z" } }, { "key": "2HXIRZBU", "version": 304, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/2HXIRZBU", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/2HXIRZBU", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "creatorSummary": "Baker and Kanet", "parsedDate": "1983-11", "numChildren": 2 }, "data": { "key": "2HXIRZBU", "version": 304, "itemType": "journalArticle", "title": "Job shop scheduling with modified due dates", "creators": [ { "creatorType": "author", "firstName": "Kenneth R.", "lastName": "Baker" }, { "creatorType": "author", "firstName": "John J.", "lastName": "Kanet" } ], "abstractNote": "This paper introduces a new dispatching rule to job shop scheduling, extending earlier results to a multi-machine environment. This new rule, which uses modified due dates is compared to other popular dispatching methods over a range of due date tightnesses at two utilization levels. The results for mean tardiness indicate that the modified operation due date (MOD) rule compares very favorably with other prominent dispatching methods.\nThe modified due date is a job's original due date or its early finish time, whichever is larger. For an individual operation, it is the operation's original due date or the operation's early finish time, whichever is larger. A comparison of the job-based version with the operation-based version indicated that the operation-based version tended to be more effective at meeting due dates.\nThe main performance measure was mean job tardiness, although the proportion of tardy jobs was also reported, and the two measures together imply the conditional mean tardiness. The MOD rule was compared to several well-known tardiness-oriented priority rules, such as minimum slack-per-operation (S/OPN), smallest critical ratio (SCR), and COVERT. The MOD rule tended to achieve lower levels of mean tardiness than the other rules, except under conditions where due dates were quite loose. In this situation, very little tardiness occurs for any of the rules. The MOD rule appeared to be more robust than the other rules to changes in the tightness of due dates, and similar results occurred at both high and low utilizations.", "publicationTitle": "Journal of Operations Management", "publisher": "", "place": "", "date": "November 1983", "volume": "4", "issue": "1", "section": "", "partNumber": "", "partTitle": "", "pages": "11-22", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Journal of Operations Management", "DOI": "10.1016/0272-6963(83)90022-0", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/0272696383900220", "accessDate": "2014-05-12T13:47:06Z", "PMID": "", "PMCID": "", "ISSN": "0272-6963", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-05-12T13:47:06Z", "dateModified": "2014-05-12T13:47:06Z" } }, { "key": "IGW7R3N7", "version": 303, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/IGW7R3N7", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/IGW7R3N7", "type": "text/html" }, "up": { "href": "https://api.zotero.org/groups/246019/items/6M6HXVG9", "type": "application/json" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } } }, "data": { "key": "IGW7R3N7", "version": 303, "parentItem": "6M6HXVG9", "itemType": "attachment", "linkMode": "imported_url", "title": "Snapshot", "accessDate": "2014-05-09T17:43:16Z", "url": "http://link.springer.com/article/10.1007/s00170-002-1534-5", "note": "", "contentType": "text/html", "charset": "utf-8", "filename": "s00170-002-1534-5.html", "md5": "f55a0d8f1e35aba0db1b184f31b6d51b", "mtime": 1399657396809, "tags": [], "relations": {}, "dateAdded": "2014-05-09T17:43:16Z", "dateModified": "2014-05-09T17:43:16Z" } }, { "key": "6M6HXVG9", "version": 302, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/6M6HXVG9", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/6M6HXVG9", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "creatorSummary": "Dominic et al.", "parsedDate": "2004-07-01", "numChildren": 1 }, "data": { "key": "6M6HXVG9", "version": 302, "itemType": "journalArticle", "title": "Efficient dispatching rules for dynamic job shop scheduling", "creators": [ { "creatorType": "author", "firstName": "P. D. D.", "lastName": "Dominic" }, { "creatorType": "author", "firstName": "S.", "lastName": "Kaliyamoorthy" }, { "creatorType": "author", "firstName": "M. Saravana", "lastName": "Kumar" } ], "abstractNote": "This study attempts to provide efficient dispatching rules for dynamic job shop scheduling by combining different dispatching rules. A dispatching rule is used to select the next job to be processed from a set of jobs awaiting service. A job shop will be treated as dynamic, when conditions such as continuously arriving new jobs and deviations from current schedule need to be accommodated, and a job shop should be treated as an integrated part of a manufacturing system. The discussion includes a simulation technique which uses ARENA 4.0. software to simulate the dynamic model of a job shop under various rules and performance measures . Results of the simulation show that, for most of the performance measures, combined rules perform well. In this study, the combined rules MWKR_FIFO and TWKR_SPT do well under most conditions.", "publicationTitle": "The International Journal of Advanced Manufacturing Technology", "publisher": "", "place": "", "date": "2004/07/01", "volume": "24", "issue": "1-2", "section": "", "partNumber": "", "partTitle": "", "pages": "70-75", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Int J Adv Manuf Technol", "DOI": "10.1007/s00170-002-1534-5", "citationKey": "", "url": "http://link.springer.com/article/10.1007/s00170-002-1534-5", "accessDate": "2014-05-09T17:43:15Z", "PMID": "", "PMCID": "", "ISSN": "0268-3768, 1433-3015", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "", "extra": "", "tags": [ { "tag": "COMPUTER simulation", "type": 1 }, { "tag": "Combination rules", "type": 1 }, { "tag": "Dispatching rules", "type": 1 }, { "tag": "Dynamic job shop", "type": 1 }, { "tag": "Flow time", "type": 1 }, { "tag": "Tardiness", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-05-09T17:43:15Z", "dateModified": "2014-05-09T17:43:15Z" } }, { "key": "ZN6HUDEM", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/ZN6HUDEM", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/ZN6HUDEM", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "King", "parsedDate": "1976-03", "numChildren": 2 }, "data": { "key": "ZN6HUDEM", "version": 301, "itemType": "journalArticle", "title": "The theory-practice gap in job-shop scheduling", "creators": [ { "creatorType": "author", "firstName": "J.R.", "lastName": "King" } ], "abstractNote": "This job-shop scheduling problem is perhaps the most common form of industrial scheduling problem, it is also probably the most complex. This paper examines the nature of the problem and reviews the state of the art of scheduling theory and its relevance to the solution of practical problems.", "publicationTitle": "Production Engineer", "publisher": "", "place": "", "date": "March 1976", "volume": "55", "issue": "3", "section": "", "partNumber": "", "partTitle": "", "pages": "137-143", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1049/tpe:19760044", "citationKey": "", "url": "", "accessDate": "", "PMID": "", "PMCID": "", "ISSN": "0032-9851", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "IEEE Xplore", "callNumber": "", "rights": "", "extra": "00037", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-30T11:12:24Z", "dateModified": "2014-05-09T10:42:15Z" } }, { "key": "ZA4AWUCT", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/ZA4AWUCT", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/ZA4AWUCT", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Guo et al.", "parsedDate": "2006-07", "numChildren": 1 }, "data": { "key": "ZA4AWUCT", "version": 301, "itemType": "journalArticle", "title": "Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment: A case study based on the apparel industry", "creators": [ { "creatorType": "author", "firstName": "Z. X.", "lastName": "Guo" }, { "creatorType": "author", "firstName": "W. K.", "lastName": "Wong" }, { "creatorType": "author", "firstName": "S. Y. S.", "lastName": "Leung" }, { "creatorType": "author", "firstName": "J. T.", "lastName": "Fan" }, { "creatorType": "author", "firstName": "S. F.", "lastName": "Chan" } ], "abstractNote": "An effective job shop scheduling (JSS) in the manufacturing industry is helpful to meet the production demand and reduce the production cost, and to improve the ability to compete in the ever increasing volatile market demanding multiple products. In this paper, a universal mathematical model of the JSS problem for apparel assembly process is constructed. The objective of this model is to minimize the total penalties of earliness and tardiness by deciding when to start each order’s production and how to assign the operations to machines (operators). A genetic optimization process is then presented to solve this model, in which a new chromosome representation, a heuristic initialization process and modified crossover and mutation operators are proposed. Three experiments using industrial data are illustrated to evaluate the performance of the proposed method. The experimental results demonstrate the effectiveness of the proposed algorithm to solve the JSS problem in a mixed- and multi-product assembly environment.", "publicationTitle": "Computers & Industrial Engineering", "publisher": "", "place": "", "date": "July 2006", "volume": "50", "issue": "3", "section": "", "partNumber": "", "partTitle": "", "pages": "202-219", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Computers & Industrial Engineering", "DOI": "10.1016/j.cie.2006.03.003", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/S0360835206000271", "accessDate": "2014-04-28T14:38:26Z", "PMID": "", "PMCID": "", "ISSN": "0360-8352", "archive": "", "archiveLocation": "", "shortTitle": "Mathematical model and genetic optimization for the job shop scheduling problem in a mixed- and multi-product assembly environment", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "00053", "tags": [ { "tag": "Apparel industry", "type": 1 }, { "tag": "Genetic algorithm", "type": 1 }, { "tag": "Job shop scheduling", "type": 1 }, { "tag": "Mathematical model", "type": 1 }, { "tag": "Optimization", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-04-28T14:38:26Z", "dateModified": "2014-05-09T10:42:14Z" } }, { "key": "V235R48A", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/V235R48A", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/V235R48A", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Pritsker et al.", "parsedDate": "1969-09-01", "numChildren": 1 }, "data": { "key": "V235R48A", "version": 301, "itemType": "journalArticle", "title": "Multiproject Scheduling with Limited Resources: A Zero-One Programming Approach", "creators": [ { "creatorType": "author", "firstName": "A. Alan B.", "lastName": "Pritsker" }, { "creatorType": "author", "firstName": "Lawrence J.", "lastName": "Waiters" }, { "creatorType": "author", "firstName": "Philip M.", "lastName": "Wolfe" } ], "abstractNote": "A zero-one (0-1) linear programming formulation of multiproject and job-shop scheduling problems is presented that is more general and computationally tractable than other known formulations. It can accommodate a wide range of real-world situations including multiple resource constraints, due dates, job splitting, resource, substitutability, and concurrency and nonconcurrency of job performance requirements. Three possible objective functions are discussed; minimizing total throughput time for all projects: minimizing the time by which all projects are completed (i.e., minimizing makespan); and minimizing total lateness or lateness penalty for all projects.", "publicationTitle": "Management Science", "publisher": "", "place": "", "date": "September 1, 1969", "volume": "16", "issue": "1", "section": "", "partNumber": "", "partTitle": "", "pages": "93-108", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Management Science", "DOI": "10.1287/mnsc.16.1.93", "citationKey": "", "url": "http://pubsonline.informs.org/doi/abs/10.1287/mnsc.16.1.93", "accessDate": "2014-04-28T16:09:36Z", "PMID": "", "PMCID": "", "ISSN": "0025-1909", "archive": "", "archiveLocation": "", "shortTitle": "Multiproject Scheduling with Limited Resources", "language": "", "libraryCatalog": "pubsonline.informs.org (Atypon)", "callNumber": "", "rights": "", "extra": "00555", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-28T16:09:36Z", "dateModified": "2014-05-09T10:42:12Z" } }, { "key": "SFBXQHDZ", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/SFBXQHDZ", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/SFBXQHDZ", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Rocha et al.", "parsedDate": "2008-04", "numChildren": 2 }, "data": { "key": "SFBXQHDZ", "version": 301, "itemType": "journalArticle", "title": "Exact algorithms for a scheduling problem with unrelated parallel machines and sequence and machine-dependent setup times", "creators": [ { "creatorType": "author", "firstName": "Pedro Leite", "lastName": "Rocha" }, { "creatorType": "author", "firstName": "Martín Gómez", "lastName": "Ravetti" }, { "creatorType": "author", "firstName": "Geraldo Robson", "lastName": "Mateus" }, { "creatorType": "author", "firstName": "Panos M.", "lastName": "Pardalos" } ], "abstractNote": "A scheduling problem with unrelated parallel machines, sequence and machine-dependent setup times, due dates and weighted jobs is considered in this work. A branch-and-bound algorithm (B&B) is developed and a solution provided by the metaheuristic GRASP is used as an upper bound. We also propose a set of instances for this type of problem. The results are compared to the solutions provided by two mixed integer programming models (MIP) with the solver CPLEX 9.0. We carry out computational experiments and the algorithm performs extremely well on instances with up to 30 jobs.", "publicationTitle": "Computers & Operations Research", "publisher": "", "place": "", "date": "April 2008", "volume": "35", "issue": "4", "section": "", "partNumber": "", "partTitle": "", "pages": "1250-1264", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Computers & Operations Research", "DOI": "10.1016/j.cor.2006.07.015", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/S0305054806001614", "accessDate": "2014-04-30T15:33:51Z", "PMID": "", "PMCID": "", "ISSN": "0305-0548", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "00064", "tags": [ { "tag": "Branch-and-bound", "type": 1 }, { "tag": "GRASP", "type": 1 }, { "tag": "Machine-dependent setups", "type": 1 }, { "tag": "Parallel machines", "type": 1 }, { "tag": "Sequence-dependent setups", "type": 1 }, { "tag": "scheduling", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-04-30T15:33:51Z", "dateModified": "2014-05-09T10:42:11Z" } }, { "key": "NCPKPSWI", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/NCPKPSWI", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/NCPKPSWI", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Missbauer and Uzsoy", "parsedDate": "2011", "numChildren": 0 }, "data": { "key": "NCPKPSWI", "version": 301, "itemType": "bookSection", "title": "Optimization models of production planning problems", "creators": [ { "creatorType": "author", "firstName": "Hubert", "lastName": "Missbauer" }, { "creatorType": "author", "firstName": "Reha", "lastName": "Uzsoy" } ], "abstractNote": "", "bookTitle": "Planning Production and Inventories in the Extended Enterprise", "series": "", "seriesNumber": "", "volume": "", "numberOfVolumes": "", "edition": "", "date": "2011", "publisher": "Springer", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "437-507", "ISBN": "1441964843", "DOI": "", "citationKey": "", "url": "", "accessDate": "", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "", "callNumber": "", "rights": "", "extra": "00043", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-30T15:56:46Z", "dateModified": "2014-05-09T10:42:08Z" } }, { "key": "MXURPMR9", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/MXURPMR9", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/MXURPMR9", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Shafaei and Brunn", "parsedDate": "1999", "numChildren": 2 }, "data": { "key": "MXURPMR9", "version": 301, "itemType": "journalArticle", "title": "Workshop scheduling using practical (inaccurate) data Part 1: The performance of heuristic scheduling rules in a dynamic job shop environment using a rolling time horizon approach", "creators": [ { "creatorType": "author", "firstName": "R.", "lastName": "Shafaei" }, { "creatorType": "author", "firstName": "P.", "lastName": "Brunn" } ], "abstractNote": "This paper is a report on a simulation study to investigate the performance of a number of scheduling rules on the basis of a rolling time horizon approach for a dynamic job shop environment. The performance measure considered is an economic objective which includes the main costs involved in a scheduling decision. The first purpose of the study was to find the best scheduling rule and the second to investigate the effects of the rescheduling interval on performance and examine whether there is a policy that can always improve performance. The simulation study, which is part of a larger project on practical workshop scheduling, has been carried out under widely varying conditions in terms of due date tightness, shop load level, and shop load balance level. The results show that a recently developed scheduling rule, SPT-C/R, is the most appropriate scheduling rule in minimizing overall cost and that the relationship between performance and rescheduling interval can be shown.", "publicationTitle": "International Journal of Production Research", "publisher": "", "place": "", "date": "1999", "volume": "37", "issue": "17", "section": "", "partNumber": "", "partTitle": "", "pages": "3913-3925", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1080/002075499189835", "citationKey": "", "url": "http://dx.doi.org/10.1080/002075499189835", "accessDate": "2014-04-28T14:46:41Z", "PMID": "", "PMCID": "", "ISSN": "0020-7543", "archive": "", "archiveLocation": "", "shortTitle": "Workshop scheduling using practical (inaccurate) data Part 1", "language": "", "libraryCatalog": "Taylor and Francis+NEJM", "callNumber": "", "rights": "", "extra": "00040", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-28T14:46:41Z", "dateModified": "2014-05-09T10:42:07Z" } }, { "key": "JNCFXCEV", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/JNCFXCEV", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/JNCFXCEV", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Blazewicz et al.", "parsedDate": "1991-04-15", "numChildren": 2 }, "data": { "key": "JNCFXCEV", "version": 301, "itemType": "journalArticle", "title": "Mathematical programming formulations for machine scheduling: A survey", "creators": [ { "creatorType": "author", "firstName": "Jacek", "lastName": "Blazewicz" }, { "creatorType": "author", "firstName": "Moshe", "lastName": "Dror" }, { "creatorType": "author", "firstName": "Jan", "lastName": "Weglarz" } ], "abstractNote": "Machine scheduling was and still is a rich and promising field for research with applications in manufacturing, logistics, computer architecture, communications, etc. Combinatorial complexity theory has now classified the great majority of known machine scheduling problems as ‘easy’ or ‘very hard’. However, in most cases, mathematical programming models have not accompanied the algorithmic developments for solving ‘easy’ scheduling problems, nor have they facilitates solutions for ‘hard’ problems. Nevertheless, the analysis of the mathematical programming models for some hard combinatorial problems together with their polyhedral properties has enabled important computational advances for such problems as the TSP. In order to assess the present status and the solution potential of mathematical programming formulations for machine scheduling, we have compiled a systematic, consistent survey of formulations. The discussion has been developed in tandem with the classification of a given problem's complexity, since ‘solvability’ (i.e., the status of a problem as P or NP-hard) generally cannot be easily assessed from the formulation itself. A number of excellent survey papers on machine scheduling have appeared over the years (see the reference list), but none of them has been focused on mathematical formulations. This survey is the first one that attempts to compile a large number of mathematical programming formulations for scheduling into a single paper to ease the task of model building and testing scheduling formulations. Both, a newcomer and experienced researcher can use it as a reference point. Ultimately, mathematical programming formulations for scheduling problems might be used as a stepping stone to computational advances for some hard problems.", "publicationTitle": "European Journal of Operational Research", "publisher": "", "place": "", "date": "April 15, 1991", "volume": "51", "issue": "3", "section": "", "partNumber": "", "partTitle": "", "pages": "283-300", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "European Journal of Operational Research", "DOI": "10.1016/0377-2217(91)90304-E", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/037722179190304E", "accessDate": "2014-04-28T13:49:10Z", "PMID": "", "PMCID": "", "ISSN": "0377-2217", "archive": "", "archiveLocation": "", "shortTitle": "Mathematical programming formulations for machine scheduling", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "00143", "tags": [ { "tag": "Machine scheduling", "type": 1 }, { "tag": "additional resources", "type": 1 }, { "tag": "computational complexity", "type": 1 }, { "tag": "mathematical programming formulations", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-04-28T13:49:10Z", "dateModified": "2014-05-09T10:42:06Z" } }, { "key": "FTTR7G4H", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/FTTR7G4H", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/FTTR7G4H", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Pongcharoen et al.", "parsedDate": "2002-08-11", "numChildren": 2 }, "data": { "key": "FTTR7G4H", "version": 301, "itemType": "journalArticle", "title": "Determining optimum Genetic Algorithm parameters for scheduling the manufacturing and assembly of complex products", "creators": [ { "creatorType": "author", "firstName": "P.", "lastName": "Pongcharoen" }, { "creatorType": "author", "firstName": "C.", "lastName": "Hicks" }, { "creatorType": "author", "firstName": "P. M.", "lastName": "Braiden" }, { "creatorType": "author", "firstName": "D. J.", "lastName": "Stewardson" } ], "abstractNote": "A Genetic Algorithm-based Scheduling Tool (GAST) has been developed for the scheduling of complex products with multiple resource constraints and deep product structure. This includes a repair process that identifies and corrects infeasible schedules. The algorithm takes account of the requirement to minimise the penalties due to both the early supply of components and assemblies and the late delivery of final products, whilst simultaneously considering capacity utilisation. The research has used manufacturing data obtained from a capital goods company. The Genetic Algorithm scheduling method produces significantly better delivery performance and resource utilisation than the Company plans.\nGenetic Algorithm programs include a number of parameters including the probabilities of crossover and mutation, the population size and the number of generations. A factorial experiment has been performed to identify appropriate values for these factors that produce the best results within a given execution time. The overall objective is to use the most efficient Genetic Algorithm parameters that achieve minimum total costs and minimum spread, to solve a very large scheduling problem that is computationally expensive. The results are compared to the corresponding plans produced by the collaborating company using simulation. It is demonstrated that in the case considered, the Genetic Algorithm scheduling method achieves on time delivery and a 63% reduction in costs.", "publicationTitle": "International Journal of Production Economics", "publisher": "", "place": "", "date": "August 11, 2002", "volume": "78", "issue": "3", "section": "", "partNumber": "", "partTitle": "", "pages": "311-322", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "International Journal of Production Economics", "DOI": "10.1016/S0925-5273(02)00104-4", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/S0925527302001044", "accessDate": "2014-04-30T11:17:59Z", "PMID": "", "PMCID": "", "ISSN": "0925-5273", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "00108", "tags": [ { "tag": "Genetic Algorithms", "type": 1 }, { "tag": "Optimisation", "type": 1 }, { "tag": "production scheduling", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-04-30T11:17:59Z", "dateModified": "2014-05-09T10:42:05Z" } }, { "key": "E69QMRKM", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/E69QMRKM", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/E69QMRKM", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Pan and Chen", "parsedDate": "2005-05", "numChildren": 2 }, "data": { "key": "E69QMRKM", "version": 301, "itemType": "journalArticle", "title": "Mixed binary integer programming formulations for the reentrant job shop scheduling problem", "creators": [ { "creatorType": "author", "firstName": "Jason Chao-Hsien", "lastName": "Pan" }, { "creatorType": "author", "firstName": "Jen-Shiang", "lastName": "Chen" } ], "abstractNote": "This paper describes the development of mixed binary integer programming (BIP) formulations for the reentrant job shop scheduling problem. Based on an earlier classical job shop model developed by Manne and improved by Liao and You, this paper presents two extended BIP optimization formulations for the problem under consideration. In order to improve the solution speed of the BIP formulations, two layer division procedures are developed and incorporated in the corresponding models. Results of computational experiments, in which an average performance of these formulations is investigated, are also reported.", "publicationTitle": "Computers & Operations Research", "publisher": "", "place": "", "date": "May 2005", "volume": "32", "issue": "5", "section": "", "partNumber": "", "partTitle": "", "pages": "1197-1212", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Computers & Operations Research", "DOI": "10.1016/j.cor.2003.10.004", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/S0305054803003174", "accessDate": "2014-04-28T13:34:19Z", "PMID": "", "PMCID": "", "ISSN": "0305-0548", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "00050", "tags": [ { "tag": "Integer programming", "type": 1 }, { "tag": "Reentrant job shops", "type": 1 }, { "tag": "scheduling", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-04-28T13:34:19Z", "dateModified": "2014-05-09T10:42:04Z" } }, { "key": "8VBV3SAB", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/8VBV3SAB", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/8VBV3SAB", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Dorndorf and Pesch", "parsedDate": "1995-01", "numChildren": 2 }, "data": { "key": "8VBV3SAB", "version": 301, "itemType": "journalArticle", "title": "Evolution based learning in a job shop scheduling environment", "creators": [ { "creatorType": "author", "firstName": "Ulrich", "lastName": "Dorndorf" }, { "creatorType": "author", "firstName": "Erwin", "lastName": "Pesch" } ], "abstractNote": "A class of approximation algorithms is described for solving the minimum makespan problem of job shop scheduling. A common basis of these algorithms is the underlying genetic algorithm that serves as a meta-strategy to guide an optimal design of local decision rule sequences. We consider sequences of dispatching rules for job assignment as well as sequences of one machine solutions in the sense of the shifting bottleneck procedure of Adams et al. Computational experiments show that our algorithm can find shorter makespans than the shifting bottleneck heuristic or a simulated annealing approach with the same running time.", "publicationTitle": "Computers & Operations Research", "publisher": "", "place": "", "date": "January 1995", "volume": "22", "issue": "1", "section": "", "partNumber": "", "partTitle": "", "pages": "25-40", "series": "Genetic Algorithms", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Computers & Operations Research", "DOI": "10.1016/0305-0548(93)E0016-M", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/0305054893E0016M", "accessDate": "2014-04-28T10:07:50Z", "PMID": "", "PMCID": "", "ISSN": "0305-0548", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "00415", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-28T10:07:50Z", "dateModified": "2014-05-09T10:42:03Z" } }, { "key": "7SZTGGI6", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/7SZTGGI6", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/7SZTGGI6", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Missbauer and Uzsoy", "parsedDate": "2011-01-01", "numChildren": 2 }, "data": { "key": "7SZTGGI6", "version": 301, "itemType": "bookSection", "title": "Optimization Models of Production Planning Problems", "creators": [ { "creatorType": "author", "firstName": "Hubert", "lastName": "Missbauer" }, { "creatorType": "author", "firstName": "Reha", "lastName": "Uzsoy" }, { "creatorType": "editor", "firstName": "Karl G.", "lastName": "Kempf" }, { "creatorType": "editor", "firstName": "Pınar", "lastName": "Keskinocak" }, { "creatorType": "editor", "firstName": "Reha", "lastName": "Uzsoy" } ], "abstractNote": "Production planning problems have been formulated and solved as optimization problems since the early 1950s, and an extensive literature has been developed. The widespread use of Enterprise Resource Planning systems and developments in information technology and scientific computing have opened the way for even wider use of these techniques in industry. In this chapter, we review the basic formulations that have been the mainstay of academic research and industrial practice for the last five decades, assess their strengths and weaknesses, and discuss a number of interesting new directions that have emerged recently. We especially focus on models that support decisions on production volumes and order release over time and highlight the related issues on determining planned lead times.", "bookTitle": "Planning Production and Inventories in the Extended Enterprise", "series": "International Series in Operations Research & Management Science", "seriesNumber": "151", "volume": "", "numberOfVolumes": "", "edition": "", "date": "2011/01/01", "publisher": "Springer US", "place": "", "originalDate": "", "originalPublisher": "", "originalPlace": "", "format": "", "pages": "437-507", "ISBN": "978-1-4419-6484-7, 978-1-4419-6485-4", "DOI": "", "citationKey": "", "url": "http://link.springer.com/chapter/10.1007/978-1-4419-6485-4_16", "accessDate": "2014-04-30T15:53:30Z", "ISSN": "", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "en", "libraryCatalog": "link.springer.com", "callNumber": "", "rights": "©2011 Springer Science+Business Media, LLC", "extra": "00043", "tags": [ { "tag": "Production/Logistics", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-04-30T15:53:30Z", "dateModified": "2014-05-09T10:42:02Z" } }, { "key": "7FXAZSWE", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/7FXAZSWE", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/7FXAZSWE", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Suresh and Chaudhuri", "parsedDate": "1993-08", "numChildren": 2 }, "data": { "key": "7FXAZSWE", "version": 301, "itemType": "journalArticle", "title": "Dynamic scheduling—a survey of research", "creators": [ { "creatorType": "author", "firstName": "V.", "lastName": "Suresh" }, { "creatorType": "author", "firstName": "Dipak", "lastName": "Chaudhuri" } ], "abstractNote": "Scheduling can be divided into two classes, viz. predictive and reactive scheduling. Predictive scheduling addresses problems with deterministic process times and machine availability and generates a solution valid for the entire time span specified. Reactive scheduling, on the other hand, deals with the problem of maintaining schedules in a dynamic environment such as processing delays, machine breakdown, etc. In this paper a review of the research on scheduling in a dynamic environment is presented. Scheduling approaches have been classified into three categories, viz. conventional, knowledge-based and distributed problem solving.", "publicationTitle": "International Journal of Production Economics", "publisher": "", "place": "", "date": "August 1993", "volume": "32", "issue": "1", "section": "", "partNumber": "", "partTitle": "", "pages": "53-63", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "International Journal of Production Economics", "DOI": "10.1016/0925-5273(93)90007-8", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/0925527393900078", "accessDate": "2014-04-30T11:24:42Z", "PMID": "", "PMCID": "", "ISSN": "0925-5273", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "00105", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-30T11:24:42Z", "dateModified": "2014-05-09T10:42:01Z" } }, { "key": "67RIKRT9", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/67RIKRT9", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/67RIKRT9", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Gere Jr.", "parsedDate": "1966-11", "numChildren": 1 }, "data": { "key": "67RIKRT9", "version": 301, "itemType": "journalArticle", "title": "Heuristics in Job Shop Scheduling", "creators": [ { "creatorType": "author", "firstName": "William S.", "lastName": "Gere Jr." } ], "abstractNote": "The problem is that of scheduling jobs with diverse routings on the productive facilities in a shop such that the respective due dates are met, or failing this, the sum of lateness times is minimized. The approach is simulative in that the operation of the shop is simulated in a Fortran program, but in addition to the straightforward use of priority rules for determining sequences of jobs on the machines, a number of heuristics or rules of thumb are incorporated. Both the static and dynamic problems are investigated. The efficacy of a small number of heuristics in combination with certain priority rules is demonstrated.", "publicationTitle": "Management Science", "publisher": "", "place": "", "date": "November 1966", "volume": "13", "issue": "3", "section": "", "partNumber": "", "partTitle": "", "pages": "167-190", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Management Science", "DOI": "", "citationKey": "", "url": "http://search.ebscohost.com/login.aspx?direct=true&db=bth&AN=7355629&lang=pt-br&site=ehost-live", "accessDate": "2014-04-30T11:02:41Z", "PMID": "", "PMCID": "", "ISSN": "00251909", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "EBSCOhost", "callNumber": "", "rights": "", "extra": "00300", "tags": [ { "tag": "COMPUTER network resources", "type": 1 }, { "tag": "FACILITY management", "type": 1 }, { "tag": "HEURISTIC programming", "type": 1 }, { "tag": "INDUSTRIAL management", "type": 1 }, { "tag": "INVENTORIES -- Management", "type": 1 }, { "tag": "JOB orders", "type": 1 }, { "tag": "JOB shops", "type": 1 }, { "tag": "MANAGEMENT", "type": 1 }, { "tag": "Manufacturing processes", "type": 1 }, { "tag": "Operations research", "type": 1 }, { "tag": "PRODUCTION (Economic theory)", "type": 1 }, { "tag": "PRODUCTION management (Manufacturing)", "type": 1 }, { "tag": "SIMULATION methods & models", "type": 1 }, { "tag": "production scheduling", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-04-30T11:02:41Z", "dateModified": "2014-05-09T10:42:00Z" } }, { "key": "5VUUMTDV", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/5VUUMTDV", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/5VUUMTDV", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Eilon and Cotterjll", "parsedDate": "1968", "numChildren": 2 }, "data": { "key": "5VUUMTDV", "version": 301, "itemType": "journalArticle", "title": "A Modified Si Rule in Job Shop Scheduling", "creators": [ { "creatorType": "author", "firstName": "S.", "lastName": "Eilon" }, { "creatorType": "author", "firstName": "D. J.", "lastName": "Cotterjll" } ], "abstractNote": "SUMMARY A job shop is defined as a production centre consisting of several machines, each of which may be required for processing jobs of different makeups. The scheduling problem is concerned with determining the sequence in which these jobs should be processed on each machine, and this has led to several studies of alternative loading or priority rules. One rule, which has been found to be effective in reducing the average throughput time of jobs, is the SI rule, which can be described as follows: of jobs waiting in a queue to be processed on any given machine, select first the one with the shortest imminent processing time. The study described in this paper involved a simulation of a hypothetical shop with several machines. A number of alternative rules and variations on the SI rule were investigated. One modification of the SI rule called for the creation of two queues, one having a priority over the other and each queue involving an SI discipline. The decision as to which queue a job should belong to is determined by its float, which is defined as the difference between the time available until the prescribed due-date of the job and the time required for operations still outstanding. The effectiveness of this rule is investigated.", "publicationTitle": "International Journal of Production Research", "publisher": "", "place": "", "date": "1968", "volume": "7", "issue": "2", "section": "", "partNumber": "", "partTitle": "", "pages": "135-145", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.1080/00207546808929803", "citationKey": "", "url": "http://dx.doi.org/10.1080/00207546808929803", "accessDate": "2014-04-28T11:40:24Z", "PMID": "", "PMCID": "", "ISSN": "0020-7543", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "Taylor and Francis+NEJM", "callNumber": "", "rights": "", "extra": "00073", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-28T11:40:24Z", "dateModified": "2014-05-09T10:41:59Z" } }, { "key": "4VRJE6N8", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/4VRJE6N8", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/4VRJE6N8", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Jain and Meeran", "parsedDate": "1999-03", "numChildren": 2 }, "data": { "key": "4VRJE6N8", "version": 301, "itemType": "journalArticle", "title": "Deterministic job-shop scheduling: Past, present and future", "creators": [ { "creatorType": "author", "firstName": "A. S.", "lastName": "Jain" }, { "creatorType": "author", "firstName": "S.", "lastName": "Meeran" } ], "abstractNote": "Due to the stubborn nature of the deterministic job-shop scheduling problem many solutions proposed are of hybrid construction cutting across the traditional disciplines. The problem has been investigated from a variety of perspectives resulting in several analytical techniques combining generic as well as problem specific strategies. We seek to assess a subclass of this problem in which the objective is minimising makespan, by providing an overview of the history, the techniques used and the researchers involved. The sense and direction of their work is evaluated by assessing the reported results of their techniques on the available benchmark problems. From these results the current situation and pointers for future work are provided. © 1999 Elsevier Science B.V. All rights reserved.", "publicationTitle": "European Journal of Operational Research", "publisher": "", "place": "", "date": "March 1999", "volume": "113", "issue": "2", "section": "", "partNumber": "", "partTitle": "", "pages": "390-434", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "European Journal of Operational Research", "DOI": "10.1016/S0377-2217(98)00113-1", "citationKey": "", "url": "http://www.sciencedirect.com/science/article/pii/S0377221798001131", "accessDate": "2014-04-30T13:03:16Z", "PMID": "", "PMCID": "", "ISSN": "0377-2217", "archive": "", "archiveLocation": "", "shortTitle": "Deterministic job-shop scheduling", "language": "", "libraryCatalog": "ScienceDirect", "callNumber": "", "rights": "", "extra": "00625", "tags": [ { "tag": "Computational study", "type": 1 }, { "tag": "Job-shop", "type": 1 }, { "tag": "Review", "type": 1 }, { "tag": "Scheduling theory", "type": 1 } ], "collections": [], "relations": {}, "dateAdded": "2014-04-30T13:03:16Z", "dateModified": "2014-05-09T10:41:58Z" } }, { "key": "3SI6BZWC", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/3SI6BZWC", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/3SI6BZWC", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Erschler et al.", "parsedDate": "1976-08-01", "numChildren": 2 }, "data": { "key": "3SI6BZWC", "version": 301, "itemType": "journalArticle", "title": "Technical Note—Finding Some Essential Characteristics of the Feasible Solutions for a Scheduling Problem", "creators": [ { "creatorType": "author", "firstName": "J.", "lastName": "Erschler" }, { "creatorType": "author", "firstName": "F.", "lastName": "Roubellat" }, { "creatorType": "author", "firstName": "J. P.", "lastName": "Vernhes" } ], "abstractNote": "This note is concerned with some essential characteristics of the feasible solutions for a job-shop scheduling problem in which the jobs are constrained by fixed starting times and due dates. These characteristics are related to the scheduling order of operations on each machine and to the fixed starting and completion times for each operation. We present the basic principles enabling one to define these characteristics and propose a procedure for finding them.", "publicationTitle": "Operations Research", "publisher": "", "place": "", "date": "August 1, 1976", "volume": "24", "issue": "4", "section": "", "partNumber": "", "partTitle": "", "pages": "774-783", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "Operations Research", "DOI": "10.1287/opre.24.4.774", "citationKey": "", "url": "http://pubsonline.informs.org/doi/abs/10.1287/opre.24.4.774", "accessDate": "2014-04-30T12:59:00Z", "PMID": "", "PMCID": "", "ISSN": "0030-364X", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "pubsonline.informs.org (Atypon)", "callNumber": "", "rights": "", "extra": "00085", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-30T12:59:00Z", "dateModified": "2014-05-09T10:41:57Z" } }, { "key": "2B2PHMD3", "version": 301, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/2B2PHMD3", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/2B2PHMD3", "type": "text/html" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "lastModifiedByUser": { "id": 1853838, "username": "MariaLRP", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/marialrp", "type": "text/html" } } }, "creatorSummary": "Liao and You", "parsedDate": "1992", "numChildren": 1 }, "data": { "key": "2B2PHMD3", "version": 301, "itemType": "journalArticle", "title": "An Improved Formulation for the Job-Shop Scheduling Problem", "creators": [ { "creatorType": "author", "firstName": "Ching-Jong", "lastName": "Liao" }, { "creatorType": "author", "firstName": "Chii-Tsuen", "lastName": "You" } ], "abstractNote": "", "publicationTitle": "The Journal of the Operational Research Society", "publisher": "", "place": "", "date": "11/1992", "volume": "43", "issue": "11", "section": "", "partNumber": "", "partTitle": "", "pages": "1047", "series": "", "seriesTitle": "", "seriesText": "", "journalAbbreviation": "", "DOI": "10.2307/2584101", "citationKey": "", "url": "http://www.jstor.org/discover/10.2307/2584101?uid=3738880&uid=3739696&uid=2&uid=4&uid=3739256&sid=21103711512011", "accessDate": "2014-04-28T14:27:17Z", "PMID": "", "PMCID": "", "ISSN": "01605682", "archive": "", "archiveLocation": "", "shortTitle": "", "language": "", "libraryCatalog": "CrossRef", "callNumber": "", "rights": "", "extra": "00050", "tags": [], "collections": [], "relations": {}, "dateAdded": "2014-04-28T14:27:17Z", "dateModified": "2014-05-09T10:41:55Z" } }, { "key": "PQBFDUFT", "version": 298, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/PQBFDUFT", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/PQBFDUFT", "type": "text/html" }, "up": { "href": "https://api.zotero.org/groups/246019/items/7SZTGGI6", "type": "application/json" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "numChildren": 0 }, "data": { "key": "PQBFDUFT", "version": 298, "parentItem": "7SZTGGI6", "itemType": "attachment", "linkMode": "imported_url", "title": "Full Text PDF", "accessDate": "2014-04-30T15:53:30Z", "url": "http://link.springer.com/content/pdf/10.1007%2F978-1-4419-6485-4_16.pdf", "note": "", "contentType": "application/pdf", "charset": "", "filename": "Missbauer e Uzsoy - 2011 - Optimization Models of Production Planning Problem.pdf", "md5": "42696a7adfc7ec4e3d0c829239736fd4", "mtime": 1398873220300, "tags": [], "relations": {}, "dateAdded": "2014-04-30T15:53:30Z", "dateModified": "2014-04-30T15:53:40Z" } }, { "key": "EZDWH5F8", "version": 298, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/EZDWH5F8", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/EZDWH5F8", "type": "text/html" }, "up": { "href": "https://api.zotero.org/groups/246019/items/7SZTGGI6", "type": "application/json" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } } }, "data": { "key": "EZDWH5F8", "version": 298, "parentItem": "7SZTGGI6", "itemType": "attachment", "linkMode": "imported_url", "title": "Snapshot", "accessDate": "2014-04-30T15:53:32Z", "url": "http://link.springer.com/chapter/10.1007/978-1-4419-6485-4_16", "note": "", "contentType": "text/html", "charset": "utf-8", "filename": "978-1-4419-6485-4_16.html", "md5": "86ba1f58e6d48ccf86d9b2b130ed97a0", "mtime": 1398873212900, "tags": [], "relations": {}, "dateAdded": "2014-04-30T15:53:32Z", "dateModified": "2014-04-30T15:53:32Z" } }, { "key": "EBZJWT28", "version": 296, "library": { "type": "group", "id": 246019, "name": "SIM&OPT", "links": { "alternate": { "href": "https://www.zotero.org/groups/simopt", "type": "text/html" } } }, "links": { "self": { "href": "https://api.zotero.org/groups/246019/items/EBZJWT28", "type": "application/json" }, "alternate": { "href": "https://www.zotero.org/groups/simopt/items/EBZJWT28", "type": "text/html" }, "up": { "href": "https://api.zotero.org/groups/246019/items/SFBXQHDZ", "type": "application/json" } }, "meta": { "createdByUser": { "id": 192756, "username": "smoniz", "name": "", "links": { "alternate": { "href": "https://www.zotero.org/smoniz", "type": "text/html" } } }, "numChildren": 0 }, "data": { "key": "EBZJWT28", "version": 296, "parentItem": "SFBXQHDZ", "itemType": "attachment", "linkMode": "imported_url", "title": "ScienceDirect Full Text PDF", "accessDate": "2014-04-30T15:33:51Z", "url": "http://www.sciencedirect.com/science/article/pii/S0305054806001614/pdfft?md5=e04107d8461dd55188640fe236ce7c99&pid=1-s2.0-S0305054806001614-main.pdf", "note": "", "contentType": "application/pdf", "charset": "", "filename": "Rocha et al. - 2008 - Exact algorithms for a scheduling problem with unr.pdf", "md5": "58105600b3450899d81a9c2b435acca9", "mtime": 1398872036112, "tags": [], "relations": {}, "dateAdded": "2014-04-30T15:33:51Z", "dateModified": "2014-04-30T15:33:56Z" } } ]