Adaptable search neighborhoods for Resource Constrained Scheduling /

Resource Constrained Scheduling problem (RCSP) is a scheduling problem in which each activity may require more than one resource and resources may not be available in the same quantity throughout the planning period. This thesis describes a methodology for RCS that can be easily adapted to consider...

Full description

Bibliographic Details
Main Author: Balakrishnan, Ramamoorthy, 1969-
Format: Thesis eBook
Language:English
Published: [Place of publication not identified] : [publisher not identified] ; 1993.
Subjects:
Online Access:Link to OAKTrust copy

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000ctm a22000005a 4500
001 in00001292002
005 20220103113944.0
007 cr unu a
008 960502s1993 xx b 000 0 eng d
035 |9 AGZ9264AM 
035 |a (OCoLC)34667816 
040 |a TXA  |c TXA  |d UtOrBLW 
049 |a TXAM  |a TXAR 
099 |a 1993  |a Thesis  |a B1703 
100 1 |a Balakrishnan, Ramamoorthy,  |d 1969- 
245 1 0 |a Adaptable search neighborhoods for Resource Constrained Scheduling /  |c by Ramamoorthy Balakrishnan. 
264 1 |a [Place of publication not identified] :  |b [publisher not identified] ;  |c 1993. 
300 |a vi, 64 leaves ;  |c 28 cm. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a "Major subject: Industrial Engineering". 
500 |a Vita. 
502 |b M.S.  |c Texas A&M University  |d 1993. 
504 |a Includes bibliographical references. 
520 |a Resource Constrained Scheduling problem (RCSP) is a scheduling problem in which each activity may require more than one resource and resources may not be available in the same quantity throughout the planning period. This thesis describes a methodology for RCS that can be easily adapted to consider different regular measures of performance. The solution approach is based on the generation of strong search neighborhoods using methods recently published in the literature. Computational results are encouraging when searching these spaces using simple local search techniques and genetic algorithms. Close-to-optimal solutions are found for standard problems from the literature. A special case of RCSP, the flexible flow line (FFL) scheduling problem, is also studied. Computational results on some real industrial data produced close-to-optimal solutions. In both cases (RCS and FFL), the performance measures used to the test the procedures are makespan and mean tardiness. 
530 |a Also available online. 
650 4 |a Major industrial engineering. 
856 4 1 |u https://hdl.handle.net/1969.1/ETD-TAMU-1993-THESIS-B1703  |z Link to OAKTrust copy  |t 0 
999 |a MARS 
999 f f |s f31eae6e-0da2-338f-9926-29d85da023f6  |i 5afeec53-9f03-3f6c-8ad4-982de1e21ea1  |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 1993 Thesis B1703  |h Other scheme  |i computer -- online resource  |m A14841050891 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |s www_evans  |d Available Online  |t 0  |e 1993 Thesis B1703  |h Other scheme 
998 f f |a 1993 Thesis B1703  |t 0  |l Remote Storage 
998 f f |a 1993 Thesis B1703  |t 0  |l Available Online