Pages that link to "Item:Q1905074"
From MaRDI portal
The following pages link to A note on single-processor scheduling with time-dependent execution times (Q1905074):
Displaying 24 items.
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- Better permutations for the single-processor scheduling with time restrictions (Q523167) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)
- Scheduling on a single processor with variable speed (Q673343) (← links)
- Scheduling with time-dependent execution times (Q673610) (← links)
- A multiperiod single processor scheduling problem with periodic requirements (Q818097) (← links)
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration (Q833646) (← links)
- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) (← links)
- A note on scheduling on a single processor with speed dependent on a number of executed jobs (Q1351619) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- An algorithm for constructing single processor static-dynamic schedules (Q1789208) (← links)
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine (Q1869884) (← links)
- Minimizing the total completion time in single-machine scheduling with step-deteriorating jobs (Q1886856) (← links)
- Parallel machine scheduling with time dependent processing times (Q1923596) (← links)
- Minimizing total load on parallel machines with linear deterioration (Q2174916) (← links)
- The single-processor scheduling problem with time restrictions: complexity and related problems (Q2304117) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
- A SINGLE-MACHINE DETERIORATING JOB SCHEDULING PROBLEM WITH A NON-REGULAR CRITERION (Q3013563) (← links)
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs (Q5059255) (← links)
- Greedy solutions of selection and ordering problems (Q5945209) (← links)
