Pages that link to "Item:Q969519"
From MaRDI portal
The following pages link to A faster algorithm for a due date assignment problem with tardy jobs (Q969519):
Displaying 10 items.
- A survey on offline scheduling with rejection (Q398830) (← links)
- Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
- A simpler and faster algorithm for optimal total-work-content-power due data determination (Q583099) (← links)
- Due-window assignment problems with unit-time jobs (Q902534) (← links)
- Clever or smart: strategies for the online target date assignment problem (Q968114) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Trading off due-date tightness and job tardiness in a basic scheduling model (Q2356123) (← links)
- An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505) (← links)
- Bicriteria scheduling for due date assignment with total weighted tardiness (Q4553877) (← links)
- Proportionate flow shop: New complexity results and models with due date assignment (Q5249462) (← links)