Pages that link to "Item:Q2483505"
From MaRDI portal
The following pages link to An efficient algorithm for minimizing earliness, tardiness, and due-date costs for equal-sized jobs (Q2483505):
Displaying 6 items.
- Scheduling problems with two competing agents to minimized weighted earliness-tardiness (Q339552) (← links)
- Due-window assignment problems with unit-time jobs (Q902534) (← links)
- Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time (Q1617277) (← links)
- Soft due window assignment and scheduling of unit-time jobs on parallel machines (Q1935552) (← links)
- A fully polynomial time approximation scheme for weighted job-dependent earliness-tardiness problem with agreeable ratios (Q1956478) (← links)
- Minimizing weighted earliness-tardiness and due-date cost with unit processing-time jobs (Q2490167) (← links)
