Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
From MaRDI portal
Publication:1038327
DOI10.1016/j.ejor.2009.03.048zbMath1176.90231OpenAlexW2045778967WikidataQ57440457 ScholiaQ57440457MaRDI QIDQ1038327
Marie E. Matta, Salah E. Elmaghraby
Publication date: 17 November 2009
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2009.03.048
Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (12)
Some positive news on the proportionate open shop problem ⋮ Exponential tightness for integral-type functionals of centered independent differently distributed random variables ⋮ Flexible open shop scheduling problem to minimize makespan ⋮ A united search particle swarm optimization algorithm for multiobjective scheduling problem ⋮ 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 ⋮ A tabu search approach for proportionate multiprocessor open shop scheduling ⋮ OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises ⋮ Large-scale medical examination scheduling technology based on intelligent optimization ⋮ A hybrid imperialist competitive algorithm for minimizing makespan in a multi-processor open shop ⋮ Polynomial time approximation algorithms for proportionate open‐shop scheduling
Cites Work
- Unnamed Item
- Unnamed Item
- A genetic algorithm for the proportionate multiprocessor open shop
- Scheduling open shops with parallel machines
- Makespan minimization in open shops: A polynomial time approximation scheme
- Approximation algorithms for the multiprocessor open shop scheduling problem
- Worst-case analysis of heuristics for open shops with parallel machines
- A Note On The Complexity Of Openshop Scheduling Problems
- Focused Scheduling in Proportionate Flowshops
- Scheduling Open Shops with Unit Execution Times to Minimize Functions of Due Dates
- Preemptive Scheduling of Independent Jobs with Release and Due Times on Open, Flow and Job Shops
- Minimizing Maximum Lateness in a Two-Machine Open Shop
- Open shop problems with unit time operations
- Open Shop Scheduling to Minimize Finish Time
- Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey
- Short Shop Schedules
- Modeling and analyzing a physician clinic environment using discrete-event (visual) simulation
- Linear time approximation scheme for the multiprocessor open shop problem
This page was built for publication: Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop
