An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (Q1644059): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.amc.2013.12.127 / 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.1016/j.amc.2013.12.127 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2023010831 / 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: Q4247460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fifty years of scheduling: a survey of milestones / 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: The Single Machine Problem with Quadratic Penalty Function of Completion Times: A Branch-and-Bound Solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A scheduling problem with job values given as a power function of their completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling in a multi-processor environment with deteriorating job processing times and decreasing values: the case of forest fires / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with time deteriorating job values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single processor scheduling with job values depending on their completion times / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the asymptotic optimality and improved strategies of SPTB heuristic for open-shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4105990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open shop scheduling with machine dependent processing times / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.AMC.2013.12.127 / rank
 
Normal rank

Latest revision as of 00:35, 11 December 2024

scientific article
Language Label Description Also known as
English
An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times
scientific article

    Statements

    An extended study on an open-shop scheduling problem using the minimisation of the sum of quadratic completion times (English)
    0 references
    0 references
    0 references
    21 June 2018
    0 references
    scheduling
    0 references
    open shop
    0 references
    quadratic completion time
    0 references
    Lagrangian relaxation
    0 references
    dynamic programming
    0 references
    optimal property
    0 references

    Identifiers