ebooks logo journals logo reference works logo abstract databases logo
bullet  SIGN IN Register | Why Register? | Got a Voucher? alerts   marked lists   shopping cart 

informaworld

HOME   |   SEARCH   |   BROWSE
    Issues List       Latest Issue       Volume 39 Issue 10       Aims & Scope       Editorial Board       Instructions for Authors       Subscribe      
<< earliestearliest   < prevprev   Issue listissues   next >next   latest >>latest
Publisher Logo Publication Cover
Search within this journal
select-down Click for help
ORIGINAL ARTICLES
Exact and approximate algorithms for part-machine clustering based on a relationship between interval graphs and Robinson matrices
Michael J. Brusco; Douglas Steinley
Pages 925 – 935
Abstract | References | Full Text PDF | Full Text HTML | Request Permissions
Related Articles
Free Online Access FREE
Sequencing with limited flexibility
Maher Lahmar; Saif Benjaafar
Pages 937 – 955
Abstract | References | Full Text PDF | Full Text HTML | Request Permissions
Related Articles
Free Online Access FREE
An effective methodology for the stochastic project compression problem
Gary Mitchell; Ted Klastorin
Pages 957 – 969
Abstract | References | Full Text PDF | Full Text HTML | Request Permissions
Related Articles
Free Online Access FREE
A very large scale neighborhood search algorithm for the q-mode problem
Girish Kulkarni; Yahya Fathi
Pages 971 – 984
Abstract | References | Full Text PDF | Full Text HTML | Request Permissions
Related Articles
Free Online Access FREE
Approximate mean waiting time in a GI/D/1 queue with autocorrelated times to failures
Bariş Balcio�lu;  David L. Jagerman; Tayfur Altiok
Pages 985 – 996
Abstract | References | Full Text PDF | Full Text HTML | Request Permissions
Related Articles
Free Online Access FREE
select-up

Privacy Policy | Terms & Conditions | Accessibility | RSS
FAQs in: English . Français . Español . 中文(简体和繁體)
© 2009 Informa plc