<![CDATA[ProQuest: Management Production management ]]> http://proquest.umi.com/pqdweb?op1=OR&op6=AND&opcompany=AND&date=ALL&h_pub_title=&searchinterface=1&h_pmid2=&oppubtitle=AND&opname=AND&pubtitle=&ts=1105728564&sq1=&moreoptstate=CLOSED&opgeo=AND&rqt=512&sq2=&vinst=PROD&op2=OR&peerreviewd=1&dbid=3&stype=all&opsic=AND&h_pmid1=&op4=AND&vtype=PQD&geo=&h_pub_title5=&op5=AND&fo2=SUB&h_pub_title4=&h_pmid7=&ondate=&afterdate=&beforedate=&opsubject=AND&h_pmid=&fromdate=&fo5=BITXT&op3=OR&sq=53*&h_pub_title3=&pagesize=10&company=&sq3=&fo4=CC&h_pub_title6=&opcc=AND&h_pmid5=&fo3=SUB&fo1=SUB&h_pub_title1=&name=&h_pmid4=&todate=&sic=&searchbuttonimage.y=12&sq5=&fo6=BITXT&cc=&h_pmid3=&sq4=&fo=CC&clientid=20&querysyntax=PQ&searchbuttonimage.x=26&vname=PQD&revpos=all&at=any&sortby=REVERSE_CHRON&h_pmid6=&revtype=review&h_pub_title7=&h_pub_title2=&subject=&sq6=&opat=AND en-us Copyright 2009 ProQuest LLC. All rights reserved. http://blogs.law.harvard.edu/tech/rss 1140 http://proquest.umi.com/images/common/logo_proquest.gif <![CDATA[ProQuest: Management Production management ]]> http://proquest.umi.com/pqdweb?op1=OR&op6=AND&opcompany=AND&date=ALL&h_pub_title=&searchinterface=1&h_pmid2=&oppubtitle=AND&opname=AND&pubtitle=&ts=1105728564&sq1=&moreoptstate=CLOSED&opgeo=AND&rqt=512&sq2=&vinst=PROD&op2=OR&peerreviewd=1&dbid=3&stype=all&opsic=AND&h_pmid1=&op4=AND&vtype=PQD&geo=&h_pub_title5=&op5=AND&fo2=SUB&h_pub_title4=&h_pmid7=&ondate=&afterdate=&beforedate=&opsubject=AND&h_pmid=&fromdate=&fo5=BITXT&op3=OR&sq=53*&h_pub_title3=&pagesize=10&company=&sq3=&fo4=CC&h_pub_title6=&opcc=AND&h_pmid5=&fo3=SUB&fo1=SUB&h_pub_title1=&name=&h_pmid4=&todate=&sic=&searchbuttonimage.y=12&sq5=&fo6=BITXT&cc=&h_pmid3=&sq4=&fo=CC&clientid=20&querysyntax=PQ&searchbuttonimage.x=26&vname=PQD&revpos=all&at=any&sortby=REVERSE_CHRON&h_pmid6=&revtype=review&h_pub_title7=&h_pub_title2=&subject=&sq6=&opat=AND Sat, 7 Nov 2009 03:30:44 EST Sat, 7 Nov 2009 03:30:44 EST <![CDATA[ Balancing assembly lines with variable parallel workplaces: Problem definition and effective solution procedure]]> Available Formats: Abstract]]> http://proquest.umi.com/pqdweb?index=0&did=1719229311&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 Sat, 7 Nov 2009 03:30:44 EST /pqdweb?index=0&did=1719229311&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 <![CDATA[ Minimizing the number of machines for scheduling jobs with equal processing times]]> Available Formats: Abstract]]> http://proquest.umi.com/pqdweb?index=1&did=1719229511&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 Sat, 7 Nov 2009 03:30:44 EST /pqdweb?index=1&did=1719229511&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 <![CDATA[ Minimizing total tardiness on a two-machine re-entrant flowshop]]> Available Formats: Abstract]]> http://proquest.umi.com/pqdweb?index=2&did=1719229321&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 Sat, 7 Nov 2009 03:30:44 EST /pqdweb?index=2&did=1719229321&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 <![CDATA[ Optimal policy for a dynamic, non-stationary, stochastic inventory problem with capacity commitment]]> Available Formats: Abstract]]> http://proquest.umi.com/pqdweb?index=3&did=1719229341&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 Sat, 7 Nov 2009 03:30:44 EST /pqdweb?index=3&did=1719229341&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 <![CDATA[ Single and multi-period optimal inventory control models with risk-averse constraints]]> Available Formats: Abstract]]> http://proquest.umi.com/pqdweb?index=4&did=1719229361&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 Sat, 7 Nov 2009 03:30:44 EST /pqdweb?index=4&did=1719229361&SrchMode=1&sid=1&Fmt=2&VInst=PROD&VType=PQD&RQT=309&VName=PQD&TS=1257579262&clientId=20 <![CDATA[View more documents]]> http://proquest.umi.com/pqdweb?op1=OR&op6=AND&opcompany=AND&date=ALL&h_pub_title=&searchinterface=1&h_pmid2=&oppubtitle=AND&opname=AND&pubtitle=&ts=1105728564&sq1=&moreoptstate=CLOSED&opgeo=AND&rqt=512&sq2=&vinst=PROD&op2=OR&peerreviewd=1&dbid=3&stype=all&opsic=AND&h_pmid1=&op4=AND&vtype=PQD&geo=&h_pub_title5=&op5=AND&fo2=SUB&h_pub_title4=&h_pmid7=&ondate=&afterdate=&beforedate=&opsubject=AND&h_pmid=&fromdate=&fo5=BITXT&op3=OR&sq=53*&h_pub_title3=&pagesize=10&company=&sq3=&fo4=CC&h_pub_title6=&opcc=AND&h_pmid5=&fo3=SUB&fo1=SUB&h_pub_title1=&name=&h_pmid4=&todate=&sic=&searchbuttonimage.y=12&sq5=&fo6=BITXT&cc=&h_pmid3=&sq4=&fo=CC&clientid=20&querysyntax=PQ&searchbuttonimage.x=26&vname=PQD&revpos=all&at=any&sortby=REVERSE_CHRON&h_pmid6=&revtype=review&h_pub_title7=&h_pub_title2=&subject=&sq6=&opat=AND Sat, 7 Nov 2009 03:29:44 EST http://proquest.umi.com/pqdweb?op1=OR&op6=AND&opcompany=AND&date=ALL&h_pub_title=&searchinterface=1&h_pmid2=&oppubtitle=AND&opname=AND&pubtitle=&ts=1105728564&sq1=&moreoptstate=CLOSED&opgeo=AND&rqt=512&sq2=&vinst=PROD&op2=OR&peerreviewd=1&dbid=3&stype=all&opsic=AND&h_pmid1=&op4=AND&vtype=PQD&geo=&h_pub_title5=&op5=AND&fo2=SUB&h_pub_title4=&h_pmid7=&ondate=&afterdate=&beforedate=&opsubject=AND&h_pmid=&fromdate=&fo5=BITXT&op3=OR&sq=53*&h_pub_title3=&pagesize=10&company=&sq3=&fo4=CC&h_pub_title6=&opcc=AND&h_pmid5=&fo3=SUB&fo1=SUB&h_pub_title1=&name=&h_pmid4=&todate=&sic=&searchbuttonimage.y=12&sq5=&fo6=BITXT&cc=&h_pmid3=&sq4=&fo=CC&clientid=20&querysyntax=PQ&searchbuttonimage.x=26&vname=PQD&revpos=all&at=any&sortby=REVERSE_CHRON&h_pmid6=&revtype=review&h_pub_title7=&h_pub_title2=&subject=&sq6=&opat=AND