Pages that link to "Item:Q1628126"
From MaRDI portal
The following pages link to A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126):
Displayed 14 items.
- Single machine lot scheduling with optional job-rejection (Q2025088) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- New results for scheduling to minimize tardiness on one machine with rejection and related problems (Q2061129) (← links)
- Minimizing the total tardiness and job rejection cost in a proportionate flow shop with generalized due dates (Q2066679) (← links)
- Order assignment and scheduling under processing and distribution time uncertainty (Q2083940) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- A greedy heuristic for solving scheduling problems with bounded rejection cost (Q2147117) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach (Q2668761) (← links)
- Scheduling with competing agents, total late work and job rejection (Q2668778) (← links)
- On the mass COVID-19 vaccination scheduling problem (Q2669767) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
- Online scheduling with deterioration and unexpected processor breakdown (Q6047192) (← links)
- Single machine scheduling to minimize maximum earliness/tardiness cost with job rejection (Q6204202) (← links)