The following pages link to (Q4233364):
Displayed 13 items.
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← links)
- A generic approach to proving NP-hardness of partition type problems (Q608273) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- Equivalent time-dependent scheduling problems (Q1041934) (← links)
- Scheduling simple linear deteriorating jobs with rejection (Q1717817) (← links)
- Scheduling start time dependent tasks with deadlines and identical initial processing times on a single machine (Q1869884) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences (Q2433803) (← links)
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940) (← links)
- An FPTAS for the weighted number of tardy jobs minimization on a single machine with deteriorating jobs (Q2628167) (← links)
- A time-dependent multiple criteria single-machine scheduling problem (Q5954823) (← links)