Pages that link to "Item:Q2434249"

The following pages link to A bicriteria approach to minimize the total weighted number of tardy jobs with convex controllable processing times and assignable due dates (Q2434249):

Displaying 11 items.

• A survey of single machine scheduling to minimize weighted number of tardy jobs (Q380558) (← links)
• Resource constrained scheduling with general truncated job-dependent learning effect (Q511713) (← links)
• Controllable processing times in project and production management: analysing the trade-off between processing times and the amount of resources (Q1666672) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• Bicriterion scheduling with a negotiable common due window and resource-dependent processing times (Q2004709) (← links)
• Pseudo-polynomial dynamic programming for an integrated due date assignment, resource allocation, production, and distribution scheduling model in supply chain scheduling (Q2009683) (← links)
• Single-machine scheduling with machine unavailability periods and resource dependent processing times (Q2242291) (← links)
• Bicriteria scheduling for due date assignment with total weighted tardiness (Q4553877) (← links)
• A note on resource allocation scheduling with position-dependent workloads (Q5058801) (← links)
• A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity (Q5359051) (← links)
• A new perspective on single-machine scheduling problems with late work related criteria (Q6160955) (← links)