Polynomial time approximation algorithms for proportionate open‐shop scheduling (Q5246814): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mostafa Zandieh / rank
Normal rank
 
Property / author
 
Property / author: Mostafa Zandieh / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1111/itor.12087 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993127046 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Three-Machine Open Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open-shop dense schedules: properties and worst-case performance ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dense open-shop schedules with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good is a dense shop schedule? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with machine dependent processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open Shop Scheduling to Minimize Finish Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the proportionate multiprocessor open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for two special classes of the proportionate multiprocessor open shop / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distributed permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Focused Scheduling in Proportionate Flowshops / rank
 
Normal rank
Property / cites work
 
Property / cites work: A study of integer programming formulations for scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4252045 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Makespan minimization in open shops: A polynomial time approximation scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Development of a Mixed-Integer Linear Programming Model for the Flowshop Sequencing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative evaluation of MILP flowshop models / rank
 
Normal rank
Property / cites work
 
Property / cites work: New MILP models for the permutation flowshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Shop Schedules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3820362 / rank
 
Normal rank

Latest revision as of 00:23, 10 July 2024

scientific article; zbMATH DE number 6428802
Language Label Description Also known as
English
Polynomial time approximation algorithms for proportionate open‐shop scheduling
scientific article; zbMATH DE number 6428802

    Statements

    Polynomial time approximation algorithms for proportionate open‐shop scheduling (English)
    0 references
    0 references
    0 references
    0 references
    22 April 2015
    0 references
    proportionate open-shop
    0 references
    polynomial time approximation algorithm
    0 references
    worst-case performance analysis
    0 references

    Identifiers