Pages that link to "Item:Q4248925"
From MaRDI portal
The following pages link to Scheduling deteriorating jobs to minimize makespan (Q4248925):
Displaying 42 items.
- A branch and bound algorithm for single machine scheduling with deteriorating values of jobs (Q611733) (← 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)
- Connected searching of weighted trees (Q719311) (← links)
- Preemptive repayment policy for multiple loans (Q763209) (← 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)
- Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times (Q968039) (← links)
- A dynamic programming algorithm for the single-machine scheduling problem with release dates and deteriorating processing times (Q1014305) (← links)
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine (Q1014400) (← links)
- On a scheduling problem of time deteriorating jobs (Q1271170) (← links)
- Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)
- A note on scheduling on a single processor with speed dependent on a number of executed jobs (Q1351619) (← links)
- A variant of the permutation flow shop model with variable processing times (Q1363747) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- Single machine scheduling with deadlines and increasing rates of processing times (Q1567197) (← links)
- Scheduling with time-dependent discrepancy times (Q1702735) (← links)
- A local search algorithm: minimizing makespan of deteriorating jobs with relaxed agreeable weights (Q1742901) (← 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)
- Variable neighborhood search for parallel machines scheduling problem with step deteriorating jobs (Q1955358) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← 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)
- Scheduling piecewise linear deteriorating jobs to minimize makespan in a two-machine flowshop (Q2241320) (← links)
- Solution methods for scheduling problems with sequence-dependent deterioration and maintenance events (Q2242370) (← links)
- A closed-form solution for the optimal release times for the \(F2|\) deteriorating jobs \(|\sum w_{j}c_{j}\) problem (Q2275945) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Scheduling with step-deteriorating jobs to minimize the makespan (Q2315619) (← links)
- A general variable neighborhood search for single-machine total tardiness scheduling problem with step-deteriorating jobs (Q2438422) (← links)
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time (Q2470098) (← links)
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
- SCHEDULING PROPORTIONALLY DETERIORATING JOBS IN TWO-MACHINE OPEN SHOP WITH A NON-BOTTLENECK MACHINE (Q3103656) (← links)
- A multiple-criterion model for machine scheduling with constant deteriorating jobs (Q3513356) (← links)
- Makespan minimization in single-machine scheduling with step-deterioration of processing times (Q4661099) (← links)
- Single-machine scheduling with deteriorating jobs (Q4909259) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- A note on single-machine makespan scheduling with deteriorating jobs and scheduled maintenance (Q5455039) (← links)
- An approximation algorithm for parallel machine scheduling with simple linear deterioration (Q5456305) (← links)
- Single machine scheduling with step-deteriorating processing times (Q5952512) (← links)
- Exact algorithms and approximation schemes for proportionate flow shop scheduling with step-deteriorating processing times (Q6577340) (← links)
