Pages that link to "Item:Q5933821"

The following pages link to Single machine scheduling with learning effect considerations (Q5933821):

Displaying 50 items.

• An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
• 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)
• Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models (Q336999) (← links)
• An order scheduling problem with position-based learning effect (Q342484) (← links)
• On single processor scheduling problems with learning dependent on the number of processed jobs (Q350495) (← links)
• Single-machine scheduling with learning and forgetting effects (Q358103) (← links)
• Some single-machine scheduling problems with actual time and position dependent learning effects (Q376654) (← links)
• Scheduling jobs with truncated exponential learning functions (Q395856) (← links)
• Scheduling with general position-based learning curves (Q424784) (← links)
• Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
• A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects (Q454917) (← links)
• Minimizing the makespan for scheduling problems with general deterioration effects (Q460302) (← links)
• Single-machine scheduling with accelerating learning effects (Q474156) (← 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)
• Four single-machine scheduling problems involving due date determination decisions (Q497630) (← 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 scheduling with piece-rate maintenance and interval constrained position-dependent processing times (Q505770) (← links)
• Serial-batching scheduling with time-dependent setup time and effects of deterioration and learning on a single-machine (Q506457) (← links)
• Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
• Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects (Q534925) (← links)
• Due-window assignment and scheduling with multiple rate-modifying activities under the effects of deterioration and learning (Q541440) (← 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 simultaneous with position-based and sum-of-processing-times-based learning considerations under group technology assumption (Q552458) (← 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 with a general sum-of-actual-processing-times-based and job-position-based learning effect (Q611619) (← links)
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times (Q622157) (← 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)
• 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)
• Single-machine scheduling problems with time and position dependent processing times (Q646660) (← 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)
• The single processor total weighted completion time scheduling problem with the sum-of-processing-time based learning model (Q712692) (← 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)
• Preemptive repayment policy for multiple loans (Q763209) (← links)
• Parallel-machine serial-batching scheduling with release times under the effects of position-dependent learning and time-dependent deterioration (Q829191) (← links)
• A mapping-based universal kriging model for order-of-addition experiments in drug combination studies (Q830482) (← links)
• A bicriteria parallel machine scheduling with a learning effect of setup and removal times (Q840149) (← 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)
• Patients scheduling problems with deferred deteriorated functions (Q887895) (← links)
• The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)