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.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Parallel machine scheduling to minimize the makespan with sequence dependent deteriorating effects (Q336434) (← links)
- A tabu method for a two-agent single-machine scheduling with deterioration jobs (Q336450) (← links)
- Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← links)
- Some single-machine scheduling problems with actual time and position dependent learning effects (Q376654) (← links)
- A time-dependent scheduling problem to minimize the sum of the total weighted tardiness among two agents (Q380599) (← links)
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
- Online scheduling of simple linear deteriorating jobs to minimize the total general completion time (Q387011) (← links)
- Approximation algorithms for parallel machine scheduling with linear deterioration (Q391224) (← links)
- Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times (Q395848) (← links)
- An FPTAS for uniform machine scheduling to minimize makespan with linear deterioration (Q437051) (← links)
- Single-machine group scheduling with general deterioration and learning effects (Q437886) (← links)
- Group scheduling with deteriorating jobs to minimize the total weighted number of late jobs (Q440780) (← links)
- Scheduling problems with two agents and a linear non-increasing deterioration to minimize earliness penalties (Q454994) (← links)
- Uniform parallel-machine scheduling with time dependent processing times (Q457550) (← links)
- Minimizing the makespan for scheduling problems with general deterioration effects (Q460302) (← links)
- Single machine group scheduling with decreasing time-dependent processing times subject to release dates (Q470781) (← links)
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
- Four single-machine scheduling problems involving due date determination decisions (Q497630) (← links)
- A single-machine scheduling with a truncated linear deterioration and ready times (Q497952) (← links)
- Parallel identical machines scheduling with deteriorating jobs and total absolute differences penalties (Q534918) (← links)
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects (Q534943) (← links)
- Single-machine total completion time scheduling with a time-dependent deterioration (Q534948) (← links)
- Scheduling deteriorating jobs on a single machine subject to breakdowns (Q539453) (← links)
- Parallel-batch scheduling of deteriorating jobs with release dates to minimize the makespan (Q541691) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Single-machine scheduling with deteriorating jobs and setup times to minimize the maximum tardiness (Q547127) (← links)
- Notes on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning'' [Math. Comput. Modelling 50 (2009) 401-406] (Q552330) (← links)
- Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times (Q552424) (← links)
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- Two-agent single-machine scheduling problems under increasing linear deterioration (Q552491) (← links)
- Single-machine scheduling problems with both deteriorating jobs and learning effects (Q611502) (← links)
- A single-machine scheduling problem with two-agent and deteriorating jobs (Q611543) (← links)
- Single machine quadratic penalty function scheduling with deteriorating jobs and group technology (Q611621) (← links)
- Single-machine scheduling with deteriorating functions for job processing times (Q611703) (← links)
- A branch and bound algorithm for single machine scheduling with deteriorating values of jobs (Q611733) (← links)
- Minimizing total weighted completion time in a two-machine flow shop scheduling under simple linear deterioration (Q621032) (← links)
- Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities (Q623150) (← links)
- A note on two-machine no-wait flow shop scheduling with deteriorating jobs and machine availability constraints (Q628666) (← links)
- Some single-machine scheduling problems with general effects of learning and deterioration (Q630729) (← links)
- Scheduling problems with general effects of deterioration and learning (Q632713) (← links)
- Single-machine scheduling with linear decreasing deterioration to minimize earliness penalties (Q638880) (← links)
- Some single-machine scheduling with both learning and deterioration effects (Q639137) (← links)
- Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine (Q639173) (← links)
- Single-machine due-window assignment problem with learning effect and deteriorating jobs (Q639174) (← links)
- Joint reply to the erratum and the note on ``Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning'' (Q646155) (← links)
- Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
- Scheduling with deteriorating jobs and learning effects (Q654684) (← links)
- Single-machine scheduling with a nonlinear deterioration function (Q656605) (← links)
- Some single-machine and flowshop scheduling problems with a non-linear deterioration function (Q660909) (← links)