A note on the total completion time problem in a permutation flowshop with a learning effect
From MaRDI portal
Publication:948678
DOI10.1016/J.EJOR.2007.10.003zbMath1180.90144OpenAlexW2024015223MaRDI QIDQ948678
Publication date: 17 October 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.10.003
Related Items (21)
Some single-machine and \(m\)-machine flowshop scheduling problems with learning considerations ⋮ 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 ⋮ Single-machine scheduling problems with a sum-of-processing-time-based learning function ⋮ Parallel machine scheduling with general sum of processing time based models ⋮ Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect ⋮ Research on m‐machine flow shop scheduling with truncated learning effects ⋮ Single machine scheduling with a general exponential learning effect ⋮ Scheduling with general position-based learning curves ⋮ A note on machine scheduling with sum-of-logarithm-processing-time-based and position-based learning effects ⋮ Bicriterion optimization for flow shop with a learning effect subject to release dates ⋮ Research on permutation flow shop scheduling problems with general position-dependent learning effects ⋮ Single-machine scheduling with two competing agents and learning consideration ⋮ A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function ⋮ Simplified swarm optimization in disassembly sequencing problems with learning effects ⋮ The single-machine total weighted tardiness scheduling problem with position-based learning effects ⋮ Genetic Algorithm for a Two-Agent Scheduling Problem with Truncated Learning Consideration ⋮ Single-machine scheduling with both deterioration and learning effects ⋮ Machine scheduling problems with a general learning effect ⋮ Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
Cites Work
- Unnamed Item
- Single-machine scheduling with learning considerations
- An efficient heuristic for scheduling in a flowshop to minimize total weighted flowtime of jobs
- A heuristic algorithm for mean flowtime objective in flowshop scheduling
- Scheduling with general job-dependent learning curves.
- Comparison of heuristics for flowtime minimisation in permutation flowshops
- Flow-shop scheduling with a learning effect
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Scheduling problems with a learning effect
- Constructive and composite heuristic solutions to the \(P\|\sum C_i\) scheduling problem
This page was built for publication: A note on the total completion time problem in a permutation flowshop with a learning effect
