Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
From MaRDI portal
Publication:337503
DOI10.1016/j.cor.2014.12.006zbMath1348.90322OpenAlexW2034076959MaRDI QIDQ337503
Bing-Hang Zhang, Jian-Jun Wang
Publication date: 10 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.12.006
Abstract computational complexity for mathematical programming problems (90C60) Deterministic scheduling theory in operations research (90B35)
Related Items (11)
Due-date assignment scheduling involving job-dependent learning effects and convex resource allocation ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ An order scheduling problem with position-based learning effect ⋮ Tri-criteria single machine scheduling model with release times and learning factor ⋮ A bi-objective branch-and-bound algorithm for the unit-time job shop scheduling: a mixed graph coloring approach ⋮ Enhanced lower bounds and exact procedures for total completion time minimization in a two‐machine permutation flowshop with release dates ⋮ Research on m‐machine flow shop scheduling with truncated learning effects ⋮ A Bicriteria Approach for Single Machine Scheduling with Resource Allocation, Learning Effect and a Deteriorating Maintenance Activity ⋮ 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
Cites Work
- Unnamed Item
- Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms
- Several flow shop scheduling problems with truncated position-based learning effect
- Flowshop scheduling with a general exponential learning effect
- 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
- Single-machine scheduling with two competing agents and learning consideration
- A branch-and-bound algorithm for a single machine sequencing to minimize the total tardiness with arbitrary release dates and position-dependent learning effects
- Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
- A note on the total completion time problem in a permutation flowshop with a learning effect
- Some scheduling problems with general position-dependent and time-dependent learning effects
- Scheduling with a position-weighted learning effect
- 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
- Scheduling with a position-weighted learning effect based on sum-of-logarithm-processing-times and job position
- Parallel-machine scheduling to minimize makespan with fuzzy processing times and learning effects
- Single-Machine Due-Window Assignment and Scheduling with Learning Effect and Resource-Dependent Processing Times
- Flowshop and Jobshop Schedules: Complexity and Approximation
- New heuristics for flow shop problem to minimize makespan
- A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
This page was built for publication: Permutation flowshop problems with bi-criterion makespan and total completion time objective and position-weighted learning effects
