<p>We examine the integrated optimization of due date assignment and production for a make-to-order manufacturer. Upon receiving an order inquiry, the manufacturer first quotes a due date. The customer’s decision to accept the order is modeled through a placement probability that depends linearly on the quoted due date. For firmly placed orders, the manufacturer has to determine a scheduling rule, so as to maximize with the objective of maximizing expected total profit, defined as revenue minus scheduling cost. Three scheduling cost functions are examined, including the makespan, the total completion time, and total earliness penalties. In all three problems, confirmed orders are required to be completed no later than their assigned due dates. For each problem, we derive optimality properties for processing schedule and due date assignment, and develop solution algorithms. Our studies show that all three problems can be solved in polynomial time.</p>

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Scheduling with due date assignment and placement uncertainty subject to no tardy orders

  • Qing Yue,
  • Zhiyan Wu

摘要

We examine the integrated optimization of due date assignment and production for a make-to-order manufacturer. Upon receiving an order inquiry, the manufacturer first quotes a due date. The customer’s decision to accept the order is modeled through a placement probability that depends linearly on the quoted due date. For firmly placed orders, the manufacturer has to determine a scheduling rule, so as to maximize with the objective of maximizing expected total profit, defined as revenue minus scheduling cost. Three scheduling cost functions are examined, including the makespan, the total completion time, and total earliness penalties. In all three problems, confirmed orders are required to be completed no later than their assigned due dates. For each problem, we derive optimality properties for processing schedule and due date assignment, and develop solution algorithms. Our studies show that all three problems can be solved in polynomial time.