Heuristic procedures for the parallel machine problem with tool switches

DOI10.1080/00207540110076115zbMath1175.90163OpenAlexW2069943649MaRDI QIDQ4443368

Yahya Fathi, K. W. Barnette

Publication date: 11 January 2004

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540110076115

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (12)

Improved heuristic algorithms for the job sequencing and tool switching problem ⋮ Hybrid method with CS and BRKGA applied to the minimization of tool switches problem ⋮ Biased random-key genetic algorithm for scheduling identical parallel machines with tooling constraints ⋮ The tool transporter movements problem in flexible manufacturing systems ⋮ Minimizing the makespan on two identical parallel machines with mold constraints ⋮ A methodology for cutting-tool management through the integration of CAPP and scheduling ⋮ An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines ⋮ Scheduling identical parallel machines with tooling constraints ⋮ Minimizing total flow time on a single flexible machine ⋮ A simple and effective hybrid genetic search for the job sequencing and tool switching problem ⋮ Due date and cost-based FMS loading, scheduling and tool management ⋮ A matheuristic for parallel machine scheduling with tool replacements

Cites Work

• Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
• Solutions to a modified tool loading problem for a single FMM

This page was built for publication: Heuristic procedures for the parallel machine problem with tool switches