Pages that link to "Item:Q5388048"
From MaRDI portal
The following pages link to New Precedence Theorems for One-Machine Weighted Tardiness (Q5388048):
Displaying 13 items.
- Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity (Q339549) (← links)
- The single-machine total tardiness scheduling problem: review and extensions (Q1038369) (← links)
- Distributionally robust single machine scheduling with the total tardiness criterion (Q1628037) (← links)
- Sequential testing of \(n\)-out-of-\(n\) systems: precedence theorems and exact methods (Q1755382) (← links)
- Minimizing the weighted sum of squared tardiness on a single machine (Q1762060) (← links)
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
- Minimizing delays in a shunting yard (Q2018111) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Unrelated parallel machine scheduling with eligibility constraints and delivery times to minimize total weighted tardiness (Q2108098) (← links)
- A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance (Q2147013) (← links)
- The proportionate flow shop total tardiness problem (Q2178064) (← links)
- New results for single-machine scheduling with past-sequence-dependent setup times and due date-related objectives (Q2424773) (← links)
- One-Machine Sequencing to Minimize Total Tardiness: A Fourth Theorem for Emmons (Q2875603) (← links)
