A new and practical heuristic for Master Production Scheduling creation (Q5385344): 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.1080/00207540600818187 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007533978 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved annealing scheme for the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for parallel machine scheduling with earliness-tardiness penalties and sequence-dependent set-up times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5479460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparative study of simulated annealing, genetic algorithms and tabu search for solving binary and comprehensive machine-grouping problems / rank
 
Normal rank

Latest revision as of 09:29, 28 June 2024

scientific article; zbMATH DE number 5271357
Language Label Description Also known as
English
A new and practical heuristic for Master Production Scheduling creation
scientific article; zbMATH DE number 5271357

    Statements