Pages that link to "Item:Q2026708"
From MaRDI portal
The following pages link to Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708):
Displaying 15 items.
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)
- A note: minimizing total absolute deviation of job completion times on unrelated machines with general position-dependent processing times and job-rejection (Q1730596) (← links)
- A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
- Single machine scheduling with non-availability interval and optional job rejection (Q2168742) (← links)
- Minmax scheduling problems with common due-date and completion time penalty (Q2424794) (← links)
- Single-machine scheduling and due date assignment with rejection and position-dependent processing times (Q2438395) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- Polynomial time algorithm for minmax scheduling with common due-window and proportional-linear shortening processing times (Q2688577) (← links)
- Scheduling a single machine with job rejection and due-window assignment (Q2923991) (← links)
- (Q5499313) (← links)
- Common due-window assignment and minmax scheduling with resource allocation and group technology on a single machine (Q6094568) (← links)
- Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)
- A note: minmax due-window assignment with fixed earliness-tardiness costs (Q6593204) (← links)
- Minmax common due-window assignment scheduling with deteriorating jobs (Q6601968) (← links)
