APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS

DOI10.1142/S0129054105003030MaRDI QIDQ5315931zbMATH OpenFDO

Authors Monaldo Mastrolilli, Roberto Solis-Oba, Klaus Jansen

Publication date 12 September 2005

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

Full work available at URL https://doi.org/10.1142/S0129054105003030

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1512677
• Approximation Algorithms for Fixed Job Schedule Problems
• Approximation algorithms for two-stage flexible flow shop scheduling
• Approximation algorithms for the parallel flow shop problem
• Flexible job-shop scheduling problem under resource constraints
• Better approximation guarantees for job-shop scheduling
• Improved Approximation Algorithms for Shop Scheduling Problems
• Improved approximation algorithms for two-stage flexible flow shop scheduling
• Approximability of flow shop scheduling
• Approximation algorithm on two stage flexible flow-shop scheduling with parallel machines

Cites work

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

Cited in

(16)

• scientific article; zbMATH DE number 1560345 (Why is no real title available?)
• scientific article; zbMATH DE number 1512677 (Why is no real title available?)
• A fine-grained parallel algorithm for the cyclic flexible job shop problem
• An effective algorithm for flexible assembly job‐shop scheduling with tight job constraints
• Efficient algorithms for flexible job shop scheduling with parallel machines
• A Taxonomy for the Flexible Job Shop Scheduling Problem
• A research survey: review of flexible job shop scheduling techniques
• Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem
• Approximation Algorithms for Fixed Job Schedule Problems
• scientific article; zbMATH DE number 1418275 (Why is no real title available?)
• Improved Approximation Algorithms for Shop Scheduling Problems
• Preemptive scheduling in the presence of transportation times
• Scheduling jobshops with some identical or similar jobs
• Scheduling on parallel machines with preemption and transportation delays
• Maximization of solution flexibility for robust shop scheduling
• Flexible job shop scheduling with blockages

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5315931)