Bicriterion optimization for flow shop with a learning effect subject to release dates
From MaRDI portal
Publication:1722948
DOI10.1155/2018/9149510zbMath1407.90178OpenAlexW2897747641MaRDI QIDQ1722948
Jian Xu, Ji-Bo Wang, Jing Yang
Publication date: 19 February 2019
Published in: Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2018/9149510
Multi-objective and goal programming (90C29) Learning and adaptive systems in artificial intelligence (68T05) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (5)
Due-window assignment scheduling with past-sequence-dependent setup times ⋮ Research on common due window assignment flowshop scheduling with learning effect and resource allocation ⋮ Tri-criteria single machine scheduling model with release times and learning factor ⋮ Optimization for due-window assignment scheduling with position-dependent weights ⋮ Improved algorithms for proportionate flow shop scheduling with due-window assignment
Cites Work
- 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
- NEH-based heuristics for the permutation flowshop scheduling problem to minimise total tardiness
- 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
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- Minimising total tardiness in the \(m\)-machine flowshop problem: A review and evaluation of heuristics and metaheuristics
- A note on the total completion time problem in a permutation flowshop with a learning effect
- A note on minimizing maximum lateness in an \(m\)-machine scheduling problem with a learning effect
- Single-machine scheduling with learning considerations
- Efficient heuristics to minimize total flow time with release dates
- Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications
- A novel approach for reducing attributes and its application to small enterprise financing ability evaluation
- Application of multiple-population genetic algorithm in optimizing the train-set circulation plan problem
- A comprehensive review and evaluation of permutation flowshop heuristics
- A bi-criterion single-machine scheduling problem with learning considerations
- Research on no-idle permutation flowshop scheduling with time-dependent learning effect and deteriorating jobs
- 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
- Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates
- Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- A review and classification of heuristics for permutation flow-shop scheduling with makespan objective
- Research on m‐machine flow shop scheduling with truncated learning effects
This page was built for publication: Bicriterion optimization for flow shop with a learning effect subject to release dates