Scheduling jobs with general truncated learning effects including proportional setup times

DOI10.1007/s40314-022-01851-0zbMath1499.90087OpenAlexW4224268770MaRDI QIDQ2140779

Shuang Zhao

Publication date: 23 May 2022

Published in: Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40314-022-01851-0

zbMATH Keywords

schedulingsimulated annealingbranch-and-boundlearning effectpast-sequence-dependent setup times

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26) Deterministic scheduling theory in operations research (90B35)

Related Items (4)

Heuristic and exact algorithms for single-machine scheduling problems with general truncated learning effects ⋮ Due-window assignment scheduling with job-rejection, truncated learning effects and setup times ⋮ Solution algorithms for single-machine scheduling with learning effects and exponential past-sequence-dependent delivery times ⋮ Research on delivery times scheduling with truncated learning effects

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Flowshop scheduling with a general exponential learning effect
• Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
• Scheduling jobs with truncated exponential learning functions
• Single-machine scheduling with two competing agents and learning consideration
• A single-machine scheduling with a truncated linear deterioration and ready times
• Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
• Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects
• Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
• Single machine scheduling with exponential sum-of-logarithm-processing-times based learning effect
• A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time
• Single machine scheduling with past-sequence-dependent setup times and learning effects
• Single-machine scheduling against due dates with past-sequence-dependent setup times
• Single-machine scheduling with learning considerations
• Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
• Bicriterion scheduling with group technology and deterioration effect
• Single machine scheduling with exponential time-dependent learning effect and past-sequence-dependent setup times
• Scheduling with a position-weighted learning effect
• Single-machine scheduling problems with past-sequence-dependent setup times
• The single-machine total tardiness problem with unequal release times and a linear deterioration
• Single-Machine Scheduling with Learning Effect, Deteriorating Jobs and Convex Resource Dependent Processing Times
• Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis
• Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
• A Note on Scheduling Jobs with Extended Sum-of-Processing-Times-Based and Position-Based Learning Effect
• Single‐machine common flow allowance scheduling with aging effect, resource allocation, and a rate‐modifying activity
• Bicriterion scheduling with truncated learning effects and convex controllable processing times
• Research on m‐machine flow shop scheduling with truncated learning effects

This page was built for publication: Scheduling jobs with general truncated learning effects including proportional setup times