Pages that link to "Item:Q2268520"
From MaRDI portal
The following pages link to Approximation algorithms for minimizing the total weighted number of late jobs with late deliveries in two-level supply chains (Q2268520):
Displaying 11 items.
- A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries (Q763109) (← links)
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← links)
- A branch and bound algorithm to minimize the total weighed number of tardy jobs and delivery costs (Q1667779) (← links)
- Cost allocation in rescheduling with machine unavailable period (Q1754051) (← links)
- Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
- Integrated production and delivery scheduling on a serial batch machine to minimize the makespan (Q2257290) (← links)
- An uncertain programming model for single machine scheduling problem with batch delivery (Q2313751) (← links)
- Approximation algorithms and an FPTAS for the single machine problem with biased tardiness penalty (Q2336632) (← links)
- Minimizing the weighted number of tardy jobs with due date assignment and capacity-constrained deliveries for multiple customers in supply chains (Q2355078) (← links)
- Two-agent flowshop scheduling to maximize the weighted number of just-in-time jobs (Q2400041) (← links)
