Exact and approximate algorithms for high-multiplicity parallel machine scheduling (Q1041349): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10951-009-0122-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1965652713 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear balancing flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: From fluid relaxations to practical algorithms for job shop scheduling: The makespan objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: A framework for the complexity of high-multiplicity scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiplicity and complexity issues in contemporary production scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with high multiplicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658190 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multi-exchange neighborhood for minimum makespan parallel machine scheduling problems / 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: On polynomial solvability of the high multiplicity total weighted tardiness problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bayesian Sequential Single Machine Scheduling Problem to Minimize the Expected Weighted Sum of Flowtimes of Jobs with Exponential Processing Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex separable optimization is not much harder than linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strongly Polynomial Algorithms for the High Multiplicity Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for an integer quadratic non-separable transportation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Minimizing Average Flow Time with Parallel Machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Approximate Algorithms for Scheduling Nonidentical Processors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Scheduling Independent Tasks with Restricted Execution Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach for Sequencing Groups of Identical Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Jobs on Several Machines with the Job Splitting Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel machine scheduling with splitting jobs / rank
 
Normal rank

Revision as of 06:29, 2 July 2024

scientific article
Language Label Description Also known as
English
Exact and approximate algorithms for high-multiplicity parallel machine scheduling
scientific article

    Statements

    Exact and approximate algorithms for high-multiplicity parallel machine scheduling (English)
    0 references
    0 references
    0 references
    2 December 2009
    0 references
    scheduling
    0 references
    parallel machines
    0 references
    high-multiplicity
    0 references
    computational complexity
    0 references
    0 references

    Identifiers