Tabu search for the job-shop scheduling problem with multi-purpose machines
From MaRDI portal
Publication:1317529
DOI10.1007/BF01719451zbMath0798.90086MaRDI QIDQ1317529
Bernd Jurisch, Johann L. Hurink, Monika Thole
Publication date: 26 April 1994
Published in: OR Spektrum (Search for Journal in Brave)
90B35: Deterministic scheduling theory in operations research
90B30: Production models
90C27: Combinatorial optimization
Related Items
Flexible job-shop scheduling problem under resource constraints, Local search algorithms for a single-machine scheduling problem with positive and negative time-lags, Algorithmical approaches to business process design, A taxonomy of flexible flow line scheduling procedures, Multi-resource shop scheduling with resource flexibility, A new tabu search procedure for an audit-scheduling problem, A capacity-oriented hierarchical approach to single-item and small-batch production planning using project-scheduling methods, Tabu-search for the multi-mode job-shop problem, Job-shop scheduling with processing alternatives., Local search algorithms for the multiprocessor flow shop scheduling problem, Tabu search for resource-constrained scheduling, A heuristic to schedule flexible job-shop in a glass factory, Metaheuristics: A bibliography, Effective neighbourhood functions for the flexible job shop problem, A tabu search and a genetic algorithm for solving a bicriteria general job shop scheduling problem, A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems, A genetic algorithm for the flexible job-shop scheduling problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A practical use of Jackson's preemptive schedule for solving the job shop problem
- A block approach for single-machine scheduling with release dates and due dates
- Job-shop scheduling with multi-purpose machines
- A branch and bound algorithm for the job-shop scheduling problem
- Insertion techniques for the heuristic solution of the job shop problem
- Routing and scheduling in a flexible job shop by tabu search
- Applying tabu search to the job-shop scheduling problem
- The Shifting Bottleneck Procedure for Job Shop Scheduling
- The Single Machine Early/Tardy Problem
- An Algorithm for Solving the Job-Shop Problem
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- A Computational Study of the Job-Shop Scheduling Problem
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Bounds for Certain Multiprocessing Anomalies