Please use this identifier to cite or link to this item:
http://hdl.handle.net/11375/13539
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Steiner, George | en_US |
dc.contributor.author | Qian, Jianbo | en_US |
dc.date.accessioned | 2014-06-18T17:04:21Z | - |
dc.date.available | 2014-06-18T17:04:21Z | - |
dc.date.created | 2013-09-16 | en_US |
dc.date.issued | 2013-10 | en_US |
dc.identifier.other | opendissertations/8375 | en_US |
dc.identifier.other | 9271 | en_US |
dc.identifier.other | 4589133 | en_US |
dc.identifier.uri | http://hdl.handle.net/11375/13539 | - |
dc.description.abstract | <p>This thesis contains two parts. In the first part, which contains Chapter 2 and Chapter 3, we consider scheduling problems with learning effect and time-dependent processing time on a single machine. In Chapter 2, we investigate the earliness-tardiness objective, as well as the objective without due date assignment consideration. By reducing them to a special linear assignment problem, we solve them in near-linear time. As a consequence, we improve the time complexity for some previous algorithms for scheduling problems with learning effect and/or time-dependent processing time. In Chapter 3, we investigate the total number of tardy jobs objective. By reducing them to a linear assignment problem, we solve them in polynomial time. For some important special cases, where there is only learning effect OR time-dependent processing time, we reduce the time complexity to quadratic time. In the second part, which contains Chapter 4 and Chapter 5, we investigate the bicriteria scheduling problems in a supply chain. We separate the objectives in two parts, where the delivery cost is one of them. We present efficient algorithms to identify all the Pareto-optimal solutions for various scenarios. In Chapter 4, we study the cases without due date assignment; while in Chapter 5 we study the cases with due date assignment consideration.</p> | en_US |
dc.subject | Single-machine scheduling; learning effect; time-dependent | en_US |
dc.subject | deteriorating effect; due date assignment; positional penalties; polynomial-time algorithm | en_US |
dc.subject | Management Sciences and Quantitative Methods | en_US |
dc.subject | Management Sciences and Quantitative Methods | en_US |
dc.title | Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain | en_US |
dc.type | thesis | en_US |
dc.contributor.department | Business | en_US |
Appears in Collections: | Open Access Dissertations and Theses |
Files in This Item:
File | Size | Format | |
---|---|---|---|
fulltext.pdf | 494.4 kB | Adobe PDF | View/Open |
Items in MacSphere are protected by copyright, with all rights reserved, unless otherwise indicated.