scientific article; zbMATH DE number 1418275
From MaRDI portal
Publication:4941835
Recommendations
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- scientific article; zbMATH DE number 1560345
- scientific article; zbMATH DE number 1512677
- APPROXIMATION ALGORITHMS FOR FLEXIBLE JOB SHOP PROBLEMS
- Polynomial time approximation schemes for general multiprocessor job shop scheduling
Cited in
(11)- A probe-based algorithm for piecewise linear optimization in scheduling
- A linear programming-based method for job shop scheduling
- Lagrangian bounds for just-in-time job-shop scheduling
- Approximation schemes for job shop scheduling problems with controllable processing times
- Better approximation guarantees for job-shop scheduling
- Improved integer linear programming formulations for the job sequencing and tool switching problem
- Approximation Algorithms for the Assembly Line Crew Scheduling Problem
- Job Shop Scheduling with Setup Times and Maximal Time-Lags: A Simple Constraint Programming Approach
- Approximation Algorithms for Fixed Job Schedule Problems
- Makespan Minimization in Job Shops: A Linear Time Approximation Scheme
- scientific article; zbMATH DE number 1560345 (Why is no real title available?)
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 Q4941835)
