Pages that link to "Item:Q2806861"
From MaRDI portal
The following pages link to A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861):
Displaying 9 items.
- Layered graph approaches for combinatorial optimization problems (Q1628112) (← links)
- Exact solution of the single-machine scheduling problem with periodic maintenances and sequence-dependent setup times (Q1754111) (← links)
- Perspectives on integer programming for time-dependent models (Q2001858) (← links)
- A matheuristic for the generalized order acceptance and scheduling problem (Q2077965) (← links)
- Modeling single machine preemptive scheduling problems for computational efficiency (Q2288995) (← links)
- A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems (Q2806861) (← links)
- Corrigendum to “A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems,” <i>INFORMS Journal on Computing</i> 28(1):14–30, 2016 (Q4995107) (← links)
- An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem (Q6066724) (← links)
- An improved decision support model for scheduling production in an engineer-to-order manufacturer (Q6097850) (← links)
