Pages that link to "Item:Q2444843"
From MaRDI portal
The following pages link to Online scheduling on a single machine with rejection under an agreeable condition to minimize the total completion time plus the total rejection cost (Q2444843):
Displaying 11 items.
- Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) (← links)
- New results on two-machine flow-shop scheduling with rejection (Q281786) (← links)
- Online scheduling with rejection to minimize the total weighted completion time plus the total rejection cost on parallel machines (Q290334) (← links)
- Parallel-machine scheduling with release dates and rejection (Q295880) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- New approximation algorithms for machine scheduling with rejection on single and parallel machine (Q830930) (← links)
- Scheduling problems with rejection to minimize the maximum flow time (Q1691942) (← links)
- Applying ``peeling onion'' approach for competitive analysis in online scheduling with rejection (Q2029304) (← links)
- Online scheduling to minimize the total weighted completion time plus the rejection cost (Q2410099) (← links)
- A semi-online algorithm and its competitive analysis for parallel-machine scheduling problem with rejection (Q2662527) (← links)
- A Semi-Online Algorithm for Single Machine Scheduling with Rejection (Q5024475) (← links)
