A tabu search approach for the weighted tardiness with sequence-dependent setups in one-machine problem

DOI10.15517/RMTA.V9I1.208MaRDI QIDQ6597111zbMATH OpenFDO

Authors Ricardo P. Beausoleil

Publication date 3 September 2024

Published in Revista de Matemática: Teoría y Aplicaciones (Search for Journal in Brave)

zbMATH Keywords

tabu searchweighted tardinessscheduling problemssequence dependsetups

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A tabu search approach for the weighted tardiness with sequence-dependent setups in one-machine problem
• A tabu search algorithm for the single machine total weighted tardiness problem
• A tabu search approach for the single machine mean tardiness problem
• A tabu search algorithm for parallel machine total tardiness problem
• Tabu search for single machine scheduling with distinct due windows and weighted earliness/tardiness penalties

Cites work

• scientific article; zbMATH DE number 1488569 (Why is no real title available?)
• A Dynamic Programming Approach to Sequencing Problems
• A user's guide to tabu search
• Future paths for integer programming and links to artificial intelligence
• On the N-Job One-Machine, Sequence-Independent Scheduling Problem with Tardiness Penalties: A Branch-Bound Solution
• One-Machine Sequencing to Minimize Certain Functions of Job Tardiness
• Scheduling in a sequence dependent setup environment with genetic search
• Scheduling with deadlines and loss functions

This page was built for publication: A tabu search approach for the weighted tardiness with sequence-dependent setups in one-machine problem

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