Access the full text.
Sign up today, get DeepDyve free for 14 days.
M. Gen, Runwei Cheng (1997)
Genetic algorithms and engineering design
J. Hurink, S. Knust (2001)
List scheduling in a parallel machine environment with precedence constraints and setup timesOper. Res. Lett., 29
Kyungchul Park, Kyungsik Lee, Sungsoo Park, Sunghwan Kim (1996)
Modeling and solving the spatial block scheduling problem in a shipbuilding companyComputers & Industrial Engineering, 30
S. Malve, R. Uzsoy (2007)
A genetic algorithm for minimizing maximum lateness on parallel identical batch processing machines with dynamic job arrivals and incompatible job familiesComput. Oper. Res., 34
Chichang Jou (2005)
A genetic algorithm with sub-indexed partitioning genes and its application to production scheduling of parallel machinesComput. Ind. Eng., 48
J. Lee, K. Lee, H. Park, J. Hong, Jung Lee (1997)
Developing scheduling systems for Daewoo Shipbuilding: DAS projectEuropean Journal of Operational Research, 97
J. Cochran, Shwu-Min Horng, J. Fowler (2003)
A multi-population genetic algorithm to solve multi-objective scheduling problems for parallel machinesComput. Oper. Res., 30
Liu Min, Wu Cheng (1999)
A genetic algorithm for minimizing the makespan in the case of scheduling identical parallel machinesArtif. Intell. Eng., 13
Y. Okumoto, R. Iseki
Optimization of steel plate sequence using the tabu search method
Isto Aho, E. Mäkinen (2006)
On a parallel machine scheduling problem with precedence constraintsJournal of Scheduling, 9
Yixun Lin, Wenhua Li (2004)
Parallel machine scheduling of machine-dependent jobs with unit-lengthEur. J. Oper. Res., 156
Kyu-Kab Cho, Jung-Soo Oh, K. Ryu, H. Choi (1998)
An Integrated Process Planning and Scheduling System for Block Assembly in ShipbuildingCIRP Annals, 47
Lu-Wen Liao, Gwo-Ji Sheen (2008)
Parallel machine scheduling with machine availability and eligibility constraintsEur. J. Oper. Res., 184
Hermann Jung, M. Serna, P. Spirakis (2003)
An efficient deterministic parallel algorithm for two processors precedence constraint schedulingTheor. Comput. Sci., 292
Girish Ramachandra, S. Elmaghraby (2006)
Sequencing precedence-related jobs on two machines to minimize the weighted completion timeInternational Journal of Production Economics, 100
R. Varghese, D. Yoon (2006)
Shipbuilding erection network optimization : A TSP methodJournal of ship production, 22
Grissele Centeno, R. Armacost (2004)
Minimizing makespan on parallel machines with release time and machine eligibility restrictionsInternational Journal of Production Research, 42
Kyu-Kab Cho, J. Sun, Jung-Soo Oh (1999)
An automated welding operation planning system for block assembly in shipbuildingInternational Journal of Production Economics, 60
D. Yoon, R. Varghese (2006)
Looking-forward scheduling approach applied in pre-erection area of a shipyardJournal of ship production, 23
Jeffrey Herrmann, J. Proth, Nathalie Sauer (1997)
Heuristics for unrelated machine scheduling with precedence constraintsEuropean Journal of Operational Research, 102
S. Rajakumar, V. Arunachalam, V. Selladurai (2006)
Workflow balancing in parallel machine scheduling with precedence constraints using genetic algorithmJournal of Manufacturing Technology Management, 17
C. Chekuri, M. Bender (1998)
An Efficient Approximation Algorithm for Minimizing Makespan on Uniformly Related Machines
J. Holland (1975)
Adaptation in natural and artificial systems
J. Liu
Study on ship hull construction operation strategy based on PWBS
K. Cho, K. Chung, Chan-Jeoung Park, Jinny Park, H. Kim (2001)
A Spatial Scheduling System for Block Painting Process in ShipbuildingCIRP Annals, 50
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 of Manufacturing Technology Management – Emerald Publishing
Published: May 1, 2009
Keywords: Production scheduling; Parallel machines; Shipbuilding industry; China
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.