Pages that link to "Item:Q2890420"
From MaRDI portal
The following pages link to The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions (Q2890420):
Displaying 10 items.
- Dual relaxations of the time-indexed ILP formulation for min-sum scheduling problems (Q513629) (← links)
- Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- Scheduling with earliness-tardiness penalties and parallel machines (Q941007) (← links)
- A new model for the preemptive earliness-tardiness scheduling problem (Q1013402) (← links)
- Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
- Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates (Q2482802) (← links)
- A recovering beam search algorithm for the single machine just-in-time scheduling problem (Q2488909) (← links)
- Multicriteria scheduling (Q2566699) (← links)