Pages that link to "Item:Q1351619"
From MaRDI portal
The following pages link to A note on scheduling on a single processor with speed dependent on a number of executed jobs (Q1351619):
Displayed 43 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)
- Single-machine scheduling with deteriorating jobs and aging effects under an optional maintenance activity consideration (Q385474) (← links)
- The strong NP-hardness of the maximum lateness minimization scheduling problem with the processing-time based aging effect (Q422898) (← links)
- Scheduling with general position-based learning curves (Q424784) (← links)
- Minimizing the maximum lateness in a single-machine scheduling problem with the normal time-dependent and job-dependent learning effect (Q440896) (← 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)
- Scheduling linearly shortening jobs under precedence constraints (Q552447) (← links)
- Scheduling problems with general effects of deterioration and learning (Q632713) (← links)
- A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time (Q660846) (← links)
- Scheduling on a single processor with variable speed (Q673343) (← links)
- The computational complexity analysis of the two-processor flowshop problems with position dependent job processing times (Q905364) (← links)
- A note on the optimal sequence position for a rate-modifying activity under simple linear deterioration (Q1037697) (← links)
- Conjugate problems in time-dependent scheduling (Q1041348) (← links)
- A concise survey of scheduling with time-dependent processing times (Q1410319) (← links)
- Scheduling identical jobs on uniform parallel machines under position-based learning effects (Q1637750) (← links)
- Scheduling on parallel processors with varying processing times (Q1652222) (← links)
- Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date (Q1659271) (← links)
- Parallel machine scheduling with general sum of processing time based models (Q1675579) (← links)
- Coke production scheduling problem: a parallel machine scheduling with batch preprocessings and location-dependent processing times (Q1725594) (← links)
- Scheduling problems with position dependent job processing times: computational complexity results (Q1761835) (← links)
- Re-entrant flowshop scheduling with learning considerations to minimize the makespan (Q1787748) (← links)
- Single-machine scheduling and slack due-date assignment with aging effect and deteriorating maintenance (Q1926630) (← links)
- Simple matching vs linear assignment in scheduling models with positional effects: a critical review (Q1926950) (← links)
- Multitasking scheduling problems with deterioration effect (Q1992785) (← links)
- Single-machine scheduling with learning effects and maintenance: a methodological note on some polynomial-time solvable cases (Q1993121) (← links)
- Minmax scheduling and due-window assignment with position-dependent processing times and job rejection (Q2026708) (← links)
- Stochastic single machine scheduling problem as a multi-stage dynamic random decision process (Q2051165) (← links)
- A unified analysis for scheduling problems with variable processing times (Q2076372) (← links)
- Parallel-machine scheduling of jobs with mixed job-, machine- and position-dependent processing times (Q2168720) (← links)
- Flowshop scheduling with learning effect and job rejection (Q2215196) (← links)
- A unified view of parallel machine scheduling with interdependent processing rates (Q2286430) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- An uncertain parallel machine problem with deterioration and learning effect (Q2322326) (← links)
- Single-machine time-dependent scheduling problems with fixed rate-modifying activities and resumable jobs (Q2399611) (← links)
- Learning and forgetting effects on a group scheduling problem (Q2467250) (← links)
- Single-Machine Scheduling Problems Simultaneous with Deteriorating and Learning Effects Under a Deteriorating Maintenance Consideration (Q2958667) (← links)
- SINGLE MACHINE SCHEDULING WITH A LEARNING EFFECT AND A RATE-MODIFYING ACTIVITY (Q3174015) (← links)
- Preemptive Scheduling of Jobs with a Learning Effect on Two Parallel Machines (Q4685818) (← links)
- A fully polynomial-time approximation scheme for total completion time minimization on a single machine with DeJong's learning effect and an availability constraint (Q5059405) (← links)
- COMMON DUE-WINDOW ASSIGNMENT AND SCHEDULING OF JOB-DEPENDENT DETERIORATING JOBS AND MULTIPLE DETERIORATING MAINTENANCE ACTIVITIES (Q5411729) (← links)
- Research on delivery times scheduling with truncated learning effects (Q6172888) (← links)