Pages that link to "Item:Q1667779"

The following pages link to A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779):

Displaying 8 items.

• On-line supply chain scheduling for single-machine and parallel-machine configurations with a single customer: minimizing the makespan and delivery cost (Q319441) (← links)
• A knowledge-based approach for multi-factory production systems (Q1652022) (← links)
• Multi-parallel work centers scheduling optimization with shared or dedicated resources in low-volume low-variety production systems (Q1988965) (← links)
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
• Minimizing maximum tardiness and delivery costs with batch delivery and job release times (Q2282368) (← links)
• Single-machine batch scheduling of linear deteriorating jobs (Q2344768) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
• Coordination of production and transportation in supply chain scheduling (Q2514664) (← links)