{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,6]],"date-time":"2024-06-06T07:14:26Z","timestamp":1717658066915},"reference-count":57,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[1999,1]]},"DOI":"10.1016\/s0377-2217(97)00394-9","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:21:01Z","timestamp":1049502061000},"page":"54-80","source":"Crossref","is-referenced-by-count":14,"title":["Formulating and solving production planning problems"],"prefix":"10.1016","volume":"112","author":[{"given":"Larry J.","family":"LeBlanc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Avraham","family":"Shtub","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Anandalingam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00394-9_BIB1","unstructured":"Aarts, E., Korst, J., 1989. Simulated Annealing and Boltzmann Machines, Wiley, Chichester, UK"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB2","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1287\/mnsc.37.1.98","article-title":"Constructing school timetables using simulated annealing: Sequential and parallel algorithms","volume":"37","author":"Abramson","year":"1991","journal-title":"Management Science"},{"issue":"8","key":"10.1016\/S0377-2217(97)00394-9_BIB3","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1016\/0305-0548(94)90020-5","article-title":"Genetic learning of dynamic scheduling within a simulation environment","volume":"21","author":"Aytug","year":"1994","journal-title":"Computers and Operations Research"},{"issue":"5","key":"10.1016\/S0377-2217(97)00394-9_BIB4","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero\u2013one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Operations Research"},{"issue":"3","key":"10.1016\/S0377-2217(97)00394-9_BIB5","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1287\/opre.29.3.448","article-title":"A new optimization method for large scale fixed charge transportation problems","volume":"29","author":"Barr","year":"1981","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB6","unstructured":"Bazarra, M., Shetty, C.M., 1979. Nonlinear Programming: Theory and Algorithms, Wiley, New York"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB7","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0377-2217(95)00149-2","article-title":"A simulated annealing approach for the one machine mean tardiness scheduling problem","volume":"93","author":"Ben-Daya","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"1\u20134","key":"10.1016\/S0377-2217(97)00394-9_BIB8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1016\/0360-8352(90)90082-W","article-title":"Genetic algorithms and job shop scheduling","volume":"19","author":"Biegel","year":"1990","journal-title":"Computers and Industrial Engineering"},{"issue":"4","key":"10.1016\/S0377-2217(97)00394-9_BIB9","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1080\/07408179008964184","article-title":"Production scheduling during phased implementation of flexible manufacturing cells","volume":"22","author":"Chakravarty","year":"1990","journal-title":"IIE Transactions"},{"issue":"3","key":"10.1016\/S0377-2217(97)00394-9_BIB10","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1109\/43.75631","article-title":"Distributed genetic algorithms for the floorplan design problem","volume":"10","author":"Cohoon","year":"1991","journal-title":"IEEE Transactions on Computer-Aided Design"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB11","unstructured":"Coit, D., Smith, A., Tate, D., 1994. Constrained Genetic Optimization Using an Adaptive Penalty Function, presented at Detroit ORSA\/TIMS (WA26.2)"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB12","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/0377-2217(90)90301-Q","article-title":"An improved annealing scheme for the QAP","volume":"46","author":"Connolly","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB13","unstructured":"Davis, L., 1985. Job shop scheduling with genetic algorithms. Proceedings for an International Conference on Genetic Algorithms and Their Applications, pp. 136\u2013140"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB14","unstructured":"Davis, L., Coombs, S., 1987. Genetic algorithms and communications link speed design. Proceedings for the Second International Conference on Genetic Algorithms and Their Applications, pp. 252\u2013256"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB15","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1287\/ijoc.3.4.275","article-title":"Optimizing interconnection of local area networks: A simulated annealing approach","volume":"3","author":"Fetterolf","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB16","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/BF02094334","article-title":"Optimal design of LAN\u2013WAN internetworks","volume":"36","author":"Fetterolf","year":"1992","journal-title":"Annals of Operations Research"},{"issue":"6","key":"10.1016\/S0377-2217(97)00394-9_BIB17","first-page":"18","article-title":"A simulated annealing approach to the network design problem with variational inequality constraints","volume":"2","author":"Friesz","year":"1993","journal-title":"Transportation Science"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB18","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/0360-8352(94)90337-9","article-title":"A simulated annealing heuristic for scheduling in a flowshop with bicriteria","volume":"27","author":"Gangadharan","year":"1994","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB19","unstructured":"Gavish, B., Pirkul, H., 1982. Allocation of databases and processors in a distributed computing system. In: Akoka, J. (Ed.), Management of Distributed Data Processing. North Holland, Amsterdam"},{"issue":"7","key":"10.1016\/S0377-2217(97)00394-9_BIB20","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1109\/TC.1986.1676799","article-title":"Computer and database location in distributed computer systems","volume":"35","author":"Gavish","year":"1986","journal-title":"IEEE Transactions on Computers"},{"issue":"6","key":"10.1016\/S0377-2217(97)00394-9_BIB21","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1287\/mnsc.37.6.695","article-title":"Algorithms for the multi-resource generalized assignment problem","volume":"36","author":"Gavish","year":"1991","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB22","unstructured":"Goldberg, D.E., 1989. Genetic algorithms in search. Optimization and Machine Learning. Adison-Wesley, Reading, 2nd ed."},{"key":"10.1016\/S0377-2217(97)00394-9_BIB23","unstructured":"Hadj-Alouane, A.B., Bean, J.C., 1993. A Genetic Algorithm for the Multiple-Choice Integer Program. Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2117, Technical Report 92-50"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB24","unstructured":"Hadj-Alouane, A.B., Bean, J.C., Murty, K., 1993. A Hybrid Genetic\/Optimization Algorithm for the Task Allocation Problem, Department of Industrial and Operations Engineering, The University of Michigan, Ann Arbor, MI 48109-2117, Technical Report 93-30"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB25","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1287\/moor.13.2.311","article-title":"Cooling schedules for optimal annealing","volume":"3","author":"Hajek","year":"1988","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB26","unstructured":"Hillier, F.S., Lieberman, G.J., 1980. Operations Research, 3rd ed., Holden-Day, San Francisco"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB27","doi-asserted-by":"crossref","unstructured":"Hou, E.S.H., Li, H.Y., 1991. Task Scheduling for Flexible Manufacturing Systems Based on Genetic Algorithms. Proceedings of the 1991 IEEE International Conference on Systems, Man, and Cybernetics, pp. 397\u2013402","DOI":"10.1109\/ICSMC.1991.169717"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB28","unstructured":"Huang, M., Romeo, F., Sangiovanni-Vincentelli, A.L., 1986. An Efficient Cooling Schedule for Simulated Annealing. Proceedings of International Conference on Computer Aided Design, Santa-Clara, CA, pp. 381\u2013384"},{"issue":"6","key":"10.1016\/S0377-2217(97)00394-9_BIB29","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1287\/opre.37.6.865","article-title":"Optimization by simulated annealing: An experimental evaluation, Part 1","volume":"37","author":"Johnson","year":"1989","journal-title":"Graph Partitioning, Operations Research"},{"issue":"1\u20134","key":"10.1016\/S0377-2217(97)00394-9_BIB30","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/0360-8352(94)90338-7","article-title":"A method for maintenance scheduling using GA combined with SA","volume":"27","author":"Kim","year":"1994","journal-title":"Computers and Industrial Engineering"},{"issue":"9","key":"10.1016\/S0377-2217(97)00394-9_BIB31","doi-asserted-by":"crossref","first-page":"857","DOI":"10.1016\/0305-0548(95)00079-8","article-title":"Simulated annealing and genetic algorithms for scheduling products with multi-level product structure","volume":"23","author":"Kim","year":"1996","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB32","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB33","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0305-0548(79)90028-5","article-title":"An effective subgradient algorithm for the generalized assignment problem","volume":"6","author":"Klastorin","year":"1979","journal-title":"Computers and Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00394-9_BIB34","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/0166-3615(96)00043-7","article-title":"A genetic algorithm for job shop scheduling: A case study","volume":"31","author":"Kumar","year":"1996","journal-title":"Computers in Industry"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB35","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01582166","article-title":"Convergence of an annealing algorithm","volume":"34","author":"Lundy","year":"1986","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/S0377-2217(97)00394-9_BIB36","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/0377-2217(77)90024-8","article-title":"An upper bound for the zero\u2013one knapsack problem and a branch and bound algorithm","volume":"1","author":"Martello","year":"1977","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1051\/ro\/1994280100011","article-title":"Genetic algorithm based approach to bilevel linear programming","volume":"28","author":"Mathieu","year":"1994","journal-title":"RAIRO-Recherche Operationelle"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB38","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculation by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"Journal of Chemical Physics"},{"issue":"4","key":"10.1016\/S0377-2217(97)00394-9_BIB39","doi-asserted-by":"crossref","first-page":"1061","DOI":"10.1016\/0360-8352(96)00053-8","article-title":"Genetic algorithms for flow shop scheduling problems","volume":"30","author":"Murata","year":"1996","journal-title":"Computers and Industrial Engineering"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB40","unstructured":"Murphy, R.A., 1986. A Private Fleet Model with Multi-Stop Backhaul, Working Paper 103, Optimal Decision Systems, Green Bay, WI 54306"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB41","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","article-title":"An efficient algorithm for the 0\u20131 knapsack problem","volume":"23","author":"Nauss","year":"1976","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB42","doi-asserted-by":"crossref","unstructured":"Ohno, T., 1988. Toyota Production System, Beyond Large-Scale Production. Productivity Press, Cambridge","DOI":"10.4324\/9780429273018"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB43","unstructured":"Otten, R., Van Ginnekan, L., 1984. Floorplan Design Using SA. Proceedings of IEEE Conference on Computer Aided Design, Santa Clara, CA, 96\u201398"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB44","unstructured":"Pearl, J., 1984. Heuristics: Intelligent Search Strategies for Computer Problem Solving. Addison-Wesley, Reading"},{"issue":"3","key":"10.1016\/S0377-2217(97)00394-9_BIB45","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/0377-2217(86)90142-6","article-title":"An integer programming model for the allocation of databases in a distributed computer system","volume":"26","author":"Pirkul","year":"1986","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(97)00394-9_BIB46","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0166-3615(95)00003-M","article-title":"A global optimization model for ship design","volume":"26","author":"Ray","year":"1995","journal-title":"Computers in Industry"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB47","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0305-0548(93)E0014-K","article-title":"A genetic algorithm for flowshop sequencing","volume":"22","author":"Reeves","year":"1995","journal-title":"Computers and Operations Research"},{"issue":"5","key":"10.1016\/S0377-2217(97)00394-9_BIB48","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/0305-0548(90)90051-8","article-title":"Methods for the one-dimensional space allocation problem","volume":"17","author":"Romero","year":"1990","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB49","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01580430","article-title":"A branch and bound algorithm for the generalized assignment problem","volume":"8","author":"Ross","year":"1975","journal-title":"Mathematical Programming"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB50","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/07408179508936714","article-title":"Evaluating assembly sequences for automobile assembly systems","volume":"27","author":"Schmidt","year":"1995","journal-title":"IIE Transactions"},{"key":"10.1016\/S0377-2217(97)00394-9_BIB51","doi-asserted-by":"crossref","unstructured":"Sieglemann, H.T., Frieder, O., 1991. The allocation of documents in multiprocessor information retrieval systems: An application of genetic algorithms. Proceedings of the 1991 IEEE International Conference on Systems, Man, and Cybernetics, pp. 645\u2013650","DOI":"10.1109\/ICSMC.1991.169758"},{"issue":"2","key":"10.1016\/S0377-2217(97)00394-9_BIB52","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/0377-2217(96)00040-9","article-title":"Tactical heuristic versus Hopfield neural network approaches to a car sequencing problem","volume":"93","author":"Smith","year":"1996","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(97)00394-9_BIB53","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0377-2217(92)90084-M","article-title":"Simulated annealing applied to the processor allocation problem","volume":"60","author":"Sofianopoulos","year":"1992","journal-title":"European Journal of Operational Research"},{"issue":"2\u20133","key":"10.1016\/S0377-2217(97)00394-9_BIB54","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0166-3615(91)90031-4","article-title":"Genetic algorithms in process planning","volume":"17","author":"Vancza","year":"1991","journal-title":"Computers In Industry"},{"issue":"4","key":"10.1016\/S0377-2217(97)00394-9_BIB55","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0305-0548(90)90016-Z","article-title":"Optimization of resource location in hierarchical computer networks","volume":"17","author":"Vernekar","year":"1990","journal-title":"Computers and Operations Research"},{"issue":"1","key":"10.1016\/S0377-2217(97)00394-9_BIB56","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1080\/07408178708975376","article-title":"Solving quadratic assignment problems by simulated annealing","volume":"9","author":"Wilhelm","year":"1987","journal-title":"IIE Transactions"},{"issue":"3","key":"10.1016\/S0377-2217(97)00394-9_BIB57","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1016\/0377-2217(94)00021-4","article-title":"Minimizing makespan for flowshop scheduling by combining simulated annealing with sequencing knowledge","volume":"85","author":"Zegordi","year":"1995","journal-title":"European Journal of Operational Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003949?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797003949?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,13]],"date-time":"2020-01-13T04:42:57Z","timestamp":1578890577000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797003949"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0377221797003949"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00394-9","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}