Pages that link to "Item:Q336933"
From MaRDI portal
The following pages link to Flowshop scheduling with a general exponential learning effect (Q336933):
Displaying 25 items.
- An alternative approach for proving the NP-hardness of optimization problems (Q320621) (← links)
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects (Q337503) (← links)
- An order scheduling problem with position-based learning effect (Q342484) (← links)
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect (Q425519) (← links)
- Flowshop scheduling problems with a position-dependent exponential learning effect (Q474618) (← links)
- Scheduling with job-rejection and position-dependent processing times on proportionate flowshops (Q523188) (← links)
- Worst-case behavior of simple sequencing rules in flow shop scheduling with general position-dependent learning effects (Q763108) (← links)
- A bicriteria flowshop scheduling with a learning effect (Q949943) (← links)
- Maximum lateness scheduling on two-person cooperative games with variable processing times and common due date (Q1659271) (← links)
- Single-machine group scheduling problems with variable job processing times (Q1666514) (← links)
- Single-machine serial-batching scheduling with a machine availability constraint, position-dependent processing time, and time-dependent set-up time (Q1679623) (← links)
- Group scheduling with general autonomous and induced learning effect (Q1720558) (← links)
- Bicriterion optimization for flow shop with a learning effect subject to release dates (Q1722948) (← links)
- Scheduling jobs with general truncated learning effects including proportional setup times (Q2140779) (← links)
- An iterated greedy heuristic for no-wait flow shops with sequence dependent setup times, learning and forgetting effects (Q2195404) (← links)
- Research on permutation flow shop scheduling problems with general position-dependent learning effects (Q2449372) (← links)
- Some results of the worst-case analysis for flow shop scheduling with a learning effect (Q2449373) (← links)
- Flow-shop scheduling with a learning effect (Q3370366) (← links)
- Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times (Q3455877) (← links)
- Permutation flowshop scheduling with simple linear deterioration (Q5059195) (← links)
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect (Q5255177) (← links)
- Research on <i>m</i>‐machine flow shop scheduling with truncated learning effects (Q6088136) (← links)
- Flow shop scheduling problem with non-linear learning effects: a linear approximation scheme for non-technical users (Q6098953) (← links)
- Research on delivery times scheduling with truncated learning effects (Q6172888) (← links)
- Group scheduling problems with time-dependent and position-dependent DeJong's learning effect (Q6534818) (← links)
