Pages that link to "Item:Q3157377"
From MaRDI portal
The following pages link to Scheduling with time dependent processing times: Review and extensions (Q3157377):
Displayed 50 items.
- Online scheduling with linear deteriorating jobs to minimize the total weighted completion time (Q668523) (← links)
- Single-machine scheduling with nonlinear deterioration (Q691413) (← links)
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
- A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem (Q707153) (← links)
- Preemptive scheduling with simple linear deterioration on a single machine (Q708208) (← links)
- Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) (← links)
- Single machine scheduling with sum-of-logarithm-processing-times based deterioration (Q726391) (← links)
- Single machine group scheduling with time dependent processing times and ready times (Q726558) (← links)
- A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs (Q733523) (← links)
- Isomorphic scheduling problems (Q744639) (← links)
- A note on scheduling deteriorating jobs (Q814222) (← links)
- A memetic algorithm for minimizing the total weighted completion time on a single machine under step-deterioration (Q833646) (← links)
- Batch scheduling of step deteriorating jobs (Q835578) (← links)
- Scheduling algorithms for procrastinators (Q835586) (← links)
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
- A tabu search heuristic for a sequence-dependent and time-dependent scheduling problem on a single machine (Q835634) (← links)
- Parallel-machine scheduling of simple linear deteriorating jobs (Q837167) (← links)
- Two-machine flowshop scheduling problems involving a batching machine with transportation or deterioration consideration (Q840154) (← links)
- An FPTAS for scheduling jobs with piecewise linear decreasing processing times to minimize makespan (Q845960) (← links)
- Minimizing total completion time in a two-machine flow shop with deteriorating jobs (Q850246) (← links)
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan (Q857361) (← links)
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
- Batching deteriorating items with applications in computer communication and reverse logistics (Q884021) (← links)
- Scheduling linear deteriorating jobs with rejection on a single machine (Q953419) (← links)
- Scheduling time-dependent jobs under mixed deterioration (Q963924) (← links)
- Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) (← links)
- Rescheduling problems with deteriorating jobs under disruptions (Q967797) (← links)
- A note on single-machine scheduling with decreasing time-dependent job processing times (Q967802) (← links)
- A due-date assignment problem with learning effect and deteriorating jobs (Q967804) (← links)
- Scheduling a single fire fighting resource with deteriorating fire suppression times and set-up times (Q968039) (← links)
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning (Q969894) (← links)
- Single machine scheduling with decreasing linear deterioration under precedence constraints (Q980093) (← links)
- Minimizing the total completion time in permutation flow shop with machine-dependent job deterioration rates (Q1001006) (← links)
- Single machine parallel-batch scheduling with deteriorating jobs (Q1006057) (← links)
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration (Q1010295) (← links)
- Scheduling linear deteriorating jobs to minimize makespan with an availability constraint on a single machine (Q1014400) (← links)
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration (Q1037697) (← links)
- Conjugate problems in time-dependent scheduling (Q1041348) (← links)
- Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
- Equivalent time-dependent scheduling problems (Q1041934) (← links)
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect (Q1045898) (← links)
- A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- Minimizing the total weighted completion time of deteriorating jobs (Q1603525) (← links)
- Total tardiness minimization in permutation flowshop with deterioration consideration (Q1630777) (← links)
- Scheduling deteriorating jobs with a learning effect on unrelated parallel machines (Q1634126) (← links)
- Matheuristic approaches for parallel machine scheduling problem with time-dependent deterioration and multiple rate-modifying activities (Q1652634) (← links)
- Single machine group scheduling with position dependent processing times and ready times (Q1664992) (← links)
- A decomposition-based two-stage optimization algorithm for single machine scheduling problems with deteriorating jobs (Q1665390) (← links)
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)