Minimizing the total completion time on a single machine with the learning effect and multiple availability constraints

DOI10.1016/j.apm.2012.07.028zbMath1351.90102OpenAlexW2067934230MaRDI QIDQ727323

Reza Tavakkoli-Moghaddam, Behdin Vahedi-Nouri, Mohammad. Rohaninejad, Pariviz Fattahi

Publication date: 6 December 2016

Published in: Applied Mathematical Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.apm.2012.07.028

zbMATH Keywords

simulated annealinggenetic algorithmsingle machine schedulinglearning effectavailability constraint

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Minimization of the total weighted tardiness on a single machine scheduling problem with a position based learning effect and unequal release dates, Single-machine rescheduling problems with learning effect under disruptions, Some single-machine scheduling problems with elapsed-time-based and position-based learning and forgetting effects, Single-machine scheduling problems with a learning effect matrix, Minimizing total earliness and tardiness for common due date single-machine scheduling with an unavailability interval, A note on single-machine scheduling with sum-of-processing-time-based learning and forgetting effects

Cites Work

• Single machine past-sequence-dependent setup times scheduling with general position-dependent and time-dependent learning effects
• A single machine scheduling problem with availability constraints and sequence-dependent setup costs
• Some single-machine scheduling with both learning and deterioration effects
• Single-machine due-window assignment problem with learning effect and deteriorating jobs
• Single machine flow-time scheduling with scheduled maintenance
• Single-machine and two-machine flowshop scheduling with general learning functions
• A note on worst-case performance of heuristics for maintenance scheduling problems
• Single-machine scheduling problems with a learning effect
• Single machine flow-time scheduling with a single breakdown
• Single-machine scheduling with learning considerations
• Scheduling with general job-dependent learning curves.
• An improved approximation algorithm for the single machine total completion time scheduling problem with availability constraints
• Scheduling with limited machine availability
• A single-machine scheduling problem with maintenance activities to minimize makespan
• Improved approximation for non-preemptive single machine flow-time scheduling with an availability constraint
• Single-machine scheduling with an availability constraint to minimize the weighted sum of the completion times
• Minimizing total tardiness in a scheduling problem with a learning effect
• Worst-case analysis of the WSPT and MWSPT rules for single machine scheduling with one planned setup period
• A state-of-the-art review on scheduling with learning effects
• Single-machine group scheduling with a time-dependent learning effect
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Scheduling linear deteriorating jobs with an availability constraint on a single machine
• Machine scheduling with an availability constraint
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey