Pages that link to "Item:Q656605"
From MaRDI portal
The following pages link to Single-machine scheduling with a nonlinear deterioration function (Q656605):
Displaying 20 items.
- Parallel-machine scheduling with maintenance: praising the assignment problem (Q322837) (← links)
- Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models (Q336999) (← links)
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898) (← links)
- Single-machine scheduling with deteriorating functions for job processing times (Q611703) (← links)
- A note on optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models (Q660815) (← links)
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)
- Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
- Unrelated parallel-machine scheduling with deterioration effects and deteriorating multi-maintenance activities for minimizing the total completion time (Q727300) (← links)
- A note on scheduling deteriorating jobs (Q814222) (← links)
- Scheduling jobs under simple linear deterioration (Q1332800) (← links)
- Parallel-machine scheduling problems with past-sequence-dependent delivery times and aging maintenance (Q1666798) (← links)
- Some single-machine scheduling with sum-of-processing-time-based and job-position-based processing times (Q1788956) (← links)
- Single-machine scheduling with logarithm deterioration (Q1926617) (← links)
- Single-machine scheduling with upper bounded maintenance time under the deteriorating effect (Q1956114) (← links)
- Machine scheduling problems with a position-dependent deterioration (Q2010053) (← links)
- The single machine total weighted completion time scheduling problem with the sum-of-processing time based models: strongly NP-hard (Q2294176) (← links)
- Improved estimation of distribution algorithm for the problem of single-machine scheduling with deteriorating jobs and different due dates (Q2514071) (← links)
- Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
- (Q4817658) (← links)