Pages that link to "Item:Q1014943"
From MaRDI portal
The following pages link to Minimizing the sum of job completion times on capacitated two-parallel machines (Q1014943):
Displaying 8 items.
- Parallel machines scheduling with machine maintenance for minsum criteria (Q421521) (← links)
- Lagrangian relaxation and column generation-based lower bounds for the \(\text{Pm},h_{j1}\parallel \sum w_iC_i\) scheduling problem (Q470933) (← links)
- Online scheduling of malleable parallel jobs with setup times on two identical machines (Q976487) (← links)
- Maximizing the minimum completion time on parallel machines (Q1029565) (← links)
- A note on ``A mixed integer programming model for advanced planning and scheduling (APS)'' (Q1046091) (← links)
- Capacitated two-parallel machines scheduling to minimize sum of job completion times (Q1208482) (← links)
- Minimizing the sum of job completion times on capacitated parallel machines (Q1339850) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
