Research on m‐machine flow shop scheduling with truncated learning effects
From MaRDI portal
Publication:6088136
DOI10.1111/itor.12323OpenAlexW2466042049MaRDI QIDQ6088136
No author found.
Publication date: 16 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12323
Related Items
Scheduling jobs with general truncated learning effects including proportional setup times ⋮ 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 ⋮ Tri-criteria single machine scheduling model with release times and learning factor ⋮ Resource allocation flowshop scheduling with learning effect and slack due window assignment ⋮ 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 ⋮ Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity ⋮ Resource dependent scheduling with truncated learning effects ⋮ Research on delivery times 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 ⋮ Due-window assignment and resource allocation scheduling with truncated learning effect and position-dependent weights ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ Flow Shop Resource Allocation Scheduling with Due Date Assignment, Learning Effect and Position-Dependent Weights ⋮ 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 ⋮ Single-Machine Scheduling Problems with Variable Processing Times and Past-Sequence-Dependent Delivery Times ⋮ 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
Cites Work
- Unnamed Item
- Unnamed Item
- Several flow shop scheduling problems with truncated position-based learning effect
- Flowshop scheduling with a general exponential learning effect
- Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
- A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime
- Worst-case and numerical analysis of heuristic algorithms for flowshop scheduling problems with a time-dependent learning effect
- Some efficient heuristic methods for the flow shop sequencing problem
- A note on the total completion time problem in a permutation flowshop with a learning effect
- A fast tabu search algorithm for the permutation flow-shop problem
- The flow shop with parallel machines: A tabu search approach
- Research on permutation flow shop scheduling problems with general position-dependent learning effects
- Some results of the worst-case analysis for flow shop scheduling with a learning effect
- A state-of-the-art review on scheduling with learning effects
- A simulated annealing with multiple-search paths and parallel computation for a comprehensive flowshop scheduling problem
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Lexicographic optimization of a permutation flow shop scheduling problem with time lag constraints
- Using iterated local search for solving the flow‐shop problem: Parallelization, parametrization, and randomization issues
