Supply chain scheduling is a relatively new research area with less than 20 years of history. It is an intersection of two traditional areas: supply chain management and scheduling. In this book, the authors provide a comprehensive coverage of supply chain scheduling. The book covers applications, solution algorithms for solving related problems, evaluation of supply chain conflicts, and models for encouraging cooperation between decision makers.
Supply chain scheduling studies detailed scheduling issues within supply chains, as motivated by a variety of applications in the real world. Topics covered by the book include:- Coordinated decision making in centralized supply chains, including integrated production and distribution scheduling, joint scheduling and product pricing, and coordinated subcontracting and scheduling.
- Coordination and competition issues in decentralized supply chains, including conflict and cooperation within scheduling decisions made by different parties in supply chains, and both cooperative and non-cooperative supply chain scheduling games.
The book describes a variety of representative problems within each of these topics. The authors define these problems mathematically, describe corresponding applications, and introduce solution methods for solving each problem to improve supply chain performance.
Author(s): Zhi-Long Chen, Nicholas G. Hall
Series: International Series in Operations Research & Management Science, 323
Publisher: Springer
Year: 2022
Language: English
Pages: 698
City: Cham
Foreword
Preface
Contents
1 Introduction
1.1 Supply Chain Scheduling
1.2 Applications
1.2.1 Centralized Applications and Models
1.2.1.1 Production–Distribution Scheduling for Short Shelf-Life Products
1.2.1.2 Production–Distribution Scheduling for Make-to-Order Products
1.2.1.3 Scheduling and Pricing
1.2.1.4 Subcontracting and Scheduling
1.2.1.5 Other Applications
1.2.2 Decentralized Applications and Models
1.2.2.1 Scheduling and Batching
1.2.2.2 Capacity Allocation
1.2.2.3 Sequencing and Scheduling Games
1.2.2.4 Manufacturing and Distribution
1.2.2.5 Subcontracting Games
1.2.2.6 Multi-Stage Production with Setups
1.2.2.7 Other Applications
1.3 Limitations to Scope
1.4 Overview of the Book
2 Solution Methods for Supply Chain Scheduling Problems
2.1 Common Elements in Scheduling Problems
2.2 Computational Complexity
2.3 Solution Methods
2.3.1 Dynamic Programming Algorithms
2.3.2 Branch-and-Bound Algorithms
2.3.3 Integer Programming Based Algorithms
2.3.3.1 Time-Indexed Formulations
2.3.3.2 Column Generation
2.3.4 Approximate Solution Methods
2.3.4.1 Worst-Case and Average-Case Analysis
2.3.4.2 Fully Polynomial Time Approximation Schemes
2.3.4.3 Competitive Analysis
2.3.5 Cooperative Game Theory
2.3.6 Noncooperative Game Theory
Part I Centralized Supply Chain Scheduling
3 Integrated Production and Outbound Distribution Scheduling: Offline Problems
3.1 Introduction
3.2 Problem Definition and Classification
3.2.1 Model Parameters and Notation
3.2.1.1 Five-Field Model Representation
3.2.1.2 Model Classification
3.3 Problems with Individual and Immediate Delivery
3.3.1 Maximum Delivery Time Problems with a Sufficient Number of Vehicles
3.3.2 Maximum Delivery Time Problems with a Limited Number of Vehicles
3.3.3 Multi-Machine Problems
3.4 Problems with Batch Delivery to a Single Customer
3.4.1 Optimality Properties
3.4.2 Single-Machine Maximum Lateness and Transportation Cost Problem
3.4.3 Single-Machine Total Weighted Delivery Time and Transportation Cost Problem
3.4.4 Parallel-Machine Total Delivery Time and Transportation Cost Problem
3.4.5 Problems with a Limited Number of Vehicles
3.5 Problems with Batch Delivery to Multiple Customers
3.5.1 Single-Machine Maximum Lateness and Transportation Cost Problems with Direct Shipping
3.5.1.1 NP-Hardness Proof
3.5.1.2 DP Algorithm
3.5.1.3 Heuristic
3.5.2 Parallel-Machine Total Delivery Time and Transportation Cost Problem with Routing
3.5.3 Problems with a Limited Number of Vehicles and Direct Shipping
3.6 Problems with Fixed Delivery Departure Dates
3.6.1 Problems with Homogeneous Vehicles
3.6.1.1 Problem 1||V(v, c), fdep|1|Dj+TC
3.6.1.2 Problem 1||V(v, c), fdep|1|Lmax
3.6.2 Problems with Heterogeneous Vehicles
3.6.2.1 Problem 1||Vhet(∞, 1), fdep|1|TC
3.6.2.2 Problems 1|[aj, bj]|Vhet(v, 1), fdep|k|IC +TC
3.7 Problems with Multiple Plants
3.7.1 Minimizing Total Delivery Time and Transportation Cost
3.7.2 Minimizing Maximum Delivery Time and Transportation Cost
3.8 Problems with Two Stages of Delivery
3.8.1 Optimality Properties
3.8.2 Solving the Total Delivery Time Problem
3.8.3 Solving the Maximum Delivery Time Problem
3.9 Future Research
4 Integrated Production and Outbound Distribution Scheduling: Online Problems
4.1 Introduction
4.2 Online Problems with Individual and Immediate Delivery
4.2.1 Single-Machine Maximum Delivery Time Problem and Some Variants
4.2.2 Parallel-Machine Maximum Delivery Time Problem
4.3 Online Problems with Batch Delivery to a Single Customer
4.3.1 Maximum Delivery Time Problems
4.3.1.1 Offline Counterparts
4.3.1.2 Algorithm for the Preemptive Problem
4.3.1.3 Algorithms for the Nonpreemptive Problem
4.3.2 Maximum Delivery Time and Transportation Cost Problems
4.3.3 Total Delivery Time and Transportation Cost Problems
4.3.3.1 Closely Related Problems
4.3.3.2 Algorithm for the Preemptive Problem
4.3.3.3 Algorithm for the Nonpreemptive Problem
4.4 Online Problems with Batch Delivery to Multiple Customers
4.4.1 Maximum Delivery Time and Transportation Cost Problems
4.4.2 Total Delivery Time and Transportation Cost Problems
4.5 Online Problems with Two Stages of Delivery
4.6 Online or Offline Algorithms?
4.7 Future Research
5 Coordinated Product Pricing and Scheduling Decisions
5.1 Introduction
5.2 Single-Period Product Based Problems
5.2.1 Exact Algorithms
5.2.2 NP-Hardness Proofs
5.2.3 Fully Polynomial Time Approximation Schemes
5.2.3.1 FPTAS for the Single-Machine Completion Time Problem
5.2.3.2 FPTAS for the Flowshop Makespan Problem
5.2.4 Heuristics
5.2.5 Computational Results and Managerial Insights
5.3 Single-Period Order Based Problems
5.3.1 Discrete Allowable Prices
5.3.2 Continuous Allowable Prices
5.3.2.1 Simultaneous Quotation
5.3.2.2 Sequential Quotation
5.4 Multi-Period Problems
5.4.1 Exact Algorithms
5.4.2 NP-Hardness Proofs
5.4.3 Approximation Algorithm
5.4.4 Computational Results and Managerial Insights
5.5 Future Research
6 Joint Subcontracting and Scheduling Decisions
6.1 Introduction
6.2 Problem with a Lead Time Performance Guarantee
6.2.1 Problem Definition
6.2.2 Complexity and Heuristic Analysis
6.2.3 Computational Results
6.2.4 A Related Problem
6.3 Value of Subcontracting
6.3.1 Value of Subcontracting in the Total Cost Problem
6.3.2 Value of Subcontracting in the Weighted Sum of Makespan and Total Cost Problem
6.4 Problems with a Subcontracting Budget Constraint
6.4.1 The Total Completion Time Problem
6.4.2 The Maximum Tardiness Problem
6.4.3 The Total Tardiness Problem
6.5 Problems with a Flowshop Environment
6.5.1 NP-Hardness Proof
6.5.2 Polynomially Solvable Cases
6.5.3 Proportionate Flowshop
6.6 Problems Requiring Delivery of Subcontracted Jobs
6.6.1 Single In-House Machine and Single Subcontractor's Machine
6.6.2 Two-Stage Flowshop
6.7 Problems with a More Complex Subcontracting Cost Structure
6.7.1 Problem Description
6.7.2 Analysis of Problems with Incremental Discount
6.8 Future Research
Part II Decentralized Supply Chain Scheduling
7 Optimization and Conflict
7.1 Introduction
7.2 Scheduling and Batching in a Supply Chain
7.2.1 Preliminaries
7.2.1.1 Notation and Classification
7.2.1.2 General Assumptions and Properties
7.2.1.3 Overview of the Results
7.2.2 The Supplier's Problem
7.2.2.1 Sum of Flow Times
7.2.2.2 Number of Late Jobs
7.2.3 The Manufacturer's Problem
7.2.3.1 Sum of Flow Times
7.2.3.2 Number of Late Jobs
7.2.4 The Combined Problem
7.2.4.1 Sum of Flow Times
7.2.4.2 Number of Late Jobs
7.2.5 Cooperation
7.2.5.1 Benefits of Cooperation
7.2.5.2 Mechanisms for Cooperation
7.3 Sequencing in an Assembly System
7.3.1 Notation and Assumptions
7.3.2 Conflicts Between Suppliers and Manufacturer
7.3.2.1 Completion Time and Completion Time
7.3.2.2 Completion Time and Maximum Lateness
7.3.3 Suppliers Dominate and Manufacturer Negotiates
7.3.4 Manufacturer Dominates and Suppliers Negotiate
7.3.5 Manufacturer Dominates and Suppliers Adjust
7.3.6 Suppliers and Manufacturer Cooperate
7.3.7 Cost Saving from Cooperation
7.3.7.1 Completion Time and Completion Time
7.3.7.2 Completion Time and Maximum Lateness
7.3.8 Extensions
7.4 Manufacturer and Distributor
7.4.1 Problem Descriptions
7.4.1.1 Problem 1
7.4.1.2 Problem 2
7.4.2 Cost of Conflict
7.4.2.1 Conflict in Problem 1
7.4.2.2 Conflict in Problem 2
7.4.3 Supply Chain Dominance
7.4.3.1 Dominance in Problem 1: Printer Dominates
7.4.3.2 Dominance in Problem 1: Distributor Dominates
7.4.3.3 Dominance in Problem 2: Manufacturer Dominates
7.4.3.4 Dominance in Problem 2: Distributor Dominates
7.4.4 Benefit of Cooperation
7.4.4.1 Problem 1
7.4.4.2 Problem 2
7.4.4.3 Implementing Cooperation
7.5 Resequencing in a Supply Chain
7.5.1 Notation and Classification
7.5.2 Manufacturer's Problems
7.5.2.1 Interchange Costs
7.5.2.2 Interchange and Storage Costs
7.5.3 Supplier's Problems
7.5.3.1 Interchange Costs
7.5.3.2 Interchange and Storage Costs
7.5.4 Combined Problems
7.6 Future Research
8 Cooperative Supply Chain Scheduling
8.1 Introduction
8.2 Cooperative Game Solutions
8.3 Sequencing Games
8.3.1 General Related Games
8.3.1.1 Permutation Games
8.3.1.2 Unanimity Games
8.3.2 Linear Costs
8.3.3 Regular Costs
8.3.4 Rescheduling Games
8.3.5 Relaxed Sequencing Games
8.3.6 Batch Sequencing Games
8.3.7 Proportionate Flowshops
8.3.8 Openshops
8.3.9 Multi-Stage Sequencing Games
8.3.10 Balancedness in Generalized Games
8.3.10.1 Controllable Processing Times
8.3.10.2 Family Sequencing
8.4 Scheduling Games
8.4.1 Artificial Initial Sequence: Tail Game
8.4.2 Artificial Initial Sequence: Probabilistic Game
8.4.3 No Initial Sequence: Penalty
8.4.4 No Initial Sequence: Penalty and Subsidy
8.5 Project Games
8.5.1 Project Planning Games
8.5.2 Project Execution Games
8.6 Capacity Allocation Games
8.6.1 Supply Chain Scheduling Problems
8.6.2 Uncoordinated Supply Chain
8.6.2.1 Manufacturer: Capacity Allocation
8.6.2.2 Manufacturer: Scheduling Revised Orders
8.6.2.3 Distributors: Resubmitting Partial Orders
8.6.2.4 Distributors: Resubmitting Full Orders
8.6.3 Coordinated Supply Chain
8.7 Outsourcing Games
8.7.1 Common Third-Party Facility
8.7.2 Concurrent Outsourcing
8.8 Future Research
9 Noncooperative Supply Chain Scheduling
9.1 Introduction
9.2 Complete Information Games
9.2.1 Noncooperative Game Concepts
9.2.1.1 Nash equilibrium
9.2.1.2 Price of Anarchy
9.2.1.3 Absolute Price of Anarchy
9.2.2 Finding and Evaluating an Equilibrium
9.2.2.1 Earliness and Tardiness Costs
9.2.2.2 Subcontracting
9.2.2.3 Project Scheduling
9.2.2.4 Local Sequencing Rules
9.2.2.5 Congestion and Activation Costs
9.3 Enhanced Complete Information Games
9.3.1 Sequential Games
9.3.2 Leader–Follower Games
9.3.3 Altruistic Games
9.3.3.1 Egoists and Altruists
9.3.3.2 Common Altruistic Preference
9.3.4 Central Authority Manipulation
9.4 Private Information: Mechanisms Without Payments
9.4.1 Design Concepts
9.4.1.1 A Mechanism
9.4.1.2 Levels of Truthfulness
9.4.2 Deterministic Truthfulness
9.4.3 Randomized Mechanisms
9.4.3.1 Unrelated Parallel Machines
9.4.3.2 Uniform Parallel Machines
9.5 Private Information: Mechanisms with Payments
9.5.1 Design Concepts
9.5.1.1 Monotonicity
9.5.1.2 Dominant Strategy Incentive Compatibility
9.5.1.3 Vickrey–Clarke–Groves Mechanism
9.5.1.4 Weak Monotonicity
9.5.2 Deterministic Truthfulness
9.5.3 Universal Truthfulness
9.5.4 Truthfulness in Expectation
9.5.5 Bayes–Nash Incentive Compatibility
9.6 Future Research
References
Index
