Pages that link to "Item:Q442286"
From MaRDI portal
The following pages link to Optimal algorithms for online single machine scheduling with deteriorating jobs (Q442286):
Displaying 12 items.
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- Online scheduling on a single machine with grouped processing times (Q1723520) (← links)
- Single-machine online scheduling of jobs with non-delayed processing constraint (Q2045026) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- Online scheduling on a single machine with linear deteriorating processing times and delivery times (Q2082204) (← links)
- An approximation algorithm based on game theory for scheduling simple linear deteriorating jobs (Q2250443) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- A best possible algorithm for an online scheduling problem with deteriorating effect in steel box girder section production (Q2691495) (← links)
- An online batch scheduling with linear deterioration effect (Q2887140) (← links)
- Online scheduling on a single machine with deteriorating jobs and job delivery (Q3195995) (← links)
- New bounds for single-machine time-dependent scheduling with uniform deterioration (Q6562460) (← links)