{"id":{"repo_id":"mcmaster","oai_identifier":"oai:macsphere.mcmaster.ca:11375/13539"},"canonical_url":"https://search.ndltd.org/etd/mcmaster/oai:macsphere.mcmaster.ca:11375/13539","repository":{"repo_id":"mcmaster","name":"McMaster University","base_url":"https://macsphere.mcmaster.ca/server/oai/request"},"display":{"title":"Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain","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>","abstract_html":"&lt;p&gt;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.&lt;/p&gt;","abstract_has_math":false,"creators":["Qian, Jianbo"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Business","school":null,"contributors":[],"advisors":["Steiner, George"],"committee_chairs":[],"committee_members":[],"year":2013,"date_issued":"2013-10","date_published":"2013-10","updated_at":"2026-11-18T19:32:06Z","subjects":["Single-machine scheduling; learning effect; time-dependent","deteriorating effect; due date assignment; positional penalties; polynomial-time algorithm","Management Sciences and Quantitative Methods"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["https://doi.org/10.71548/11146"],"render_values":[{"text":"https://doi.org/10.71548/11146","href":"https://doi.org/10.71548/11146","code":true}]},{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/8375","9271","4589133"],"render_values":[{"text":"opendissertations/8375","href":null,"code":true},{"text":"9271","href":null,"code":true},{"text":"4589133","href":null,"code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/11375/13539","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/11375/13539","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://macsphere.mcmaster.ca/server/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Amacsphere.mcmaster.ca%3A11375%2F13539","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Steiner, George"]},{"key":"dc:contributor.department","label":"Department","values":["Business"]},{"key":"dc:creator","label":"Author","values":["Qian, Jianbo"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-06-18T17:04:21Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-06-18T17:04:21Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2013-09-16"]},{"key":"dc:date.issued","label":"Date","values":["2013-10"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Single-machine scheduling; learning effect; time-dependent","deteriorating effect; due date assignment; positional penalties; polynomial-time algorithm","Management Sciences and Quantitative Methods"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["opendissertations/8375","9271","4589133"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/11375/13539","https://doi.org/10.71548/11146"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["<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>"]},{"key":"dc:title","label":"Title","values":["Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain"]},{"key":"others:access_status","label":"Others Access Status","values":["open.access"]}]}],"canonical_facts":{"dc:contributor.advisor":["Steiner, George"],"dc:contributor.department":["Business"],"dc:creator":["Qian, Jianbo"],"dc:date.accessioned":["2014-06-18T17:04:21Z"],"dc:date.available":["2014-06-18T17:04:21Z"],"dc:date.created":["2013-09-16"],"dc:date.issued":["2013-10"],"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>"],"dc:identifier.other":["opendissertations/8375","9271","4589133"],"dc:identifier.uri":["http://hdl.handle.net/11375/13539","https://doi.org/10.71548/11146"],"dc:subject":["Single-machine scheduling; learning effect; time-dependent","deteriorating effect; due date assignment; positional penalties; polynomial-time algorithm","Management Sciences and Quantitative Methods"],"dc:title":["Learning effect, Time-dependent Processing Time and Bicriteria Scheduling Problems in a Supply Chain"],"dc:type":["thesis"],"others:access_status":["open.access"]},"updated_at":"2026-11-18T19:32:06Z"}