Pages that link to "Item:Q3370366"
From MaRDI portal
The following pages link to Flow-shop scheduling with a learning effect (Q3370366):
Displayed 50 items.
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms (Q336439) (← links)
- Several flow shop scheduling problems with truncated position-based learning effect (Q336658) (← links)
- Flowshop scheduling with a general exponential learning effect (Q336933) (← links)
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
- A revision of some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations (Q454887) (← links)
- Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
- Single-machine scheduling with two competing agents and learning consideration (Q497627) (← links)
- Fuzzy production inventory model for deteriorating items with shortages under the effect of time dependent learning and forgetting: a possibility/necessity approach (Q505150) (← links)
- A revision of machine scheduling problems with a general learning effect (Q534844) (← links)
- Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects (Q534925) (← links)
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects'' (Q545340) (← links)
- Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect (Q611500) (← links)
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect (Q611619) (← links)
- Single machine multiple common due dates scheduling with learning effects (Q630690) (← links)
- Some single-machine scheduling with both learning and deterioration effects (Q639137) (← links)
- Single-machine scheduling problems with time and position dependent processing times (Q646660) (← links)
- A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
- Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations (Q845319) (← links)
- A note on flow shop scheduling problems with a learning effect on no-idle dominant machines (Q879575) (← links)
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
- Erratum to: ``A note on flow shop scheduling problems with a learning effect on no-idle dominant machines'' by M. Cheng et al. (Q943578) (← 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)
- Single-machine scheduling with learning functions (Q972176) (← links)
- Bi-criteria single machine scheduling problem with a learning effect: Aneja-Nair method to obtain the set of optimal sequences (Q980085) (← links)
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect (Q1008577) (← links)
- Single machine scheduling and due date assignment with positionally dependent processing times (Q1027580) (← 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)
- Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)
- Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623) (← links)
- Two-agent scheduling to minimize the maximum cost with position-dependent jobs (Q1723571) (← links)
- Single-machine group scheduling with time-dependent learning effect and position-based setup time learning effect (Q1761825) (← links)
- The single-machine total weighted tardiness scheduling problem with position-based learning effects (Q1762088) (← links)
- Several single-machine scheduling problems with general learning effects (Q1930782) (← links)
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
- Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects (Q2008062) (← links)
- Machine scheduling problems with a position-dependent deterioration (Q2010053) (← links)
- An optimal online algorithm for single-processor scheduling problem with learning effect (Q2079858) (← links)
- A best possible algorithm for an online scheduling problem with position-based learning effect (Q2171076) (← links)
- A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms (Q2213408) (← links)
- Flow shop scheduling jobs with position-dependent processing times (Q2386828) (← links)
- Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times (Q2389069) (← links)
- Single-machine scheduling with general learning functions (Q2389734) (← links)
- Some scheduling problems with general position-dependent and time-dependent learning effects (Q2390362) (← links)
- Single machine scheduling with a general exponential learning effect (Q2428939) (← links)
- Scheduling with a position-weighted learning effect (Q2439518) (← links)
- Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)