In this paper we formally introduce a generic real-time multivehicle truckload pickup and delivery problem. The problem includes the consideration of various costs associated with trucks' empty travel distances, jobs' delayed completion times, job rejections. Although very simple, captures most features operational real-world trucking fleet that dynamically moves truckloads between different sites according to customer requests arrive continuously. We propose mixed-integer programming...

Abstract We study the problem of recovering a production plan after disruption, where disruption may be caused by incidents such as power failure, market change, machine breakdown, supply shortage, worker no‐show, and others. The new recovery we seek has to not only suit changed environment brought about but also close initial so cause too much customer unsatisfaction or inconvenience for current‐stage downstream operations. For general‐cost case, propose dynamic programming method problem....

We consider a stochastic inventory control problem in which buyer makes procurement decisions while facing periodic random demand and two supply sources, namely, long-term contract supplier spot market. The between the partially shields latter from vicissitudes of market, that price paid by to is only linked at moment. After fulfilling minimum-order commitment with supplier, has full freedom source both Procurement market also incurs fixed setup cost. show an optimal policy consists three...

In real-world images, slanted or curved texts, especially those on cans, banners, badges, appear as frequently, if not more so, than flat texts due to artistic design layout constraints. While high-quality visual text generation has become available with the advanced generative capabilities of diffusion models, these models often produce distorted and inharmonious background when given layouts training data limitation. this paper, we introduce a new training-free framework, STGen, which...

We study the optimal production-inventory-outsourcing policy for a firm with Markovian in-house production capacity that faces independent stochastic demand and has option to outsource. find very simple forms under fairly reasonable assumptions. In addition, when Markov process is stochastically monotone, parameters decrease in firm’s current level additional All these results extend infinite-horizon undiscounted-cost cases. analyze comparative statics necessity of some technical conditions,...

With greater availability of real-time information systems, algorithms are needed to support commercial fleet operators in their decisions assign vehicles and drivers loads a dynamic environment. A rolling horizon framework for the assignment sequencing trucks jobs consisting picking up delivering full truckloads when requests service arise on continuous basis is presented. mathematical formulation problem faced at each stage presented; its solution allows reassignment loads, including...

Abstract We focus on the concave‐cost version of a production planning problem where manufacturer can meet demand by either producing new items or remanufacturing used items. Unprocessed are disposed. show NP‐hardness even when all costs stationary. Utilizing special structure extreme‐point optimal solutions for minimum with network flow type feasible region, we develop polynomial‐time heuristic problem. Our computational study indicates that is very efficient way to solve as far solution...

We study the optimal control of a firm with two capacitated manufacturing plants situated in distinct geographical regions. Demands from each region are mostly satisfied by local plant. However, if necessary, some newly arrived demands can be designated to served other, more remote, The sources above virtual lateral transshipments, unlike ones involved real do not need have nonnegative inventory levels throughout transshipment processes. develop results about simultaneous preservation...

Abstract We consider a supply chain involving one supplier and retailer in which revenue-sharing contract is adopted. Under this contract, the can obtain product from at discounted price. As compensation, must share his revenue with certain rate, say r (0≤r≤1), where represents portion of to be kept by retailer. Our ultimate objective help whole more profitable while upholding individual components' incentives. use two-stage (Stackelberg) game model problem, player game's leader other...

The use of permit markets to mitigate harmful emissions is on the rise. When participating in such a market, an emitting firm needs acquire from it permits that cover resulting production. Thus, has simultaneously cope with fluctuating prices and random demand, also juggle between activities trading permit‐consuming We shed light this complex dynamic control problem, while confronting difficulties brought by fixed as well variable transaction costs associated trading. exploit K‐convexity...

We study a continuous‐review acquisition problem, in which the raw material price follows discrete‐state Markov process and demand is compound Poisson. show that one optimal policy of order‐up‐to type. Under our mean reversion time continuity conditions, we further levels are decreasing at current level. At same time, computational verifies both conditions indispensable for monotonicity result. The also hints connection between discrete‐ continuous‐state processes.

Data-Driven Ordering and Pricing

In manufacturing environments such as an integrated circuit (IC) sort and test floor, typically more than one objective, cycle time on-time delivery, needs to be simultaneously considered. With multiple objectives, a good solution is called Pareto optimal if it not inferior any other feasible solutions in terms of all objectives. The boundary the set solutions, which indicates tradeoff solutions. this paper, multiobjective model for IC formulated, based upon current information at given...

We study the optimal moment for a firm, while pressured to deliver on an already-placed order, purchase its raw material input whose price undergoes random gyrations. To analyze resulting continuous-time-continuous-state stopping-time problem, we resort discrete-time approximation which helps us avoid such complicating factors as partial differential equations or even inequalities. For main case, policy is describable in time-price space by increasing execution boundary. The firm should wait...

We study a variant of the classical bin-packing problem, ordered open-end where first bin can be filled to level above 1 as long removal last piece brings bin's back below and second, is largest-indexed among all pieces in bin. conduct both worst-case average-case analyses for problem. In analysis, size play distinct roles render analysis more difficult with their presence. give lower bounds performance ratio any online algorithm cases without 1-pieces, case identify an whose less than 2...

We study a periodic-review production/inventory control problem where both the supply of raw material and demand for finished product are exogenous random, can be stored future use, purchased from or sold to an outside market. lost sales backlogging cases under strict convex linear purchasing/selling costs. Convexity cost implies that more firm purchases sells market, expensive less valuable becomes. For all cases, we find partial characterizations optimal policies, which turn out very...

We study a revenue management problem involving competing firms. assume the presence of continuum infinitesimal firms where no individual firm has any discernable influence over evolution overall market condition. Under this nonatomic‐game approach, unanimous adoption an equilibrium pricing policy by all will yield market‐condition process that in turn elicit said as one best responses. For both deterministic‐ and stochastic‐demand cases, we show existence policies exhibit well‐behaving...

When a new product has just been introduced or the economy entered phase, firm is often at loss as to what underlying demand pattern become let alone how best respond it. In “Dynamic Inventory Control with Fixed Setup Costs and Unknown Discrete Demand Distribution,” Davoodi, Katehakis, Yang faced off this challenging problem by tailoring ordering decisions empirical distributions formed out of past observations. presence fixed setup costs, however, an (s,S) policy optimal in conventional...