Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


osu1187883767.pdf (500.03 KB)

ETD Abstract Container

Abstract Header

Capacity allocation and rescheduling in supply chains

Liu, Zhixin
http://rave.ohiolink.edu/etdc/view?acc_num=osu1187883767

Abstract Details

2007, Doctor of Philosophy, Ohio State University, Business Administration.
First, we study the problem of rescheduling for multiple new orders. Assume that a set of original jobs has been scheduled on a single machine, but not processed, when a set of new jobs arrives. The decision maker needs to insert the new jobs into the existing schedule without excessively changing it. The objective is minimization of the maximum lateness of the jobs, subject to a customer service requirement modeled by a limit on the maximum time change of the original jobs. We show that this scheduling problem is intractable, even if no new jobs arrive. We describe several approximation algorithms and analyze their worst-case performance. Next, we develop a branch and bound algorithm that solves 99.9% of randomly generated instances with up to 1000 jobs within 60 seconds. Second, we consider a multiple product supply chain where a manufacturer receives orders from several distributors. If the orders cannot all be met from available production capacity, then the manufacturer allocates that capacity among the distributors. The distributors may share their allocated capacity among themselves before submitting revised orders. Finally, the manufacturer schedules the revised orders to minimize its cost. We consider three practical coordination issues. First, we estimate the benefit to the manufacturer from considering scheduling costs and constraints in making capacity allocation decisions. Second, we estimate the additional profit that the distributors achieve when they share their allocated capacity. Third, we estimate the value of coordination between the manufacturer and the distributors. Third, we consider a problem where a group of agents, each with a set of jobs, need to schedule their jobs on a common processing facility. Each agent wants to minimize an objective function which depends on its own job completion times. Time slots are allocated to the various jobs based on the bids of the participating agents. We investigate the efficiency and effectiveness of three ascending auction mechanisms, with market goods consisting of time slots, fixed time blocks, and flexible time blocks, respectively. We show that for the case of time blocks, there may not exist an equilibrium solution that is globally optimal.
Nicholas Hall (Advisor)
128 p.
Business Administration, Management
deterministic scheduling; rescheduling for new job disruptions; heuristic worstcase analysis; branch and bound algorithm; supply chain; capacity allocation; cooperative game; value of coordination; noncooperative game; auction mechanism

Recommended Citations

Citations

  • Liu, Z. (2007). Capacity allocation and rescheduling in supply chains [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1187883767

    APA Style (7th edition)

  • Liu, Zhixin. Capacity allocation and rescheduling in supply chains. 2007. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1187883767.

    MLA Style (8th edition)

  • Liu, Zhixin. "Capacity allocation and rescheduling in supply chains." Doctoral dissertation, Ohio State University, 2007. http://rave.ohiolink.edu/etdc/view?acc_num=osu1187883767

    Chicago Manual of Style (17th edition)

osu1187883767
861
© 2007, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.