Pages that link to "Item:Q1848363"
From MaRDI portal
The following pages link to Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties (Q1848363):
Displayed 13 items.
- Project scheduling heuristics-based standard PSO for task-resource assignment in heterogeneous grid (Q535971) (← links)
- Preemption in single machine earliness/tardiness scheduling (Q835565) (← links)
- A faster branch-and-bound algorithm for the earliness-tardiness scheduling problem (Q835579) (← links)
- An improved earliness--tardiness timing algorithm (Q878565) (← links)
- The one-machine just-in-time scheduling problem with preemption (Q1013290) (← links)
- Optimal timing of a sequence of tasks with general completion costs (Q1776957) (← links)
- Earliness-tardiness scheduling with setup considerations (Q1777159) (← links)
- Single machine scheduling to minimize total weighted earliness subject to minimal number of tardy jobs (Q2378377) (← links)
- Fast neighborhood search for the single machine earliness-tardiness scheduling problem (Q2379655) (← links)
- Efficient neighborhood search for the one-machine earliness-tardiness scheduling problem (Q2491772) (← links)
- Multicriteria scheduling (Q2566699) (← links)
- Punctuality and idleness in just-in-time scheduling (Q2566707) (← links)
- Workload simulation and optimisation in multi-criteria hybrid flowshop scheduling: a case study (Q3055316) (← links)