SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN (Q3052719): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Yu-Zhong Zhang / rank
Normal rank
 
Property / author
 
Property / author: Yu-Zhong Zhang / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling of unit-time jobs with controllable release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling with discretely controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Resource optimal control in some single-machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A permutation flow-shop scheduling problem with convex models of operation processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bicriterion Single Machine Scheduling with Resource Dependent Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with controllable release dates and processing times: Makespan minimization / 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: Time-optimal control in a single machine problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine scheduling problem with a common deadline and resource dependent release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single machine sequencing with linear models of release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Positive half-products and scheduling with controllable processing times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling to minimize the total weighted completion time with a constraint on the release time resource consumption / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of results for sequencing problems with controllable processing times / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1142/s0217595910002818 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2042737419 / rank
 
Normal rank

Latest revision as of 11:41, 30 July 2024

scientific article
Language Label Description Also known as
English
SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN
scientific article

    Statements

    SCHEDULING WITH DISCRETELY COMPRESSIBLE RELEASE DATES TO MINIMIZE MAKESPAN (English)
    0 references
    0 references
    0 references
    0 references
    1 November 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    scheduling
    0 references
    discretely compressible release dates
    0 references
    approximation algorithm
    0 references
    makespan
    0 references
    0 references