A GRASP for a difficult single machine scheduling problem (Q1184452): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1016/0305-0548(91)90001-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1971204143 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bi-criterion approach to minimizing inventory costs on a single machine when early shipments are forbidden / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An Improved Lower Bound for Minimizing Weighted Completion Times with Deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—A Branch-and-Bound Approach to the Bicriterion Scheduling Problem Involving Total Flowtime and Range of Lateness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-greedy heuristics: An empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic heuristic for a computationally difficult set covering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note—Operations Sequencing in Discrete Parts Manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:06, 15 May 2024

scientific article
Language Label Description Also known as
English
A GRASP for a difficult single machine scheduling problem
scientific article

    Statements

    Identifiers