Pages that link to "Item:Q2942689"
From MaRDI portal
The following pages link to A Strong Preemptive Relaxation for Weighted Tardiness and Earliness/Tardiness Problems on Unrelated Parallel Machines (Q2942689):
Displaying 13 items.
- Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
- Exact methods for order acceptance and scheduling on unrelated parallel machines (Q1725610) (← links)
- A genetic algorithm for the hybrid flow shop scheduling with unrelated machines and machine eligibility (Q1782178) (← links)
- Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
- Branch-and-price approach for robust parallel machine scheduling with sequence-dependent setup times (Q2140270) (← links)
- On the exact solution of a large class of parallel machine scheduling problems (Q2197322) (← links)
- A unified heuristic and an annotated bibliography for a large class of earliness-tardiness scheduling problems (Q2327956) (← links)
- An exact extended formulation for the unrelated parallel machine total weighted completion time problem (Q2400044) (← links)
- On the mass COVID-19 vaccination scheduling problem (Q2669767) (← links)
- Exact and matheuristic methods for the parallel machine scheduling and location problem with delivery time and due date (Q2676340) (← links)
- An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems (Q6078600) (← links)
- Efficient algorithms for flexible job shop scheduling with parallel machines (Q6093557) (← links)
- Dynamic scheduling of patients in emergency departments (Q6113312) (← links)
