The single-machine total weighted tardiness scheduling problem with position-based learning effects
From MaRDI portal
Publication:1762088
DOI10.1016/J.COR.2011.07.022zbMath1251.90206OpenAlexW2051062041MaRDI QIDQ1762088
Shuenn-Ren Cheng, Wen-Hsiang Wu, Chin-Chia Wu, Yunqiang Yin
Publication date: 15 November 2012
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2011.07.022
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (13)
RETRACTED ARTICLE: Approach towards problem solving on single machine scheduling with unequal release dates and learning effect ⋮ Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates ⋮ Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times ⋮ 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 ⋮ Two-stage three-machine assembly scheduling problem with sum-of-processing-times-based learning effect ⋮ Makespan minimization flowshop with position dependent job processing times -- computational complexity and solution algorithms ⋮ Exact and parallel metaheuristic algorithms for the single processor total weighted completion time scheduling problem with the sum-of-processing-time based models ⋮ An order scheduling problem with position-based learning effect ⋮ Scheduling Deteriorating Jobs with Availability Constraints to Minimize the Makespan ⋮ Scheduling with job-rejection and position-dependent processing times on proportionate flowshops ⋮ Study on flow shop scheduling with sum-of-logarithm-processing-times-based learning effects ⋮ Single machine and flowshop scheduling problems with sum-of-processing time based learning phenomenon
Cites Work
- Unnamed Item
- Single-machine scheduling with a general sum-of-actual-processing-times-based and job-position-based learning effect
- Single-machine scheduling with sum-of-logarithm-processing-times-based learning considerations
- 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
- Single-machine scheduling problems with a learning effect
- Single-machine scheduling with learning considerations
- Scheduling with general job-dependent learning curves.
- A bi-criterion single-machine scheduling problem with learning considerations
- Some scheduling problems with general position-dependent and time-dependent learning effects
- A state-of-the-art review on scheduling with learning effects
- 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
- Complexity results for single-machine scheduling with positional learning effects
- Single machine scheduling with learning effect considerations
- Scheduling problems with a learning effect
- A new dominance rule to minimize total weighted tardiness with unequal release dates.
This page was built for publication: The single-machine total weighted tardiness scheduling problem with position-based learning effects