Scheduling jobs with general truncated learning effects including proportional setup times

DOI10.1007/S40314-022-01851-0MaRDI QIDQ2140779zbMATH OpenOpenAlexFDO

Authors 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

branch-and-boundlearning effectpast-sequence-dependent setup timesschedulingsimulated annealing

Mathematics Subject Classification ID

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

Cites work

• A note on scheduling jobs with extended sum-of-processing-times-based and position-based learning effect
• A note on single-machine scheduling with general learning effect and past-sequence-dependent setup time
• A single-machine scheduling with a truncated linear deterioration and ready times
• Bicriterion scheduling with group technology and deterioration effect
• Bicriterion scheduling with truncated learning effects and convex controllable processing times
• Flowshop scheduling with a general exponential learning effect
• Group scheduling with deteriorating jobs and allotted resource under limited resource availability constraint
• Optimization by simulated annealing
• Research on m‐machine flow shop scheduling with truncated learning effects
• Scheduling jobs with truncated exponential learning functions
• Scheduling jobs with truncated exponential sum-of-logarithm-processing-times based and position-based learning effects
• Scheduling problems with past-sequence-dependent setup times and general effects of deterioration and learning
• Scheduling with a position-weighted learning effect
• Single machine past-sequence-dependent setup times scheduling 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 exponential time-dependent learning effect and past-sequence-dependent setup times
• Single machine scheduling with general time-dependent deterioration, position-dependent learning and past-sequence-dependent setup times
• Single machine scheduling with past-sequence-dependent setup times and learning effects
• Single-machine common flow allowance scheduling with aging effect, resource allocation, and a rate-modifying activity
• Single-machine scheduling against due dates with past-sequence-dependent setup times
• Single-machine scheduling problems with past-sequence-dependent setup times
• Single-machine scheduling with a sum-of-actual-processing-time-based learning effect
• Single-machine scheduling with deteriorating jobs and past-sequence-dependent setup times
• Single-machine scheduling with learning considerations
• Single-machine scheduling with learning effect, deteriorating jobs and convex resource dependent processing times
• Single-machine scheduling with past-sequence-dependent setup times and learning effects: a parametric analysis
• Single-machine scheduling with two competing agents and learning consideration
• The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution
• The single-machine total tardiness problem with unequal release times and a linear deterioration
• Unrelated parallel machine scheduling with past-sequence-dependent setup time and learning effects

Cited in

(19)

• Scheduling with job-splitting considering learning and the vital-few law
• 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
• Scheduling jobs with general linear deterioration to minimize total weighted number of late jobs
• Single machine scheduling problems with truncated learning effects and exponential past-sequence-dependent delivery times
• A two-agent resource allocation scheduling problem with slack due-date assignment and general deterioration function
• Study on due-date assignment scheduling with setup times and general truncated learning effects
• Permutation flow shop scheduling with makespan objective and truncated learning effects
• Single-machine group scheduling with general linear deterioration and truncated learning effects
• Research on delivery times scheduling with sum of logarithm processing times-based learning effect
• Research on two-machine flow shop scheduling problem with release dates and truncated learning effects
• Earliness-tardiness scheduling with delivery times and deteriorating jobs
• No-idle flow shop scheduling with deteriorating jobs and common due date under dominating machines
• Research on multiple slack due-date assignments scheduling with position-dependent weights
• Lower bounds for minimizing two types of unnecessary costs in the film and television industry
• Delivery scheduling with variable processing times and due date assignments
• Improved algorithms for the two-machine flow shop scheduling problem with uncertain setup times to minimize total tardiness

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140779)