Polynomial time approximation algorithms for proportionate open‐shop scheduling
From MaRDI portal
Publication:5246814
DOI10.1111/itor.12087zbMath1309.90030OpenAlexW1993127046MaRDI QIDQ5246814
Mehdi Yazdani, Bahman Naderi, Mostafa Zandieh
Publication date: 22 April 2015
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12087
Deterministic scheduling theory in operations research (90B35) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (8)
Some positive news on the proportionate open shop problem ⋮ Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ Complexity and approximation of open shop scheduling to minimize the makespan: a review of models and approaches ⋮ A self-tuning variable neighborhood search algorithm and an effective decoding scheme for open shop scheduling problems with travel/setup times ⋮ The LPT heuristic for minimizing total load on a proportionate openshop ⋮ Approximation algorithms for two-machine proportionate routing open shop on a tree ⋮ On the complexity of proportionate open shop and job shop problems ⋮ Four decades of research on the open-shop scheduling problem to minimize the makespan
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dense open-shop schedules with release times
- A genetic algorithm for the proportionate multiprocessor open shop
- Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
- The distributed permutation flowshop scheduling problem
- Open shop scheduling with machine dependent processing times
- Makespan minimization in open shops: A polynomial time approximation scheme
- Open-shop dense schedules: properties and worst-case performance ratio
- A study of integer programming formulations for scheduling problems
- New MILP models for the permutation flowshop problem
- Focused Scheduling in Proportionate Flowshops
- On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem
- Open Shop Scheduling to Minimize Finish Time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Approximation Algorithms for Three-Machine Open Shop Scheduling
- Short Shop Schedules
- Comparative evaluation of MILP flowshop models
- How good is a dense shop schedule?
This page was built for publication: Polynomial time approximation algorithms for proportionate open‐shop scheduling
