Pages that link to "Item:Q4661100"

The following pages link to Scheduling jobs with position-dependent processing times (Q4661100):

Displaying 50 items.

• Parallel-machine scheduling with maintenance: praising the assignment problem (Q322837) (← links)
• Single-machine scheduling with precedence constraints and position-dependent processing times (Q350351) (← 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)
• Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← 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)
• Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← 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)
• 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)
• Two-agent scheduling with position-based deteriorating jobs and learning effects (Q546060) (← links)
• Scheduling linearly shortening jobs under precedence constraints (Q552447) (← 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)
• Minimizing the total completion time in single-machine scheduling with aging/deteriorating effects and deteriorating maintenance activities (Q623150) (← links)
• Single machine multiple common due dates scheduling with learning effects (Q630690) (← links)
• Some single-machine scheduling problems with general effects of learning and deterioration (Q630729) (← links)
• Group scheduling problems with simultaneous considerations of learning and deterioration effects on a single-machine (Q639173) (← 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 optimization in deteriorating systems using scheduling problems with the aging effect and resource allocation models (Q660815) (← links)
• Scheduling jobs with varying processing times (Q673617) (← links)
• Scheduling linear deteriorating jobs to minimize the number of tardy jobs (Q693149) (← links)
• A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function (Q693656) (← links)
• Single machine scheduling with sum-of-logarithm-processing-times based deterioration (Q726391) (← 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)
• Fixed-time schedules for the processing of jobs when service completions are not observable (Q814885) (← links)
• Two-agent scheduling on bounded parallel-batching machines with an aging effect of job-position-dependent (Q827243) (← links)
• Single machine scheduling with past-sequence-dependent setup times and learning effects (Q845955) (← links)
• Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
• A note on flow shop scheduling problems with a learning effect on no-idle dominant machines (Q879575) (← links)
• Flow shop scheduling with effects of learning and deterioration (Q949265) (← links)
• Learning effect and deteriorating jobs in the single machine scheduling problems (Q965543) (← links)
• Single machine scheduling with general job-dependent aging effect and maintenance activities to minimize makespan (Q967873) (← 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)
• Machine scheduling problems with a general learning effect (Q984120) (← 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)
• Conjugate problems in time-dependent scheduling (Q1041348) (← links)
• Scheduling jobs under decreasing linear deterioration (Q1041725) (← links)
• Sequencing of jobs in some production system (Q1582040) (← links)