Approximation schemes for job shop scheduling problems with controllable processing times
From MaRDI portal
Publication:2485329
DOI10.1016/J.EJOR.2004.03.025zbMATH Open1075.90029OpenAlexW1983488432MaRDI QIDQ2485329FDOQ2485329
Authors: Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba 
Publication date: 4 August 2005
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2004.03.025
Recommendations
- scientific article; zbMATH DE number 2044496
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- A linear time approximation scheme for the single machine scheduling problem with controllable processing times
- scientific article; zbMATH DE number 2089208
- Makespan minimization in job shops: a polynomial time approximation scheme
Cites Work
- An approximation algorithm for the generalized assignment problem
- Positive half-products and scheduling with controllable processing times
- A survey of results for sequencing problems with controllable processing times
- The Complexity of Flowshop and Jobshop Scheduling
- NP-hardness of shop-scheduling problems with three jobs
- Short Shop Schedules
- Linear Programming in O([n3/ln n]L) Operations
- Title not available (Why is that?)
- A two-machine flow shop scheduling problem with controllable job processing times
- Choosing the Job Sequence and Processing Times to Minimize Total Processing Plus Flow Cost on a Single Machine
- Flowshop and Jobshop Schedules: Complexity and Approximation
- Makespan minimization in job shops: a polynomial time approximation scheme
- Improved Approximation Algorithms for Shop Scheduling Problems
- Scheduling Multiple Variable-Speed Machines
- Coordination Complexity of Parallel Price-Directive Decomposition
- Bounding algorithm for the routing problem with arbitrary paths and alternative servers
- Single machine scheduling with discretely controllable processing times
- Scheduling to minimize the total compression and late costs
- A \(\frac 32\)-approximation algorithm for parallel machine scheduling with controllable processing times
- Better approximation guarantees for job-shop scheduling
- Proportionate flow shop with controllable processing times
- Title not available (Why is that?)
- An approximation algorithm for the \(m\)-machine permutation flow shop scheduling problem with controllable processing times
- Title not available (Why is that?)
Cited In (17)
- A decomposition approach to job-shop scheduling problem with discretely controllable processing times
- A survey of scheduling with controllable processing times
- Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches
- Schedule execution for two-machine flow-shop with interval processing times
- Loading and scheduling for flexible manufacturing systems with controllable processing times
- Job-shop scheduling with processing alternatives.
- Multi-population interactive coevolutionary algorithm for flexible job shop scheduling problems
- Double layer ACO algorithm for the multi-objective FJSSP
- Scheduling jobs with time-resource tradeoff via nonlinear programming
- A linear time approximation scheme for the single machine scheduling problem with controllable processing times
- Just-in-time scheduling with controllable processing times on parallel machines
- Title not available (Why is that?)
- Metaheuristics for the multi-objective FJSP with sequence-dependent set-up times, auxiliary resources and machine down time
- Two-machine open shop problem with controllable processing times
- Parallel machine scheduling with speed-up resources
- Approximation schemes for parallel machine scheduling problems with controllable processing times
- Title not available (Why is that?)
This page was built for publication: Approximation schemes for job shop scheduling problems with controllable processing times
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2485329)
