Pages that link to "Item:Q1342278"

The following pages link to Scheduling with batching: Minimizing the weighted number of tardy jobs (Q1342278):

Displaying 23 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Batch machine production with perishability time windows and limited batch size (Q631099) (← links)
• Two-agent scheduling with agent specific batches on an unbounded serial batching machine (Q892842) (← links)
• Forming and scheduling jobs with capacitated containers in semiconductor manufacturing: Single machine problem (Q940867) (← links)
• Parallel machine batching and scheduling with deadlines (Q1567300) (← links)
• A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779) (← links)
• Family scheduling with batch availability in flow shops to minimize makespan (Q1743654) (← links)
• Maximization of solution flexibility for robust shop scheduling (Q1772837) (← links)
• Minimizing total weighted tardiness on a single batch process machine with incompatible job families (Q1885945) (← links)
• Single machine batch scheduling with deadlines and resource dependent processing times (Q1924618) (← links)
• Scheduling with batching: A review (Q1969826) (← links)
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
• Optimal delivery time quotation in supply chains to minimize tardiness and delivery costs (Q2018942) (← links)
• Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (Q2268520) (← links)
• Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
• Scheduling on a batch processing machine with split compatibility graphs (Q2583507) (← links)
• Single machine batch scheduling with non-increasing time slot costs (Q2673533) (← links)
• Scheduling with centralized and decentralized batching policies in concurrent open shops (Q2994798) (← links)
• One-operator, two-machine open shop and flow shop problems with setup times for machines and weighted number of tardy jobs objective (Q3156721) (← links)
• Single machine scheduling with deadlines, release and due dates (Q4375438) (← links)
• Scheduling batches with simultaneous job processing for two-machine shop problems (Q5932282) (← links)
• Single machine batch scheduling with resource dependent setup and processing times (Q5954835) (← links)
• Scheduling with batching: Two job types (Q5961608) (← links)