Pages that link to "Item:Q2464427"
From MaRDI portal
The following pages link to Minimizing total completion time subject to job release dates and preemption penalties (Q2464427):
Displaying 11 items.
- Scheduling the part supply of mixed-model assembly lines in line-integrated supermarkets (Q297414) (← links)
- Multi-mode resource-constrained project scheduling problems with non-preemptive activity splitting (Q337299) (← links)
- Strong LP formulations for scheduling splittable jobs on unrelated machines (Q896269) (← links)
- Lower bounds on online deadline scheduling with preemption penalties (Q975450) (← links)
- Approximation issues of fractional knapsack with penalties: a note (Q2144213) (← links)
- A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints (Q2256319) (← links)
- Split scheduling with uniform setup times (Q2341391) (← links)
- On-line production order scheduling with preemption penalties (Q2385487) (← links)
- A survey of scheduling problems with setup times or costs (Q2467249) (← links)
- Single-machine past-sequence-dependent setup times scheduling with resource allocation and learning effect (Q2954339) (← links)
- Dynamic Windows Scheduling with Reallocation (Q5102055) (← links)
