Pages that link to "Item:Q1923596"
From MaRDI portal
The following pages link to Parallel machine scheduling with time dependent processing times (Q1923596):
Displaying 50 items.
- Approximation algorithms for parallel machine scheduling with linear deterioration (Q391224) (← links)
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← links)
- Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← links)
- Scheduling a variable maintenance and linear deteriorating jobs on a single machine (Q458380) (← links)
- Optimizing busy time on parallel machines (Q476900) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
- Scheduling of deteriorating jobs with release dates to minimize the maximum lateness (Q690456) (← links)
- Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- Scheduling to minimize the maximum total completion time per machine (Q726222) (← links)
- Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
- Total completion time in a two-machine flowshop with deteriorating tasks (Q928678) (← links)
- Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
- ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- On a parallel machine scheduling problem with equal processing times (Q1028485) (← links)
- Batch scheduling of simple linear deteriorating jobs on a single machine to minimize makespan (Q1038382) (← links)
- Equivalent time-dependent scheduling problems (Q1041934) (← links)
- A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099) (← links)
- Analysis of a linear programming heuristic for scheduling unrelated parallel machines (Q1061599) (← links)
- Worst-case error bounds for parallel machine scheduling problems with bounded sequence-dependent setup times (Q1318658) (← links)
- Heuristics for parallel machine scheduling with delivery times (Q1338896) (← links)
- Complexity analysis of job-shop scheduling with deteriorating jobs (Q1348391) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- Parallel machine scheduling with completion-time-based criteria and sequence-dependent deterioration (Q1634051) (← links)
- Scheduling on parallel processors with varying processing times (Q1652222) (← links)
- Parallel-machine scheduling with time-dependent and machine availability constraints (Q1667046) (← links)
- Coordination mechanisms for scheduling games with proportional deterioration (Q1694911) (← links)
- Identical parallel machine scheduling with time-dependent processing times (Q1704597) (← links)
- Parallel machine scheduling models with fuzzy processing times (Q1886763) (← links)
- Bounded parallel-batch scheduling on single and multi machines for deteriorating jobs (Q1944138) (← links)
- Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires (Q1959184) (← links)
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times (Q2168720) (← links)
- Scheduling jobs with normally distributed processing times on parallel machines (Q2242242) (← links)
- Parallel machines scheduling with deteriorating jobs and availability constraints (Q2257611) (← 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)
- A new model and algorithm for uncertain random parallel machine scheduling problem (Q2318555) (← links)
- Analysis of a time-dependent scheduling problem by signatures of deterioration rate sequences (Q2433803) (← links)
- Single machine group scheduling under decreasing linear deterioration (Q2454982) (← links)
- Parallel-machine scheduling with simple linear deterioration to minimize total completion time (Q2470098) (← links)
- Single-machine scheduling with deteriorating jobs under a series-parallel graph constraint (Q2471238) (← links)
- Parallel-machine scheduling with time dependent processing times (Q2481965) (← links)
- Scheduling linear deteriorating jobs with an availability constraint on a single machine (Q2508968) (← links)
- Pareto and scalar bicriterion optimization in scheduling deteriorating jobs (Q2566940) (← links)
- Parallel-machine scheduling with potential disruption and positional-dependent processing times (Q2628178) (← links)
- Single-machine scheduling with proportionally deteriorating jobs subject to availability constraints (Q2920364) (← links)
