Research on m‐machine flow shop scheduling with truncated learning effects
From MaRDI portal
Publication:6088136
Cites work
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- A fast tabu search algorithm for the permutation flow-shop problem
- A note on the total completion time problem in a permutation flowshop with a learning effect
- A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
- A state-of-the-art review on scheduling with learning effects
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Flowshop scheduling with a general exponential learning effect
- scientific article; zbMATH DE number 5345854 (Why is no real title available?)
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects
- Several flow shop scheduling problems with truncated position-based learning effect
- Some efficient heuristic methods for the flow shop sequencing problem
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- The flow shop with parallel machines: A tabu search approach
- Using iterated local search for solving the flow-shop problem: parallelization, parametrization, and randomization issues
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
Cited in
(36)- Bicriterion optimization for flow shop with a learning effect subject to release dates
- Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects
- Research on single-machine scheduling with position-dependent weights and past-sequence-dependent delivery times
- Improved algorithms for proportionate flow shop scheduling with due-window assignment
- Due-window assignment scheduling with learning and deterioration effects
- Scheduling jobs with general truncated learning effects including proportional setup times
- Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights
- Tri-criteria single machine scheduling model with release times and learning factor
- Resource allocation flowshop scheduling with learning effect and slack due window assignment
- Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects
- Resource dependent scheduling with truncated learning effects
- Research on position-dependent weights scheduling with delivery times and truncated sum-of-processing-times-based learning effect
- Study on resource allocation scheduling problem with learning factors and group technology
- An optimal online algorithm for scheduling with learning consideration
- Study on resource-dependent no-wait flow shop scheduling with different due-window assignment and learning effects
- Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation
- Research on common due window assignment flowshop scheduling with learning effect and resource allocation
- A branch-and-bound algorithm and four metaheuristics for minimizing total completion time for a two-stage assembly flow-shop scheduling problem with learning consideration
- Scheduling with a position-weighted learning effect and job release dates
- Flow shop resource allocation scheduling with due date assignment, learning effect and position-dependent weights
- A bicriteria approach for single machine scheduling with resource allocation, learning effect and a deteriorating maintenance activity
- Single-machine scheduling problems with variable processing times and past-sequence-dependent delivery times
- Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates
- Bicriterion scheduling with truncated learning effects and convex controllable processing times
- Research on delivery times scheduling with truncated learning effects
- Group scheduling problems with time-dependent and position-dependent DeJong's learning effect
- Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
- A unified approach to single-machine scheduling with position-based processing times, machine availability, and job rejection
- Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times
- Study on due-date assignment scheduling with setup times and general truncated learning effects
- Single machine scheduling with step-learning
- Single-machine common due-window assignment and scheduling with position-dependent weights, delivery time, learning effect and resource allocations
- Permutation flow shop scheduling with makespan objective and truncated learning effects
- Research on two-machine flow shop scheduling problem with release dates and truncated learning effects
- Controllable processing time scheduling with total weighted completion time objective and deteriorating jobs
- Common due window assignment and single machine scheduling with delivery time, resource allocation, and job-dependent learning effect
This page was built for publication: Research on m‐machine flow shop scheduling with truncated learning effects
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6088136)
