Pages that link to "Item:Q2503085"

The following pages link to Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect (Q2503085):

Displaying 50 items.

• An order scheduling problem with position-based learning effect (Q342484) (← links)
• Bi-criteria single machine scheduling with a time-dependent learning effect and release times (Q345517) (← links)
• Single-machine scheduling with learning and forgetting effects (Q358103) (← links)
• Single machine problem with multi-rate-modifying activities under a time-dependent deterioration (Q364253) (← links)
• Some single-machine scheduling problems with actual time and position dependent learning effects (Q376654) (← links)
• Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
• Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect (Q440896) (← links)
• A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects (Q454917) (← links)
• A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects (Q497951) (← links)
• A simple proof technique for scheduling models with learning effects (Q499700) (← links)
• Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects (Q534925) (← links)
• Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects (Q534943) (← links)
• Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects'' (Q545340) (← 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)
• Minimizing the total completion time in a single-machine scheduling problem with a learning effect (Q552439) (← links)
• Single-machine scheduling simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption (Q552458) (← links)
• A production-inventory model for a deteriorating item incorporating learning effect using genetic algorithm (Q606192) (← links)
• Single-machine scheduling problems with a sum-of-processing-time-based learning function (Q606421) (← links)
• Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect (Q611500) (← links)
• Single-machine scheduling problems with both deteriorating jobs and learning effects (Q611502) (← links)
• Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect (Q611619) (← links)
• Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine (Q639173) (← links)
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← 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)
• Improved DE search for competing groups scheduling with deterioration effects (Q828669) (← links)
• Single machine scheduling models with deterioration and learning: Handling precedence constraints via priority generation (Q835616) (← 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)
• Scheduling jobs families with learning effect on the setup (Q888283) (← links)
• Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning (Q969894) (← 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)
• Machine scheduling problems with a general learning effect (Q984120) (← 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)
• 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)
• Scheduling with job-splitting considering learning and the vital-few law (Q1652529) (← links)
• Multiple-machine scheduling with learning effects and cooperative games (Q1664951) (← links)
• Note on a single-machine scheduling problem with sum of processing times based learning and ready times (Q1665710) (← links)
• Sum-of-processing-times-based two-agent single-machine scheduling with aging effects and tardiness (Q1666548) (← links)
• Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning (Q1667775) (← links)
• Single machine past-sequence-dependent delivery times scheduling with general position-dependent and time-dependent learning effects (Q1667841) (← links)
• Parallel machine scheduling with general sum of processing time based models (Q1675579) (← links)
• Single machine scheduling with a generalized job-dependent cumulative effect (Q1702657) (← links)
• A genetic algorithm-based approach for single-machine scheduling with learning effect and release time (Q1717946) (← links)
• Minimizing the makespan for a two-stage three-machine assembly flow shop problem with the sum-of-processing-time based learning effect (Q1727266) (← links)
• Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects (Q1751144) (← links)