Scheduling with earliness-tardiness penalties and parallel machines (Q941007): 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/s10288-007-0055-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1996550953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the earliness-tardiness scheduling problem on parallel machines with distinct due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential neighborhood search for a parallel machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex quadratic and semidefinite programming relaxations in scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Continuous Assignment Problem and Its Application to Preemptive and Non-Preemptive Scheduling with Irregular Cost Functions / rank
 
Normal rank

Latest revision as of 16:06, 28 June 2024

scientific article
Language Label Description Also known as
English
Scheduling with earliness-tardiness penalties and parallel machines
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references