A decomposition approach for the project scheduling problem.

Bibliographic Details
Main Author: Pinto Langoni, Carlos Ricardo
Other Authors: Curry, Guy L. (degree committee member.), Olson, David L. (degree committee member.), Shannon, Robert E. (degree committee member.)
Format: Thesis Book
Language:English
Published: 1987.
Subjects:
Online Access:Link to ProQuest copy
Link to OAKTrust copy

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000ctm a2200000Ia 4500
001 in00000009534
005 20220104090738.0
008 880328s1987 xx a bm 000 0 eng d
035 |9 AAA3902AM 
035 |a (OCoLC)17688318 
035 |a (OCoLC)ocm17688318 
040 |a TXA  |b eng  |c TXA  |d OCL  |d OCLCQ  |d OCLCF  |d OCLCO  |d OCLCQ  |d TXA 
049 |a TXAM 
099 |a 1987  |a Disservtation  |a P659 
100 1 |a Pinto Langoni, Carlos Ricardo. 
245 1 2 |a A decomposition approach for the project scheduling problem. 
264 1 |c 1987. 
300 |a ix, 157 leaves :  |b illustrations ;  |c 29 cm 
336 |a text  |b txt  |2 rdacontent 
337 |a unmediated  |b n  |2 rdamedia 
338 |a volume  |b nc  |2 rdacarrier 
500 |a Typescript (photocopy). 
500 |a Vita. 
502 |b Ph. D. in Industrial Engineering  |c Texas A & M University  |d 1987 
504 |a Includes bibliographical references (leaves 73-79). 
520 3 |a The problem addressed in this research is the project scheduling problem. Two types of solution methodologies commonly discussed in the literature are optimization procedures and heuristic ranking procedures. Optimization procedures are only capable of solving problems of moderate size. Heuristic ranking procedures, on the other hand, can handle problems of virtually any size. However, results reported in the literature demonstrate that no single priority rule is a consistent best performer when applied to problems with different characteristics. Based on this research, a heuristic decomposition procedure which shows promise as a more consistent performer than heuristic ranking procedures is developed. In this procedure, a sequence of subproblems is generated and resource conflicts among activities in each subproblem are optimally resolved. Some limited computational experience with the method is reported. 
650 0 |a Production scheduling. 
650 0 |a Production scheduling  |x Data processing. 
650 0 |a Project management  |x Data processing. 
650 4 |a Major industrial engineering. 
655 7 |a Academic theses  |2 lcgft 
700 1 |a Curry, Guy L.,  |e degree committee member. 
700 1 |a Deuermeyer, Bryan L.,  |e degree supervisor. 
700 1 |a Olson, David L.,  |e degree committee member. 
700 1 |a Shannon, Robert E.,  |e degree committee member. 
710 2 |a Texas A & M University,  |e degree granting institution. 
856 4 1 |u http://proxy.library.tamu.edu/login?url=http://proquest.umi.com/pqdweb?did=754020441&sid=1&Fmt=2&clientId=2945&RQT=309&VName=PQD  |z Link to ProQuest copy  |t 0 
856 4 1 |u https://hdl.handle.net/1969.1/DISSERTATIONS-17725  |z Link to OAKTrust copy  |t 0 
994 |a C0  |b TXA 
999 f f |s 6af3f0e1-cff9-33b1-ac2f-74fcd5b0287f  |i c22e1110-156e-3fb5-bdbe-6b2c082ebcbc  |t 0 
952 f f |p noncirc  |a Texas A&M University  |b J.J. Pickle Campus  |c High Density Repository  |s HDR  |d Remote Storage  |t 0  |e 1987 Dissertation P659  |h Other scheme  |i unmediated -- volume  |m A14839622739 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |s www_evans  |d Available Online  |t 0  |e 1987 Dissertation P659  |h Other scheme 
998 f f |a 1987 Dissertation P659  |t 0  |l Remote Storage 
998 f f |a 1987 Dissertation P659  |t 0  |l Available Online