Pages that link to "Item:Q1124688"
From MaRDI portal
The following pages link to Single-machine scheduling with learning considerations (Q1124688):
Displayed 50 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Parallel-machine scheduling with maintenance: praising the assignment problem (Q322837) (← links)
- Several flow shop scheduling problems with truncated position-based learning effect (Q336658) (← links)
- Flowshop scheduling with a general exponential learning effect (Q336933) (← 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)
- Scheduling a deteriorating maintenance activity and due-window assignment (Q337476) (← links)
- 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)
- 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)
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
- Scheduling jobs with truncated exponential learning functions (Q395856) (← links)
- Maximizing the weighted number of just-in-time jobs on a single machine with position-dependent processing times (Q398882) (← 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)
- Scheduling on parallel identical machines with job-rejection and position-dependent processing times (Q456108) (← 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)
- Two-agent single-machine scheduling of jobs with time-dependent processing times and ready times (Q474643) (← links)
- Scheduling with learning effects and/or time-dependent processing times to minimize the weighted number of tardy jobs on a single machine (Q474786) (← links)
- Single-machine scheduling with two competing agents and learning consideration (Q497627) (← 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)
- Resource constrained scheduling with general truncated job-dependent learning effect (Q511713) (← 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)
- Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects (Q534943) (← 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)
- 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)
- 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)
- 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)
- A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs (Q632684) (← links)
- Scheduling problems with general effects of deterioration and learning (Q632713) (← links)
- Some single-machine scheduling with both learning and deterioration effects (Q639137) (← 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)