Pages that link to "Item:Q4017089"
From MaRDI portal
The following pages link to Single Machine Scheduling to Minimize Total Late Work (Q4017089):
Displayed 15 items.
- A note on a single machine scheduling problem with generalized total tardiness objective function (Q763495) (← links)
- A note on the two machine job shop with the weighted late work criterion (Q880589) (← links)
- Scheduling two agents with controllable processing times (Q976351) (← links)
- Approximation algorithms for scheduling a single machine to minimize total late work (Q1196210) (← links)
- Minimizing the weighted number of tardy task units (Q1329790) (← links)
- Scheduling imprecise computation tasks with \(0/1\)-constraint (Q1377660) (← links)
- Open shop scheduling problems with late work criteria. (Q1421458) (← links)
- The two-machine flow-shop problem with weighted late work criterion and common due date (Q1772844) (← links)
- Improving the complexities of approximation algorithms for optimization problems (Q1904613) (← links)
- Multivariate composite distributions for coefficients in synthetic optimization problems (Q1969891) (← links)
- Approximation algorithms for minimizing the total weighted tardiness on a single machine (Q2368997) (← links)
- Scheduling imprecise computation tasks on uniform processors (Q2379995) (← links)
- Metaheuristic approaches for the two-machine flow-shop problem with weighted late work criterion and common due date (Q2384909) (← links)
- THE NP-HARDNESS OF MINIMIZING THE TOTAL LATE WORK ON AN UNBOUNDED BATCH MACHINE (Q3392292) (← links)
- A DUAL CRITERIA PREEMPTIVE SCHEDULING PROBLEM FOR MINIMAX ERROR OF IMPRECISE COMPUTATION TASKS (Q4667920) (← links)