Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (Q2434281): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s10951-010-0185-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2075214065 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint-based scheduling: Applying constraint programming to scheduling problems. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling with release dates on a single machine to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling of a single machine to minimize total weighted completion time subject to release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4859840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ordonnancements à contraintes disjonctives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Single-machine scheduling with dynamic arrivals: Decomposition results and an improved algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n/1/?? dynamic deterministic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On single-machine scheduling without intermediate delays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4017560 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993992 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling with Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for single machine sequencing with release dates to minimize total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominance-based heuristics for one-machine total cost scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3217922 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4124328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating filtering techniques for numeric CSPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Letter to the Editor—A Proof of the Optimality of the Shortest Remaining Processing Time Discipline / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach to early/tardy scheduling with release dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Advances in Constraints / rank
 
Normal rank

Latest revision as of 07:31, 7 July 2024

scientific article
Language Label Description Also known as
English
Single-machine scheduling with no idle time and release dates to~minimize a regular criterion
scientific article

    Statements

    Single-machine scheduling with no idle time and release dates to~minimize a regular criterion (English)
    0 references
    0 references
    5 February 2014
    0 references
    non-idling scheduling
    0 references
    single machine
    0 references
    release dates
    0 references
    regular criteria
    0 references
    constraint programming
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers