Pages that link to "Item:Q1124688"
From MaRDI portal
The following pages link to Single-machine scheduling with learning considerations (Q1124688):
Displayed 50 items.
- Considerations of single-machine scheduling with deteriorating jobs (Q651712) (← links)
- Scheduling with deteriorating jobs and learning effects (Q654684) (← links)
- Scheduling with job-dependent learning effects and multiple rate-modifying activities (Q656606) (← links)
- A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time (Q660846) (← links)
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
- Minimizing makespan in a two-machine flow shop with effects of deterioration and learning (Q694178) (← links)
- Set-based broadcast scheduling for minimizing the worst access time of multiple data items in wireless environments (Q712676) (← links)
- The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model (Q712692) (← links)
- Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints (Q727323) (← links)
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations (Q730961) (← links)
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
- A note on scheduling deteriorating jobs (Q814222) (← links)
- Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
- Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← links)
- A bicriteria parallel machine scheduling with a learning effect of setup and removal times (Q840149) (← links)
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations (Q845319) (← links)
- Single machine scheduling with past-sequence-dependent setup times and learning effects (Q845955) (← links)
- Single-machine scheduling with deteriorating jobs and learning effects to minimize the makespan (Q857361) (← links)
- Single-machine and two-machine flowshop scheduling with general learning functions (Q859915) (← links)
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines (Q879575) (← links)
- Scheduling jobs families with learning effect on the setup (Q888283) (← links)
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
- A note on the total completion time problem in a permutation flowshop with a learning effect (Q948678) (← links)
- Flow shop scheduling with effects of learning and deterioration (Q949265) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) (← links)
- A note on single-machine group scheduling problems with position-based learning effect (Q965715) (← links)
- A due-date assignment problem with learning effect and deteriorating jobs (Q967804) (← links)
- Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan (Q967873) (← links)
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning (Q969894) (← links)
- Single-machine group scheduling problems with deteriorated and learning effect (Q972174) (← links)
- Single-machine scheduling with learning functions (Q972176) (← links)
- A unified analysis for the single-machine scheduling problem with controllable and non-controllable variable job processing times (Q976475) (← links)
- Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (Q980085) (← links)
- Machine scheduling problems with a general learning effect (Q984120) (← links)
- A note on single-machine scheduling with job-dependent learning effects (Q992738) (← links)
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect (Q1004418) (← links)
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect (Q1008577) (← links)
- Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration (Q1010295) (← links)
- Single machine scheduling and due date assignment with positionally dependent processing times (Q1027580) (← links)
- Single-machine scheduling problems with a learning effect (Q1031592) (← links)
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects (Q1031693) (← links)
- Single machine scheduling problems with position-dependent processing times (Q1032015) (← links)
- Minimizing total weighted completion time on single machine with past-sequence-dependent setup times and exponential time-dependent and position-dependent learning effects (Q1040180) (← links)
- Minimizing the makespan in a single machine scheduling problem with a time-based learning effect (Q1045898) (← links)
- Augmented neural networks for task scheduling. (Q1410307) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- A survey of the state-of-the-art of common due date assignment and scheduling research (Q1600949) (← links)
- Scheduling on parallel processors with varying processing times (Q1652222) (← links)
- Minmax scheduling with acceptable lead-times: extensions to position-dependent processing times, due-window and job rejection (Q1652303) (← links)