Toggle Main Menu Toggle Search

Open Access padlockePrints

A robust approach to jobshop scheduling problems in the marine environment

Lookup NU author(s): John Dalton, Jonathan McGregor, Emeritus Professor Pratyush Sen, Dr Farhad Kenevissi

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

In industry the scheduling of large made-to-order products, such as submarines or ships, is typically implemented using precise time intervals. As a result of this, schedules rarely if ever reflect reality, and this can make the task of managing large projects difficult and potentially costly. Not surprisingly, robustness is a desired property of a schedule, bringing with it a greater stability with less uncertainty. In addressing these problems, this paper first describes a practical jobshop model that is then extended to allow the inclusion of imprecise durations. By implementing this methodology on an industrial case study, a submarine pressure hull, a means of gauging and providing greater robustness of scheduling is determined. This investigation into robustness also shows that improvements can be made by optimizing pessimistic duration times in contrast to the common practice of using optimistic times.


Publication metadata

Author(s): Dalton JA, McGregor JI, Sen P, Kenevissi F

Publication type: Article

Publication status: Published

Journal: Journal of Ship Production

Year: 2005

Volume: 21

Issue: 3

Pages: 177-185

Print publication date: 01/08/2005

ISSN (print): 8756-1417

ISSN (electronic): 1542-0469

Publisher: Society of Naval Architects and Marine Engineers

URL: http://www.scopus.com/record/display.url?eid=2-s2.0-24344439194&origin=resultslist&sort=plf-f&src=s&st1=A+robust+approach+to+jobshop+scheduling+problems+in+the+marine+environment&sid=6CAVZDd7eHIr7AUHrqZB0fF%3a30&sot=b&sdt=b&sl=89&s=TITLE-ABS-KEY%28A+robust+approach+to+jobshop+scheduling+problems+in+the+marine+environment%29&relpos=0&relpos=0


Share