Capacity allocation in a service system with preferred service completion times

DOI10.1002/nav.22046zbMath1523.90146OpenAlexW4205906882MaRDI QIDQ6077481

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

Publication date: 18 October 2023

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

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

zbMATH Keywords

Markov decision processespolicy improvementcustomer preferencesorder pickup

Mathematics Subject Classification ID

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

Cites Work

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

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