scientific article; zbMATH DE number 710070

From MaRDI portal

Revision as of 20:35, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4319400

Jump to:navigation, search

zbMath0814.90038MaRDI QIDQ4319400

Jean-Pierre Follonier

Publication date: 11 January 1995

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

heuristics flexible manufacturing systems tabu search single machine sequencing NP-hard tool management insertion method

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Production models (90B30) Combinatorial optimization (90C27)

Related Items (5)

An improved tabu search approach for solving the job shop scheduling problem with tooling constraints ⋮ An iterated local search procedure for the job sequencing and tool switching problem with non-identical parallel machines ⋮ Solving the Job Sequencing and Tool Switching Problem as a nonlinear least cost Hamiltonian cycle problem ⋮ Combinatorial optimization models for production scheduling in automated manufacturing systems ⋮ Scheduling multi-colour print jobs with sequence-dependent setup times

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4319400&oldid=18268866"