Pages that link to "Item:Q1271170"
From MaRDI portal
The following pages link to On a scheduling problem of time deteriorating jobs (Q1271170):
Displaying 34 items.
- A note on a fully polynomial-time approximation scheme for minimizing makespan of deteriorating jobs (Q474321) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- Scheduling linear deteriorating jobs to minimize the number of tardy jobs (Q693149) (← links)
- Optimal composition ordering problems for piecewise linear functions (Q724224) (← links)
- A note on scheduling deteriorating jobs (Q814222) (← links)
- Patients scheduling problems with deferred deteriorated functions (Q887895) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- Rescheduling problems with deteriorating jobs under disruptions (Q967797) (← links)
- A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times (Q1014305) (← links)
- Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- Minimizing the total weighted completion time of deteriorating jobs (Q1603525) (← links)
- Scheduling with time-dependent discrepancy times (Q1702735) (← links)
- A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901) (← links)
- Complexity of scheduling with proportional deterioration and release dates (Q1787790) (← links)
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires (Q1959184) (← links)
- Multitasking scheduling problems with deterioration effect (Q1992785) (← links)
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- A note on the complexity of scheduling problems with linear job deterioration (Q2349528) (← links)
- Complexity and approximability of scheduling resumable proportionally deteriorating jobs (Q2379562) (← 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)
- Scheduling with deteriorating jobs and non-simultaneous machine available times (Q2788530) (← links)
- The rescheduling problem on minimizing the total lateness with time disruption and deteriorating jobs (Q2927213) (← links)
- Single machine scheduling with time deteriorating job values (Q3505944) (← links)
- Parallel machine scheduling problems with proportionally deteriorating jobs (Q3612784) (← links)
- Scheduling deteriorating jobs to minimize makespan (Q4248925) (← links)
- NP-hard cases in scheduling deteriorating jobs on dedicated machines (Q4658457) (← links)
- (Q4714493) (← links)
- Single-machine scheduling with deteriorating jobs (Q4909259) (← links)
- Two-machine job shop scheduling with deteriorating jobs (Q5399741) (← links)
- Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times (Q6577340) (← links)