Pages that link to "Item:Q2450684"

The following pages link to Single machine scheduling with job-dependent convex cost and arbitrary precedence constraints (Q2450684):

Displaying 10 items.

• Exact and heuristic algorithms for minimizing tardy/lost penalties on a single-machine scheduling problem (Q725705) (← links)
• Single machine precedence constrained scheduling is a Vertex cover problem (Q1016523) (← links)
• Resource cost aware scheduling (Q1750475) (← links)
• How unsplittable-flow-covering helps scheduling with job-dependent cost functions (Q1751090) (← links)
• An algorithm for insertion of idle time in the single-machine scheduling problem with convex cost functions (Q1772863) (← links)
• A modified modeling approach and a heuristic procedure for the multi-mode resource constrained project scheduling problem with activity splitting (Q2798120) (← links)
• Dual Techniques for Scheduling on a Machine with Varying Speed (Q3174696) (← links)
• single Machine Preemptive Scheduling With Special Cost Functions¹ (Q4888275) (← links)
• Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining (Q5060783) (← links)
• Order constraints for single machine scheduling with non-linear cost (Q5232495) (← links)