Design and analysis of algorithms for solving a class of routing shop scheduling problems

Design and analysis of algorithms for solving a class of routing shop scheduling problems

Ph.D

Saved in:
Bibliographic Details
Main Author: LIU SHUBIN
Other Authors: INDUSTRIAL & SYSTEMS ENGINEERING
Format: Theses and Dissertations
Language:English
Published: 2011
Subjects:
Routing shop scheduling; branch-and-bound; overlapped neighborhood search; tabu search; open shop scheduling; single machine scheduling
Online Access:http://scholarbank.nus.edu.sg/handle/10635/28193
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: National University of Singapore
Language: English

Internet

http://scholarbank.nus.edu.sg/handle/10635/28193

Similar Items