scientific article; zbMATH DE number 1512677
From MaRDI portal
Publication:4508364
zbMATH Open0959.68009MaRDI QIDQ4508364FDOQ4508364
Authors: Monaldo Mastrolilli, Roberto Solis-Oba, Klaus Jansen 
Publication date: 3 October 2000
Title of this publication is not available (Why is that?)
Recommendations
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- 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
Cited In (16)
- Title not available (Why is that?)
- 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
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Dispatching algorithm for production programming of flexible job-shop systems in the smart factory industry
- Approximation Algorithms for Fixed Job Schedule Problems
- Improved approximation algorithms for scheduling with fixed jobs
- Title not available (Why is that?)
- Linguistic-based meta-heuristic optimization model for flexible job shop scheduling
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- A multi-objective production scheduling case study solved by simulated annealing
- Effective neighbourhood functions for the flexible job shop problem
- A genetic algorithm for the flexible job-shop scheduling problem
- Resource allocation algorithm for light communication grid-based workflows within an SLA context
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4508364)
