APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS

DOI10.1142/S0129054105003030zbMath1089.90025MaRDI QIDQ5315931

Roberto Solis-Oba, Monaldo Mastrolilli, Klaus Jansen

Publication date: 12 September 2005

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59) Approximation algorithms (68W25)

Related Items (5)

Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem ⋮ Flexible job shop scheduling with blockages ⋮ Scheduling on parallel machines with preemption and transportation delays ⋮ Preemptive scheduling in the presence of transportation times ⋮ A research survey: review of flexible job shop scheduling techniques

Cites Work

• Unnamed Item
• Approximation algorithms for combinatorial problems
• Complexity of scheduling problems with multi-purpose machines
• Effective neighbourhood functions for the flexible job shop problem
• Better Approximation Guarantees for Job-Shop Scheduling
• Maximal Flow Through a Network
• Bounding algorithm for the routing problem with arbitrary paths and alternative servers
• Approximate Algorithms for the 0/1 Knapsack Problem
• Flowshop and Jobshop Schedules: Complexity and Approximation
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
• Improved Approximation Algorithms for Shop Scheduling Problems
• Short Shop Schedules
• Coordination Complexity of Parallel Price-Directive Decomposition
• Bounds for Certain Multiprocessing Anomalies
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems

This page was built for publication: APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS