Pages that link to "Item:Q4025912"
From MaRDI portal
The following pages link to Minimizing Total Tardiness on a Single Machine with Precedence Constraints (Q4025912):
Displaying 16 items.
- Minimizing the number of tardy jobs in single machine sequencing (Q686166) (← links)
- Scheduling with bully selfish jobs (Q692928) (← links)
- On the complexity of generalized due date scheduling problems (Q1175769) (← links)
- Identical parallel machines vs. unit-time shops and preemptions vs. chains in scheduling complexity (Q1399579) (← links)
- On scheduling cycle shops: Classification, complexity and approximation (Q1600002) (← links)
- A survey on how the structure of precedence constraints may change the complexity class of scheduling problems (Q1617290) (← links)
- On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
- Precedence constrained scheduling to minimize sum of weighted completion times on a single machine (Q1961232) (← links)
- Complexity results for single-machine problems with positive finish-start time-lags (Q1969294) (← links)
- Precedence theorems and dynamic programming for the single-machine weighted tardiness problem (Q1991104) (← links)
- Polyhedral results for position-based scheduling of chains on a single machine (Q2288972) (← links)
- Minimizing Total Tardiness on One Machine is NP-Hard (Q3200872) (← links)
- Technical Note—There are No Undiscovered Priority Index Sequencing Rules for Minimizing Total Delay Costs (Q3329199) (← links)
- Integrality Property in Preemptive Parallel Machine Scheduling (Q3392940) (← links)
- MINIMIZING TOTAL TARDINESS FOR SINGLE MACHINE SEQUENCING (Q4345050) (← links)
- New Precedence Theorems for One-Machine Weighted Tardiness (Q5388048) (← links)
