Pages that link to "Item:Q706883"

The following pages link to Manufacturing lead-time rules: customer retention versus tardiness costs (Q706883):

Displaying 23 items.

• Coping with production time variability via dynamic lead-time quotation (Q331769) (← links)
• Optimal and heuristic lead-time quotation for an integrated steel mill with a minimum batch size (Q541698) (← links)
• Bicriteria problems to minimize maximum tardiness and due date assignment cost in various scheduling environments (Q708343) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
• Optimal due date assignment in multi-machine scheduling environments (Q835592) (← links)
• Effective on-line algorithms for reliable due date quotation and large-scale scheduling (Q835600) (← links)
• Two due date assignment problems in scheduling a single machine (Q867932) (← links)
• Computer assisted customer churn management: state-of-the-art and future trends (Q878562) (← links)
• Order acceptance with weighted tardiness (Q878579) (← links)
• Single-machine scheduling CON/SLK due window assignment problems with sum-of-processed times based learning effect (Q902764) (← links)
• The single-machine earliness-tardiness scheduling problem with due date assignment and resource-dependent processing times (Q940868) (← links)
• Order acceptance and due-date quotation in low machine rates (Q1630128) (← links)
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
• Reducing the cost of untimely supply chain delivery performance for asymmetric Laplace distributed delivery (Q2009942) (← links)
• Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
• Lead-time quotations in unobservable make-to-order systems with strategic customers: risk aversion, load control and profit maximization (Q2028808) (← links)
• Online traveling salesman problem with time cost and non-zealous server (Q2082223) (← links)
• Fast algorithms for scheduling with learning effects and time-dependent processing times on a single machine (Q2253532) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
• Dynamic lead time quotation under responsive inventory and multiple customer classes (Q2362239) (← links)
• A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249) (← links)
• Competitive analysis for make-to-order scheduling with reliable lead time quotation (Q2436673) (← links)
• Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)