Scheduling for Service Stability and Supply Chain Coordination

This dissertation studies scheduling for service stability and for supply chain coordination as well. The scheduling problems for service stability are studied from the single perspective of a firm itself, while the scheduling problems for supply chain coordination are investigated from the perspective of a supply chain. Both the studies have broad applications in real life. In the first study, several job scheduling problems are addressed, with the measure of performance being job completion time variance (CTV). CTV minimization is used to represent service stability, since it means that jobs are completed in a relative concentrated period of time. CTV minimization also conforms to the Just-in-time philosophy. Two scheduling problems are studied on multiple identical parallel machines. The one problem does not restrict the idle times of machines before their job processing, while the other does. For these two scheduling problems, desirable properties are explored and heuristic algorithms are proposed. Computational results show the excellent performances of the proposed algorithms. The third scheduling problem in the first study is considered on a single machine and from the users’ perspective rather than the system’s perspective. The performance measure is thus class-based completion time variance (CB-CTV). This problem is shown to be able to be transformed into multiple CTV problems. Therefore, the well-developed desirable vi properties of the CTV problem can be applied to solve the CB-CTV problem. The tradeoff between the CB-CTV problem and the CTV problem is also investigated. The second study deals with scheduling coordination in a supply chain, since supply chain coordination is increasingly critical in recent years. Usually, different standpoints prevent decision makers in a supply chain from having agreement on a certain scheduling decision. Therefore conflicts arise. In pursuit of excellent performance of the whole supply chain, coordination among decision makers is needed. In this study, the scheduling conflicts are measured and analyzed from different perspectives of decision makers, and cooperation mechanisms are proposed based on different scenarios of the relative bargaining power among decision makers. The cooperation savings are examined as well.