Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/28193
Title: Design and analysis of algorithms for solving a class of routing shop scheduling problems
Authors: LIU SHUBIN
Keywords: Routing shop scheduling; branch-and-bound; overlapped neighborhood search; tabu search; open shop scheduling; single machine scheduling
Issue Date: 8-Jun-2009
Source: LIU SHUBIN (2009-06-08). Design and analysis of algorithms for solving a class of routing shop scheduling problems. ScholarBank@NUS Repository.
Abstract: The routing shop scheduling problems consider the transportation times or sequence dependent setup times in manufacturing environments. A branch-and-bound algorithm for solving the single machine total weighted tardiness problem with unequal release dates is developed. Four global dominance rules as well as a lower bound computational method are proposed to prune the search tree branches. In addition, we present a general purpose heuristic algorithm, named overlapped neighborhood search (ONS) algorithm, to solve a wide variety of sequencing problems. Meta-heuristic algorithms are developed for two multi-machine scheduling problems, the open shop scheduling problem and the routing open shop scheduling problem. New neighborhood structures as wells as an exact operation move feasibility testing method are developed for the open shop scheduling problem and routing open shop scheduling problem. Tabu search algorithms are developed for the open shop and routing open shop scheduling problems.
URI: http://scholarbank.nus.edu.sg/handle/10635/28193
Appears in Collections:Ph.D Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
LiuSB.pdf942.96 kBAdobe PDF

OPEN

NoneView/Download

Page view(s)

216
checked on Dec 18, 2017

Download(s)

234
checked on Dec 18, 2017

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.