A two-machine flowshop scheduling problem with a truncated sum of processing-times-based learning function
From MaRDI portal
Publication:693656
DOI10.1016/j.apm.2011.12.038zbMath1252.90028OpenAlexW2077798145MaRDI QIDQ693656
Wen-Hung Wu, Peng-Hsiang Hsu, Kunjung Lai, Chin-Chia Wu
Publication date: 7 December 2012
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2011.12.038
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Group-shop scheduling with sequence-dependent set-up and transportation times ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ An order scheduling problem with position-based learning effect ⋮ A branch and bound algorithm for hybrid flow shop scheduling problem with setup time and assembly operations ⋮ Serial-batching group scheduling with release times and the combined effects of deterioration and truncated job-dependent learning
Cites Work
- Unnamed Item
- Unnamed Item
- Notes on ``Some single-machine scheduling problems with general position-dependent and time-dependent learning effects
- Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- A branch and bound algorithm to minimize the total tardiness for \(m\)-machine permutation flowshop problems
- Single-machine and two-machine flowshop scheduling with general learning functions
- A note on the total completion time problem in a permutation flowshop with a learning effect
- A bicriteria flowshop scheduling with a learning effect
- Single machine scheduling problems under the effects of nonlinear deterioration and time-dependent learning
- Minimizing the total weighted completion time on a single machine scheduling with release dates and a learning effect
- Some scheduling problems with sum-of-processing-times-based and job-position-based learning effects
- Single-machine scheduling with learning considerations
- The two-machine total completion time flow shop problem
- Improved genetic algorithm for the permutation flowshop scheduling problem.
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem
- An ant colony optimization algorithm to solve a 2-machine bicriteria flowshop scheduling problem
- Two-machine flowshop scheduling to minimize mean flow time
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A state-of-the-art review on scheduling with learning effects
- 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
- Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
- Flow-shop scheduling with a learning effect
- Exact, Approximate, and Guaranteed Accuracy Algorithms for the Flow-Shop Problem n / 2 / F / F¯
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Genetic Algorithms and Random Keys for Sequencing and Optimization
- A genetic algorithm for flow shop scheduling problems
- Scheduling jobs with position-dependent processing times
- An asymptotic two-phase algorithm to minimize total flow time for a two-machine flowshop
- Single machine scheduling with learning effect considerations
