A hierarchical approach for the FMS scheduling problem

DOI10.1016/0377-2217(95)00059-YzbMath0902.90086OpenAlexW2026494661MaRDI QIDQ1390190

Jan Paulli

Publication date: 14 July 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00059-y

zbMATH Keywords

hierarchical algorithmjob-shop schedulingflexible manufacturing system

Mathematics Subject Classification ID

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

Related Items (8)

Hierarchical structures in organizations: A conceptual framework ⋮ A neural network algorithm for servicing jobs with sequential and parallel machines ⋮ Maximizing the service level on the makespan in the stochastic flexible job-shop scheduling problem ⋮ A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem ⋮ Adaptive multimeme algorithm for flexible job shop scheduling problem ⋮ A genetic algorithm for the flexible job-shop scheduling problem ⋮ A discrete firefly algorithm for solving the flexible job-shop scheduling problem in a make-to-order manufacturing system ⋮ Multi-resource shop scheduling with resource flexibility

Cites Work

• Models and algorithms for job selection, routing, and scheduling in a flexible manufacturing system
• On queueing network models of flexible manufacturing systems
• An integrated approach for modeling and solving the general multiprocessor job-shop scheduling problem using tabu search
• Hierarchical structures in organizations: A conceptual framework
• A user's guide to tabu search
• Job Shop Scheduling by Simulated Annealing
• The Complexity of Flowshop and Jobshop Scheduling
• Parallel Taboo Search Techniques for the Job Shop Scheduling Problem
• Job Shop Scheduling by Local Search

This page was built for publication: A hierarchical approach for the FMS scheduling problem