A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
From MaRDI portal
Publication:693656
Recommendations
- Flow shop scheduling problem with truncated learning effects
- Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon
- Single-machine and two-machine flowshop scheduling with general learning functions
- A bicriteria flowshop scheduling with a learning effect
- Several flow shop scheduling problems with truncated position-based learning effect
Cites work
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- A bicriteria flowshop scheduling with a learning effect
- A branch and bound algorithm to minimize the total tardiness for m-machine permutation flowshop problems
- A genetic algorithm for flow shop scheduling problems
- A genetic local search algorithm for minimizing total weighted tardiness in the job-shop scheduling problem
- A new approach to the learning effect: Beyond the learning curve restrictions
- A note on the total completion time problem in a permutation flowshop with a learning effect
- A state-of-the-art review on scheduling with learning effects
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- Flow-shop scheduling with a learning effect
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Scheduling jobs with position-dependent processing times
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- Single machine scheduling with learning effect considerations
- Single-machine and two-machine flowshop scheduling with general learning functions
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Single-machine scheduling with learning considerations
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- The two-machine total completion time flow shop problem
- Two-machine flowshop scheduling to minimize mean flow time
Cited in
(10)- A two-stage three-machine flow shop assembly problem mixed with a controllable number and sum-of-processing times-based learning effect by simulated annealing algorithms
- Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
- Flow shop scheduling problem with truncated learning effects
- Metaheuristics for two-stage flow-shop assembly problem with a truncation learning function
- Genetic algorithm for a two-agent scheduling problem with truncated learning consideration
- Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect
- Several flow shop scheduling problems with truncated position-based learning effect
- An order scheduling problem with position-based learning effect
- Group-shop scheduling with sequence-dependent set-up and transportation times
- A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations
This page was built for publication: A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q693656)
