A permutation flow-shop scheduling problem with convex models of operation processing times (Q1593519)

From MaRDI portal
Revision as of 23:02, 9 February 2024 by RedirectionBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A permutation flow-shop scheduling problem with convex models of operation processing times
scientific article

    Statements

    A permutation flow-shop scheduling problem with convex models of operation processing times (English)
    0 references
    17 January 2001
    0 references
    0 references
    flow-shop scheduling problem
    0 references
    processing order of the jobs
    0 references
    allocation of a constrained resource
    0 references
    computational complexity analysis
    0 references
    0 references
    0 references