capacity allocation and rescheduling in supply chains

[...]... or occasional demand surges (Fisher 1997) We consider capacity allocation and scheduling issues in a make-to-order supply chain The supply chain includes a manufacturer that produces multiple products in response to orders from several distributors We study three practical and significant coordination issues that arise in this supply chain when the manufacturer’s production capacity is insufficient to meet... rescheduling literature, including taxonomies, strategies and algorithms, in both deterministic and stochastic environments Wu et al (1993) suggest a composite objective rescheduling approach for a single machine problem, and design heuristic procedures for solving it Their criteria include minimizing the makespan and the impact of the schedule change Unal et al (1997) consider a single machine problem with... interval [(t − 1)y + t − 2, (t − 1)y + t − 1] Then there are t intervals of length y, including the one starting at time (t − 1)y + t − 1 We process jobs 1, , 3t in these t intervals In each interval, there are exactly three jobs with total processing time y, and they are processed in the same order as in π Also, the jobs in the first position in each interval are processed in the same order as in. .. NEW ORDERS 2.1 Introduction In recent years, rescheduling has attracted considerable attention, motivated by both important practical issues and interesting research problems The need for rescheduling in response to unexpected changes that take place in production environments is commonplace in modern flexible decision making and manufacturing systems In dynamic environments, managers and production... scheduling problems with capacity constraints faced by manufacturers in competition or coordination with other supply chain members Also, in our work, the jobs to be scheduled belong to various entities, and we use game theory to study problems of capacity allocation and payoff division This dissertation is organized into three parts, as follows In Chapter 2, we study the problem of rescheduling for... multiple new orders In recent years, rescheduling has attracted considerable attention, motivated by both important practical applications and interesting research problems (Vieira et al 2003) 1 In modern decision making and manufacturing systems, unexpected disruptions commonly occur, which necessitates the rescheduling In a production system facing unpredictable demand, managers and planners must generate... by starting processing at time zero Trivially, Lmax (JN ) ≤ Lmax (σ ∗ ) Therefore, using (2.3), we obtain Lmax (σ AEDD ) ≤ 2Lmax (σ ∗ ) in this case also The following instance shows that no better bound exists 19 Example 4 n = 2, n0 = 1, nN = 1; processing times and due dates are shown in Table 2.4, where v ≥ 1; k = 1; and the intervals within which each job is scheduled in π are also given in Table... value of considering scheduling costs and constraints as part of the manufacturer’s decision to allocate its capacity to the distributors across products Allocation of capacity to distributors allows more flexibility than allocation of products Second, we estimate the value of coordination 2 among the distributors in sharing their allocated capacity Finally, we estimate the value of coordination between... competing interests and privately held information about job requirements and values In a decentralized scheduling problem, jobs may represent operations such as specific industrial finishing, mechanical testing, quality control, components assembly, and equipment maintenance and repair We consider problems where a group of agents, each with a set of jobs, needs to schedule their jobs on a common processing... for Supply Chain Coordination 87 3.11 Effect of Revenue / Profit Correlation on Value of Supply Chain Coordination 88 3.12 Effect of Number of Products and Partial Orders on Value of Supply Chain Coordination 88 3.13 Sensitivity Analysis for Coordination with Setup Times 95 xi LIST OF FIGURES Figure 1.1 Page Capacity Allocation and . demand surges (Fisher 1997). We consider capacity allocation and s cheduling issues in a make-to-order supply chain. The supply chain includes a manufacturer that produces multiple products in. Branch and bound algorithm . . . . . . . . . . . . . . . . . 35 2.6 Concluding Remarks . . . . . . . . . . . . . . . . . . . . . . . . . . 42 3. Capacity Allocation and Scheduling in Supply Chains. ORDERS 2.1 Introduction In recent years, rescheduling has attracted considerable attention, motivated by both important practical issues and interesting research problems. The need for rescheduling in