Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect

DOI10.1007/s11047-016-9539-4zbMath1530.90043OpenAlexW2252296371MaRDI QIDQ6191395

Rui Xu, Chunhui Zheng, Huaping Chen

Publication date: 9 February 2024

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-016-9539-4

zbMATH Keywords

schedulingtabu searchrelease timelearning effect

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• A tabu method for a two-agent single-machine scheduling with deterioration jobs
• Bi-criteria single machine scheduling with a time-dependent learning effect and release times
• Genetic algorithm for minimizing the total weighted completion time scheduling problem with learning and release times
• A branch and bound algorithm for minimizing makespan on a single machine with unequal release times under learning effect and deteriorating jobs
• A branch-and-bound algorithm for solving a two-machine flow shop problem with deteriorating jobs
• Single-machine scheduling with learning considerations
• The two-machine total completion time flow shop problem
• A tabu search approach for the flow shop scheduling problem
• Future paths for integer programming and links to artificial intelligence
• Scheduling with general job-dependent learning curves.
• A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion
• A tabu search method guided by shifting bottleneck for the job shop scheduling problem
• Minimizing the total completion time in a single-machine scheduling problem with a time-dependent learning effect
• Single-machine scheduling with an actual time-dependent learning effect

This page was built for publication: Tabu search algorithms for minimizing total completion time on a single machine with an actual time-dependent learning effect