Titlebook: Supply Chain Scheduling; Zhi-Long Chen,Nicholas G. Hall Book 2022 Springer Nature Switzerland AG 2022 Distribution Scheduling.Production S

粗鲁的人

Integrated Production and Outbound Distribution Scheduling: Offline Problemse-to-order or time-sensitive products. We first briefly discuss background, motivations, and the current status of research on these problems. We then classify such problems into several different classes based on some of their major characteristics. We next focus on several representative problems

苍白

vocation

Coordinated Product Pricing and Scheduling DecisionsWe first briefly discuss some practical situations where such problems arise, followed by an investigation of two classes of such problems, namely problems with a single time period and problems with multiple periods. For each class of problems, various exact and approximation algorithms and heurist

乐章

Joint Subcontracting and Scheduling Decisionsy which jobs can also be processed. The decision maker needs to determine jointly a subset of jobs to be subcontracted and a schedule for the jobs processed in-house, and in some situations may also need to construct a schedule for the subcontracted jobs. We discuss several representative problems,

nugatory

Optimization and Conflict that have both a scheduling component and a second component that arises from the structure of the supply chain and the self-interest of the different parties. We discuss mathematical models to evaluate the cost of conflict experienced by one party when another party dominates the decision making p

纬度

Cooperative Supply Chain Schedulingroblems. We consider many scheduling situations that model diverse applications, and that have classically been analyzed from the perspective of a centralized decision maker. By viewing the jobs or resources within those situations as individual self-interested players, cooperative supply chain sche

epicardium

Granular

Terminal

单挑

Integrated Production and Outbound Distribution Scheduling: Online Problemsclass of O-IPODS problems, we discuss several representative problems, present the corresponding online algorithms for solving these problems, and describe the theoretical performance of these algorithms.