Pages that link to "Item:Q4853326"
From MaRDI portal
The following pages link to HEURISTIC FOR MINIMIZING THE NUMBER OF LATE JOBS ON TWO PROCESSORS (Q4853326):
Displaying 5 items.
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Anarchy in the UJ: coordination mechanisms for minimizing the number of late jobs (Q2140265) (← links)
- Parallel machine scheduling with minimum number of tardy jobs: approximation and exponential algorithms (Q2242051) (← links)
- Minimizing the weighted number of tardy jobs on multiple machines: a review (Q2358307) (← links)
- Generating efficient schedules for identical parallel machines involving flow-time and tardy jobs (Q2566704) (← links)
