A genetic algorithm for minimizing makespan of block erection in shipbuilding

A genetic algorithm for minimizing makespan of block erection in shipbuilding Purpose – The purpose of this paper is to propose an algorithm based on genetic algorithm (GA) to solve the block erection scheduling problem in shipbuilding. Design/methodology/approach – The block erection scheduling problem is defined as the identical parallel machine‐scheduling problem with precedence constraints and machine eligibility (PCME) restrictions. A GA is proposed to find near optimal solution, and a few lower bounds and the percentage of the reduced makespan are defined to evaluate the performance of the proposed algorithm. Finally, the GA for block erection scheduling problem in a shipyard is illustrated by using the real data from a local shipyard. Findings – The proposed GA produces lesser values of makespan against the random heuristic algorithm for the collected real instances. Research limitations/implications – The proposed GA can solve other similar parallel machine‐scheduling problems with PCME to minimize makespan. Practical implications – Based on the proposed GA, the developed scheduling system for block erection in a shipyard can reduce the makespan of block erection, and contribute to the productivity improvement. Originality/value – The allocation of block erection to the crane is modeled as a parallel machine‐scheduling problem with PCME, and the GA is developed to solve this problem to minimize makespan. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Journal of Manufacturing Technology Management Emerald Publishing

A genetic algorithm for minimizing makespan of block erection in shipbuilding

Loading next page...
 
/lp/emerald-publishing/a-genetic-algorithm-for-minimizing-makespan-of-block-erection-in-fDz30z5DTU
Publisher
Emerald Publishing
Copyright
Copyright © 2009 Emerald Group Publishing Limited. All rights reserved.
ISSN
1741-038X
DOI
10.1108/17410380910953757
Publisher site
See Article on Publisher Site

Abstract

Purpose – The purpose of this paper is to propose an algorithm based on genetic algorithm (GA) to solve the block erection scheduling problem in shipbuilding. Design/methodology/approach – The block erection scheduling problem is defined as the identical parallel machine‐scheduling problem with precedence constraints and machine eligibility (PCME) restrictions. A GA is proposed to find near optimal solution, and a few lower bounds and the percentage of the reduced makespan are defined to evaluate the performance of the proposed algorithm. Finally, the GA for block erection scheduling problem in a shipyard is illustrated by using the real data from a local shipyard. Findings – The proposed GA produces lesser values of makespan against the random heuristic algorithm for the collected real instances. Research limitations/implications – The proposed GA can solve other similar parallel machine‐scheduling problems with PCME to minimize makespan. Practical implications – Based on the proposed GA, the developed scheduling system for block erection in a shipyard can reduce the makespan of block erection, and contribute to the productivity improvement. Originality/value – The allocation of block erection to the crane is modeled as a parallel machine‐scheduling problem with PCME, and the GA is developed to solve this problem to minimize makespan.

Journal

Journal of Manufacturing Technology ManagementEmerald Publishing

Published: May 1, 2009

Keywords: Production scheduling; Parallel machines; Shipbuilding industry; China

References

You’re reading a free preview. Subscribe to read the entire article.


DeepDyve is your
personal research library

It’s your single place to instantly
discover and read the research
that matters to you.

Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.

All for just $49/month

Explore the DeepDyve Library

Search

Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly

Organize

Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.

Access

Get unlimited, online access to over 18 million full-text articles from more than 15,000 scientific journals.

Your journals are on DeepDyve

Read from thousands of the leading scholarly journals from SpringerNature, Elsevier, Wiley-Blackwell, Oxford University Press and more.

All the latest content is available, no embargo periods.

See the journals in your area

DeepDyve

Freelancer

DeepDyve

Pro

Price

FREE

$49/month
$360/year

Save searches from
Google Scholar,
PubMed

Create folders to
organize your research

Export folders, citations

Read DeepDyve articles

Abstract access only

Unlimited access to over
18 million full-text articles

Print

20 pages / month

PDF Discount

20% off