Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
From MaRDI portal
Publication:4456055
DOI10.1002/nav.10045zbMath1044.90031OpenAlexW1964600358MaRDI QIDQ4456055
Evrim D. Güneş, M. Selim Akturk, Jay B. Ghosh
Publication date: 15 March 2004
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/11693/38104
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
Single-machine scheduling with workload-dependent tool change durations and equal processing time jobs to minimize total completion time ⋮ Mixed integer programming formulations for two-machine flow shop scheduling with an availability constraint ⋮ Scheduling two parallel machines with machine-dependent availabilities ⋮ Scheduling with tool changes to minimize total completion time under controllable machining conditions ⋮ A note on worst-case performance of heuristics for maintenance scheduling problems ⋮ Minimizing total completion time on a single machine with a flexible maintenance activity ⋮ Supply chain scheduling problem in the hospital with periodic working time on a single machine ⋮ The tool transporter movements problem in flexible manufacturing systems ⋮ Absolute bounds of list algorithms for parallel machines scheduling with unavailability periods ⋮ SINGLE MACHINE SCHEDULING WITH FORBIDDEN INTERVALS AND JOB DELIVERY TIMES ⋮ Job scheduling and management of wearing tools with stochastic tool lifetimes ⋮ Minimizing the number of tardy jobs in a single-machine scheduling problem with periodic maintenance ⋮ Scheduling with tool changes to minimize total completion time: Basic results and SPT performance ⋮ Minimizing maximum tardiness in single FMS machine scheduling with tool changes ⋮ Minimizing total flow time on a single flexible machine ⋮ Operational methods for minimization of energy consumption of manufacturing equipment ⋮ Makespan minimization for two parallel machines scheduling with a periodic availability constraint: mathematical programming model, average-case analysis, and anomalies ⋮ The general two-level storage management problem: a reconsideration of the KTNS-rule
This page was built for publication: Scheduling with tool changes to minimize total completion time: A study of heuristics and their performance
