Minimizing total flow time on a single flexible machine
From MaRDI portal
Publication:988776
DOI10.1007/s10696-006-9000-6zbMath1197.90211OpenAlexW2025141975MaRDI QIDQ988776
İbrahim Karakayalı, Azizoglu, Meral
Publication date: 18 August 2010
Published in: International Journal of Flexible Manufacturing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10696-006-9000-6
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Deterministic scheduling theory in operations research (90B35)
Related Items (3)
The tool transporter movements problem in flexible manufacturing systems ⋮ Unsupervised parallel machines scheduling with tool switches ⋮ A matheuristic for parallel machine scheduling with tool replacements
Cites Work
- Scheduling with tool changes to minimize total completion time: Basic results and SPT performance
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Minimization of the Number of Tool Magazine Setups on Automated Machines: A Lagrangean Decomposition Approach
- Models Arising from a Flexible Manufacturing Machine, Part I: Minimization of the Number of Tool Switches
- Models Arising from a Flexible Manufacturing Machine, Part II: Minimization of the Number of Switching Instants
- Solutions to a modified tool loading problem for a single FMM
- Heuristic procedures for the parallel machine problem with tool switches
- Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
- Optimal tooling policy for a tool switching problem of a flexible machine with automatic tool transporter
This page was built for publication: Minimizing total flow time on a single flexible machine
