Capacity allocation in a service system with preferred service completion times

DOI10.1002/NAV.22046MaRDI QIDQ6077481zbMATH OpenOpenAlexFDO

Authors Bahar Çavdar, Tuğçe Işık

Publication date 18 October 2023

Published in Naval Research Logistics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.22046

zbMATH Keywords

customer preferencesMarkov decision processesorder pickuppolicy improvement

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Markov and semi-Markov decision processes (90C40)

Recommendations

• Order now, pickup in 30 minutes: managing queues with static delivery guarantees
• Optimizing a dynamic order-picking process
• Optimal pricing and scheduling control of product shipping
• On optimal service capacity allocation policy in an advance selling environment in continuous time
• On the optimal allocation of service to impatient tasks

Cites work

• A Multiperiod Newsvendor Problem with Partially Observed Demand
• A survey of dynamic scheduling in manufacturing systems
• Appointment scheduling under patient preference and no-show behavior
• DYNAMIC ROUTING OF CUSTOMERS WITH GENERAL DELAY COSTS IN A MULTISERVER QUEUING SYSTEM
• Executing production schedules in the face of uncertainties: a review and some future directions
• Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates
• Minimizing earliness-tardiness on a single burn-in oven with a common due date and maximum allowable tardiness constraint
• Monotonicity in Markov Reward and Decision Chains: Theory and Applications
• New results on the newsvendor model and the multi-period inventory model with backordering
• Optimal inventory decisions in a multiperiod newsvendor problem with partially observed Markovian supply capacities
• Outsourcing warranty repairs: Dynamic allocation
• Parallel machine scheduling with earliness and tardiness penalties
• Scheduling jobs within time windows on identical parallel machines: New model and algorithms
• Single-machine scheduling with time windows and earliness/tardiness penalties
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

Cited in

(5)

• Managing capacity at a service facility: an experimental approach
• Capacity allocation for demand of different customer-product-combinations with cancellations, no-shows, and overbooking when there is a sequential delivery of service
• scientific article; zbMATH DE number 4100921 (Why is no real title available?)
• Optimal service‐capacity allocation in a loss system
• Online or offline: channel priority for a dual-channel supply chain under demand and yield uncertainties

This page was built for publication: Capacity allocation in a service system with preferred service completion times

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6077481)