Research Initiation:  Efficient Algorithms for Some Product-ion Planning Problems
{'Code': '07030000', 'Directorate': {'Abbreviation': 'ENG', 'LongName': 'Directorate For Engineering'}, 'Division': {'Abbreviation': 'CMMI', 'LongName': 'Div Of Civil, Mechanical, & Manufact Inn'}}
{'SignBlockName': 'F. Hank Grant', 'PO_EMAI': None, 'PO_PHON': None}
This research addresses two problems.  First, how does one plan                 production for an indefinite period when demands and costs can be               forecast only for a relatively short period in the future?  Second, how         can a production planner schedule work on several different items on            the same machine to minimize cost (the Economic Lot Scheduling                  Problem)?  Efficient algorithms will be developed for the solution of           variations of these problems.
{'FirstName': 'Chung-Yee', 'LastName': 'Lee', 'PI_MID_INIT': None, 'PI_SUFX_NAME': None, 'PI_FULL_NAME': 'Chung-Yee Lee', 'EmailAddress': None, 'NSF_ID': '000298928', 'StartDate': '09/01/1985', 'EndDate': None, 'RoleCode': 'Principal Investigator'}
{'Name': 'University of Florida', 'CityName': 'GAINESVILLE', 'ZipCode': '326111941', 'PhoneNumber': '3523923516', 'StreetAddress': '1523 UNION RD RM 207', 'StreetAddress2': None, 'CountryName': 'United States', 'StateName': 'Florida', 'StateCode': 'FL', 'CONGRESSDISTRICT': '03', 'CONGRESS_DISTRICT_ORG': 'FL03', 'ORG_UEI_NUM': 'NNFQH1JAPEP3', 'ORG_LGL_BUS_NAME': 'UNIVERSITY OF FLORIDA', 'ORG_PRNT_UEI_NUM': None}
{'Name': None, 'CityName': None, 'StateCode': None, 'ZipCode': None, 'StreetAddress': None, 'CountryCode': None, 'CountryName': None, 'StateName': None, 'CountryFlag': None, 'CONGRESSDISTRICT': None, 'CONGRESS_DISTRICT_PERF': '""'}
{'Code': '551400', 'Text': 'OPERATIONS RESEARCH'}
{'url': 'https://www.nsf.gov/awardsearch/download?DownloadFileName=1985&All=true', 'xml': '8504786.xml'}